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

package/lib/test/shared-tree/summary.bench.js

@@ -1,111 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { IsoBuffer } from "@fluid-internal/client-utils";
-import { MockDeltaConnection, MockFluidDataStoreRuntime, MockStorage, } from "@fluidframework/test-runtime-utils";
-import { BenchmarkType, benchmark } from "@fluid-tools/benchmark";
-import { convertSummaryTreeToITree } from "@fluidframework/runtime-utils";
-import { SharedTreeFactory } from "../../shared-tree/index.js";
-import { TestTreeProviderLite, schematizeFlexTree, testIdCompressor } from "../utils.js";
-import { AllowedUpdateType } from "../../core/index.js";
-import { typeboxValidator } from "../../external-utilities/index.js";
-import { makeDeepContent, makeWideContentWithEndValue } from "../scalableTestTrees.js";
-// TODO: these tests currently only cover tree content.
-// It might make sense to extend them to cover complex collaboration windows.
-// number of nodes in test for wide trees
-const nodesCountWide = [
-    [1, 1000, 7000],
-    [10, 1000, 10000],
-    [100, 1000, 500000],
-];
-// number of nodes in test for deep trees
-const nodesCountDeep = [
-    [10, 1000, 25000],
-    [100, 1000, 1000000],
-    [200, 1000, 5000000],
-];
-describe("Summary benchmarks", () => {
-    // TODO: report these sizes as benchmark output which can be tracked over time.
-    describe("size of", () => {
-        it("an empty tree.", async () => {
-            const provider = new TestTreeProviderLite();
-            const tree = provider.trees[0];
-            const { summary } = tree.getAttachSummary(true);
-            const summaryString = JSON.stringify(summary);
-            const summarySize = IsoBuffer.from(summaryString).byteLength;
-            assert(summarySize < 700);
-        });
-        for (const [numberOfNodes, minLength, maxLength] of nodesCountWide) {
-            it(`a wide tree with ${numberOfNodes} nodes.`, async () => {
-                const summaryTree = getSummaryTree(makeWideContentWithEndValue(numberOfNodes, 1));
-                const summaryString = JSON.stringify(summaryTree);
-                const summarySize = IsoBuffer.from(summaryString).byteLength;
-                assert(summarySize > minLength);
-                assert(summarySize < maxLength);
-            });
-        }
-        for (const [numberOfNodes, minLength, maxLength] of nodesCountDeep) {
-            it(`a deep tree with ${numberOfNodes} nodes.`, async () => {
-                const summaryTree = getSummaryTree(makeDeepContent(numberOfNodes));
-                const summaryString = JSON.stringify(summaryTree);
-                const summarySize = IsoBuffer.from(summaryString).byteLength;
-                assert(summarySize > minLength);
-                assert(summarySize < maxLength);
-            });
-        }
-    });
-    describe("load speed of", () => {
-        function runSummaryBenchmark(title, content, type) {
-            let summaryTree;
-            const factory = new SharedTreeFactory({ jsonValidator: typeboxValidator });
-            benchmark({
-                title,
-                type,
-                before: async () => {
-                    summaryTree = convertSummaryTreeToITree(getSummaryTree(content));
-                },
-                benchmarkFnAsync: async () => {
-                    const services = {
-                        deltaConnection: new MockDeltaConnection(() => 0, () => { }),
-                        objectStorage: new MockStorage(summaryTree),
-                    };
-                    const datastoreRuntime = new MockFluidDataStoreRuntime({
-                        idCompressor: testIdCompressor,
-                    });
-                    await factory.load(datastoreRuntime, "test", services, factory.attributes);
-                },
-            });
-        }
-        for (const [nodeCount, type] of [
-            [1, BenchmarkType.Perspective],
-            [10, BenchmarkType.Perspective],
-            [100, BenchmarkType.Measurement],
-        ]) {
-            runSummaryBenchmark(`a deep tree with ${nodeCount} nodes}`, makeDeepContent(nodeCount), type);
-        }
-        for (const [nodeCount, type] of [
-            [10, BenchmarkType.Perspective],
-            [100, BenchmarkType.Measurement],
-        ]) {
-            runSummaryBenchmark(`a wide tree with ${nodeCount} nodes}`, makeWideContentWithEndValue(nodeCount, 1), type);
-        }
-    });
-});
-/**
- * @param content - content to full the tree with
- * @returns the tree's summary
- */
-function getSummaryTree(content) {
-    const provider = new TestTreeProviderLite();
-    const tree = provider.trees[0];
-    schematizeFlexTree(tree, {
-        ...content,
-        allowedSchemaModifications: AllowedUpdateType.Initialize,
-    });
-    provider.processMessages();
-    const { summary } = tree.getAttachSummary(true);
-    return summary;
-}
-//# sourceMappingURL=summary.bench.js.map

package/lib/test/shared-tree/summary.bench.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"summary.bench.js","sourceRoot":"","sources":["../../../src/test/shared-tree/summary.bench.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAGzD,OAAO,EACN,mBAAmB,EACnB,yBAAyB,EACzB,WAAW,GACX,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,yBAAyB,EAAE,MAAM,+BAA+B,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAe,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AACzF,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,OAAO,EAAE,eAAe,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAEvF,uDAAuD;AACvD,6EAA6E;AAE7E,yCAAyC;AACzC,MAAM,cAAc,GAAoE;IACvF,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IACf,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC;IACjB,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC;CACnB,CAAC;AACF,yCAAyC;AACzC,MAAM,cAAc,GAAoE;IACvF,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC;IACjB,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC;IACpB,CAAC,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,+EAA+E;IAC/E,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,gBAAgB,EAAE,KAAK,IAAI,EAAE;YAC/B,MAAM,QAAQ,GAAG,IAAI,oBAAoB,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAChD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC9C,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC;YAC7D,MAAM,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QACH,KAAK,MAAM,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,cAAc,EAAE;YACnE,EAAE,CAAC,oBAAoB,aAAa,SAAS,EAAE,KAAK,IAAI,EAAE;gBACzD,MAAM,WAAW,GAAG,cAAc,CAAC,2BAA2B,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC;gBAClF,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;gBAClD,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC;gBAC7D,MAAM,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;SACH;QACD,KAAK,MAAM,CAAC,aAAa,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,cAAc,EAAE;YACnE,EAAE,CAAC,oBAAoB,aAAa,SAAS,EAAE,KAAK,IAAI,EAAE;gBACzD,MAAM,WAAW,GAAG,cAAc,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC,CAAC;gBACnE,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;gBAClD,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,UAAU,CAAC;gBAC7D,MAAM,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;gBAChC,MAAM,CAAC,WAAW,GAAG,SAAS,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,SAAS,mBAAmB,CAAC,KAAa,EAAE,OAAoB,EAAE,IAAmB;YACpF,IAAI,WAAkB,CAAC;YACvB,MAAM,OAAO,GAAG,IAAI,iBAAiB,CAAC,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC,CAAC;YAC3E,SAAS,CAAC;gBACT,KAAK;gBACL,IAAI;gBACJ,MAAM,EAAE,KAAK,IAAI,EAAE;oBAClB,WAAW,GAAG,yBAAyB,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;gBAClE,CAAC;gBACD,gBAAgB,EAAE,KAAK,IAAI,EAAE;oBAC5B,MAAM,QAAQ,GAAqB;wBAClC,eAAe,EAAE,IAAI,mBAAmB,CACvC,GAAG,EAAE,CAAC,CAAC,EACP,GAAG,EAAE,GAAE,CAAC,CACR;wBACD,aAAa,EAAE,IAAI,WAAW,CAAC,WAAW,CAAC;qBAC3C,CAAC;oBACF,MAAM,gBAAgB,GAAG,IAAI,yBAAyB,CAAC;wBACtD,YAAY,EAAE,gBAAgB;qBAC9B,CAAC,CAAC;oBACH,MAAM,OAAO,CAAC,IAAI,CAAC,gBAAgB,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;gBAC5E,CAAC;aACD,CAAC,CAAC;QACJ,CAAC;QAED,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI;YAC/B,CAAC,CAAC,EAAE,aAAa,CAAC,WAAW,CAAC;YAC9B,CAAC,EAAE,EAAE,aAAa,CAAC,WAAW,CAAC;YAC/B,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC;SAChC,EAAE;YACF,mBAAmB,CAClB,oBAAoB,SAAS,SAAS,EACtC,eAAe,CAAC,SAAS,CAAC,EAC1B,IAAI,CACJ,CAAC;SACF;QAED,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI;YAC/B,CAAC,EAAE,EAAE,aAAa,CAAC,WAAW,CAAC;YAC/B,CAAC,GAAG,EAAE,aAAa,CAAC,WAAW,CAAC;SAChC,EAAE;YACF,mBAAmB,CAClB,oBAAoB,SAAS,SAAS,EACtC,2BAA2B,CAAC,SAAS,EAAE,CAAC,CAAC,EACzC,IAAI,CACJ,CAAC;SACF;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH;;;GAGG;AACH,SAAS,cAAc,CAAC,OAAoB;IAC3C,MAAM,QAAQ,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC5C,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/B,kBAAkB,CAAC,IAAI,EAAE;QACxB,GAAG,OAAO;QACV,0BAA0B,EAAE,iBAAiB,CAAC,UAAU;KACxD,CAAC,CAAC;IACH,QAAQ,CAAC,eAAe,EAAE,CAAC;IAC3B,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAChD,OAAO,OAAO,CAAC;AAChB,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 { IsoBuffer } from \"@fluid-internal/client-utils\";\nimport { ISummaryTree, ITree } from \"@fluidframework/protocol-definitions\";\nimport { IChannelServices } from \"@fluidframework/datastore-definitions\";\nimport {\n\tMockDeltaConnection,\n\tMockFluidDataStoreRuntime,\n\tMockStorage,\n} from \"@fluidframework/test-runtime-utils\";\nimport { BenchmarkType, benchmark } from \"@fluid-tools/benchmark\";\nimport { convertSummaryTreeToITree } from \"@fluidframework/runtime-utils\";\nimport { SharedTreeFactory, TreeContent } from \"../../shared-tree/index.js\";\nimport { TestTreeProviderLite, schematizeFlexTree, testIdCompressor } from \"../utils.js\";\nimport { AllowedUpdateType } from \"../../core/index.js\";\nimport { typeboxValidator } from \"../../external-utilities/index.js\";\nimport { makeDeepContent, makeWideContentWithEndValue } from \"../scalableTestTrees.js\";\n\n// TODO: these tests currently only cover tree content.\n// It might make sense to extend them to cover complex collaboration windows.\n\n// number of nodes in test for wide trees\nconst nodesCountWide: [numberOfNodes: number, minLength: number, maxLength: number][] = [\n\t[1, 1000, 7000],\n\t[10, 1000, 10000],\n\t[100, 1000, 500000],\n];\n// number of nodes in test for deep trees\nconst nodesCountDeep: [numberOfNodes: number, minLength: number, maxLength: number][] = [\n\t[10, 1000, 25000],\n\t[100, 1000, 1000000],\n\t[200, 1000, 5000000],\n];\n\ndescribe(\"Summary benchmarks\", () => {\n\t// TODO: report these sizes as benchmark output which can be tracked over time.\n\tdescribe(\"size of\", () => {\n\t\tit(\"an empty tree.\", async () => {\n\t\t\tconst provider = new TestTreeProviderLite();\n\t\t\tconst tree = provider.trees[0];\n\t\t\tconst { summary } = tree.getAttachSummary(true);\n\t\t\tconst summaryString = JSON.stringify(summary);\n\t\t\tconst summarySize = IsoBuffer.from(summaryString).byteLength;\n\t\t\tassert(summarySize < 700);\n\t\t});\n\t\tfor (const [numberOfNodes, minLength, maxLength] of nodesCountWide) {\n\t\t\tit(`a wide tree with ${numberOfNodes} nodes.`, async () => {\n\t\t\t\tconst summaryTree = getSummaryTree(makeWideContentWithEndValue(numberOfNodes, 1));\n\t\t\t\tconst summaryString = JSON.stringify(summaryTree);\n\t\t\t\tconst summarySize = IsoBuffer.from(summaryString).byteLength;\n\t\t\t\tassert(summarySize > minLength);\n\t\t\t\tassert(summarySize < maxLength);\n\t\t\t});\n\t\t}\n\t\tfor (const [numberOfNodes, minLength, maxLength] of nodesCountDeep) {\n\t\t\tit(`a deep tree with ${numberOfNodes} nodes.`, async () => {\n\t\t\t\tconst summaryTree = getSummaryTree(makeDeepContent(numberOfNodes));\n\t\t\t\tconst summaryString = JSON.stringify(summaryTree);\n\t\t\t\tconst summarySize = IsoBuffer.from(summaryString).byteLength;\n\t\t\t\tassert(summarySize > minLength);\n\t\t\t\tassert(summarySize < maxLength);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"load speed of\", () => {\n\t\tfunction runSummaryBenchmark(title: string, content: TreeContent, type: BenchmarkType) {\n\t\t\tlet summaryTree: ITree;\n\t\t\tconst factory = new SharedTreeFactory({ jsonValidator: typeboxValidator });\n\t\t\tbenchmark({\n\t\t\t\ttitle,\n\t\t\t\ttype,\n\t\t\t\tbefore: async () => {\n\t\t\t\t\tsummaryTree = convertSummaryTreeToITree(getSummaryTree(content));\n\t\t\t\t},\n\t\t\t\tbenchmarkFnAsync: async () => {\n\t\t\t\t\tconst services: IChannelServices = {\n\t\t\t\t\t\tdeltaConnection: new MockDeltaConnection(\n\t\t\t\t\t\t\t() => 0,\n\t\t\t\t\t\t\t() => {},\n\t\t\t\t\t\t),\n\t\t\t\t\t\tobjectStorage: new MockStorage(summaryTree),\n\t\t\t\t\t};\n\t\t\t\t\tconst datastoreRuntime = new MockFluidDataStoreRuntime({\n\t\t\t\t\t\tidCompressor: testIdCompressor,\n\t\t\t\t\t});\n\t\t\t\t\tawait factory.load(datastoreRuntime, \"test\", services, factory.attributes);\n\t\t\t\t},\n\t\t\t});\n\t\t}\n\n\t\tfor (const [nodeCount, type] of [\n\t\t\t[1, BenchmarkType.Perspective],\n\t\t\t[10, BenchmarkType.Perspective],\n\t\t\t[100, BenchmarkType.Measurement],\n\t\t]) {\n\t\t\trunSummaryBenchmark(\n\t\t\t\t`a deep tree with ${nodeCount} nodes}`,\n\t\t\t\tmakeDeepContent(nodeCount),\n\t\t\t\ttype,\n\t\t\t);\n\t\t}\n\n\t\tfor (const [nodeCount, type] of [\n\t\t\t[10, BenchmarkType.Perspective],\n\t\t\t[100, BenchmarkType.Measurement],\n\t\t]) {\n\t\t\trunSummaryBenchmark(\n\t\t\t\t`a wide tree with ${nodeCount} nodes}`,\n\t\t\t\tmakeWideContentWithEndValue(nodeCount, 1),\n\t\t\t\ttype,\n\t\t\t);\n\t\t}\n\t});\n});\n\n/**\n * @param content - content to full the tree with\n * @returns the tree's summary\n */\nfunction getSummaryTree(content: TreeContent): ISummaryTree {\n\tconst provider = new TestTreeProviderLite();\n\tconst tree = provider.trees[0];\n\tschematizeFlexTree(tree, {\n\t\t...content,\n\t\tallowedSchemaModifications: AllowedUpdateType.Initialize,\n\t});\n\tprovider.processMessages();\n\tconst { summary } = tree.getAttachSummary(true);\n\treturn summary;\n}\n"]}

package/lib/test/shared-tree/treeApi.spec.d.ts

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

package/lib/test/shared-tree/treeApi.spec.d.ts.map

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

package/lib/test/shared-tree/treeApi.spec.js

@@ -1,151 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "node:assert";
-import { CheckoutFlexTreeView, Tree } from "../../shared-tree/index.js";
-import { SchemaFactory, TreeConfiguration } from "../../simple-tree/index.js";
-import { createTestUndoRedoStacks, getView } from "../utils.js";
-const schema = new SchemaFactory("com.example");
-class TestObject extends schema.object("TestObject", { content: schema.number }) {
-}
-describe("treeApi", () => {
-    describe("runTransaction invoked via a tree view", () => {
-        it("runs transactions", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            Tree.runTransaction(view, (root) => {
-                root.content = 43;
-            });
-            assert.equal(view.root.content, 43);
-        });
-        it("can be rolled back", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            Tree.runTransaction(view, (root) => {
-                root.content = 43;
-                return "rollback";
-            });
-            assert.equal(view.root.content, 42);
-        });
-        it("rolls back transactions on error", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            try {
-                Tree.runTransaction(view, (root) => {
-                    root.content = 43;
-                    throw Error("Oh no");
-                });
-            }
-            catch (e) {
-                assert(e instanceof Error);
-                assert.equal(e.message, "Oh no");
-            }
-            assert.equal(view.root.content, 42);
-        });
-        // TODO: Either enable when afterBatch is implemented, or delete if no longer relevant
-        it.skip("emits change events", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            let event = false;
-            view.events.on("afterBatch", () => (event = true));
-            view.root.content = 44;
-            Tree.runTransaction(view, (root) => {
-                root.content = 43;
-            });
-            assert.equal(event, true);
-        });
-        it.skip("emits change events on rollback", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            let eventCount = 0;
-            view.events.on("afterBatch", () => (eventCount += 1));
-            Tree.runTransaction(view, (r) => {
-                r.content = 43;
-                return "rollback";
-            });
-            assert.equal(eventCount, 2);
-        });
-        it("undoes and redoes entire transaction", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            const checkoutView = view.getViewOrError();
-            assert(checkoutView instanceof CheckoutFlexTreeView);
-            const { undoStack, redoStack } = createTestUndoRedoStacks(checkoutView.checkout.events);
-            Tree.runTransaction(view, (root) => {
-                root.content = 43;
-                root.content = 44;
-            });
-            assert.equal(view.root.content, 44);
-            assert.equal(undoStack.length, 1);
-            undoStack[0].revert();
-            assert.equal(view.root.content, 42);
-            assert.equal(redoStack.length, 1);
-            redoStack[0].revert();
-            assert.equal(view.root.content, 44);
-        });
-    });
-    describe("runTransaction invoked via a node", () => {
-        it("runs transactions", () => {
-            const { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            Tree.runTransaction(root, (r) => {
-                r.content = 43;
-            });
-            assert.equal(root.content, 43);
-        });
-        it("can be rolled back", () => {
-            const { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            Tree.runTransaction(root, (r) => {
-                r.content = 43;
-                return "rollback";
-            });
-            assert.equal(root.content, 42);
-        });
-        it("rolls back transactions on error", () => {
-            const { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            try {
-                Tree.runTransaction(root, (r) => {
-                    r.content = 43;
-                    throw Error("Oh no");
-                });
-            }
-            catch (e) {
-                assert(e instanceof Error);
-                assert.equal(e.message, "Oh no");
-            }
-            assert.equal(root.content, 42);
-        });
-        it("emits change events", () => {
-            const { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            let event = false;
-            Tree.on(root, "afterChange", () => (event = true));
-            Tree.runTransaction(root, (r) => {
-                r.content = 43;
-            });
-            assert.equal(event, true);
-        });
-        it("emits change events on rollback", () => {
-            const { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            let eventCount = 0;
-            Tree.on(root, "afterChange", () => (eventCount += 1));
-            Tree.runTransaction(root, (r) => {
-                r.content = 43;
-                return "rollback";
-            });
-            assert.equal(eventCount, 2);
-        });
-        it("undoes and redoes entire transaction", () => {
-            const view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));
-            const checkoutView = view.getViewOrError();
-            assert(checkoutView instanceof CheckoutFlexTreeView);
-            const { undoStack, redoStack } = createTestUndoRedoStacks(checkoutView.checkout.events);
-            Tree.runTransaction(view.root, (r) => {
-                r.content = 43;
-                r.content = 44;
-            });
-            assert.equal(view.root.content, 44);
-            assert.equal(undoStack.length, 1);
-            undoStack[0].revert();
-            assert.equal(view.root.content, 42);
-            assert.equal(redoStack.length, 1);
-            redoStack[0].revert();
-            assert.equal(view.root.content, 44);
-        });
-        // TODO: When SchematizingSimpleTreeView supports forking, add test coverage to ensure that transactions work properly on forks
-    });
-});
-//# sourceMappingURL=treeApi.spec.js.map

package/lib/test/shared-tree/treeApi.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"treeApi.spec.js","sourceRoot":"","sources":["../../../src/test/shared-tree/treeApi.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,iBAAiB,EAAE,MAAM,4BAA4B,CAAC;AAC9E,OAAO,EAAE,wBAAwB,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAEhE,MAAM,MAAM,GAAG,IAAI,aAAa,CAAC,aAAa,CAAC,CAAC;AAChD,MAAM,UAAW,SAAQ,MAAM,CAAC,MAAM,CAAC,YAAY,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;CAAG;AAEnF,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACxB,QAAQ,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACvD,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;gBAClB,OAAO,UAAU,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI;gBACH,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;oBAClC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;oBAClB,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;gBACtB,CAAC,CAAC,CAAC;aACH;YAAC,OAAO,CAAC,EAAE;gBACX,MAAM,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;aACjC;YACD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,sFAAsF;QACtF,EAAE,CAAC,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;YACnC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC/C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;gBACf,OAAO,UAAU,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAC3C,MAAM,CAAC,YAAY,YAAY,oBAAoB,CAAC,CAAC;YACrD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,wBAAwB,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAExF,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAClC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;gBAClB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAClD,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;gBACf,OAAO,UAAU,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI;gBACH,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;oBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;oBACf,MAAM,KAAK,CAAC,OAAO,CAAC,CAAC;gBACtB,CAAC,CAAC,CAAC;aACH;YAAC,OAAO,CAAC,EAAE;gBACX,MAAM,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC;gBAC3B,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;aACjC;YACD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC1C,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACrF,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC;YACtD,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBAC/B,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;gBACf,OAAO,UAAU,CAAC;YACnB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC/C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,iBAAiB,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;YACjF,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YAC3C,MAAM,CAAC,YAAY,YAAY,oBAAoB,CAAC,CAAC;YACrD,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,wBAAwB,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAExF,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE;gBACpC,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;gBACf,CAAC,CAAC,OAAO,GAAG,EAAE,CAAC;YAChB,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;YACpC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;YACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,+HAA+H;IAChI,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 */\nimport { strict as assert } from \"node:assert\";\nimport { CheckoutFlexTreeView, Tree } from \"../../shared-tree/index.js\";\nimport { SchemaFactory, TreeConfiguration } from \"../../simple-tree/index.js\";\nimport { createTestUndoRedoStacks, getView } from \"../utils.js\";\n\nconst schema = new SchemaFactory(\"com.example\");\nclass TestObject extends schema.object(\"TestObject\", { content: schema.number }) {}\n\ndescribe(\"treeApi\", () => {\n\tdescribe(\"runTransaction invoked via a tree view\", () => {\n\t\tit(\"runs transactions\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tTree.runTransaction(view, (root) => {\n\t\t\t\troot.content = 43;\n\t\t\t});\n\t\t\tassert.equal(view.root.content, 43);\n\t\t});\n\n\t\tit(\"can be rolled back\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tTree.runTransaction(view, (root) => {\n\t\t\t\troot.content = 43;\n\t\t\t\treturn \"rollback\";\n\t\t\t});\n\t\t\tassert.equal(view.root.content, 42);\n\t\t});\n\n\t\tit(\"rolls back transactions on error\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\ttry {\n\t\t\t\tTree.runTransaction(view, (root) => {\n\t\t\t\t\troot.content = 43;\n\t\t\t\t\tthrow Error(\"Oh no\");\n\t\t\t\t});\n\t\t\t} catch (e) {\n\t\t\t\tassert(e instanceof Error);\n\t\t\t\tassert.equal(e.message, \"Oh no\");\n\t\t\t}\n\t\t\tassert.equal(view.root.content, 42);\n\t\t});\n\n\t\t// TODO: Either enable when afterBatch is implemented, or delete if no longer relevant\n\t\tit.skip(\"emits change events\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tlet event = false;\n\t\t\tview.events.on(\"afterBatch\", () => (event = true));\n\t\t\tview.root.content = 44;\n\t\t\tTree.runTransaction(view, (root) => {\n\t\t\t\troot.content = 43;\n\t\t\t});\n\t\t\tassert.equal(event, true);\n\t\t});\n\n\t\tit.skip(\"emits change events on rollback\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tlet eventCount = 0;\n\t\t\tview.events.on(\"afterBatch\", () => (eventCount += 1));\n\t\t\tTree.runTransaction(view, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t\treturn \"rollback\";\n\t\t\t});\n\t\t\tassert.equal(eventCount, 2);\n\t\t});\n\n\t\tit(\"undoes and redoes entire transaction\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tconst checkoutView = view.getViewOrError();\n\t\t\tassert(checkoutView instanceof CheckoutFlexTreeView);\n\t\t\tconst { undoStack, redoStack } = createTestUndoRedoStacks(checkoutView.checkout.events);\n\n\t\t\tTree.runTransaction(view, (root) => {\n\t\t\t\troot.content = 43;\n\t\t\t\troot.content = 44;\n\t\t\t});\n\t\t\tassert.equal(view.root.content, 44);\n\t\t\tassert.equal(undoStack.length, 1);\n\t\t\tundoStack[0].revert();\n\t\t\tassert.equal(view.root.content, 42);\n\t\t\tassert.equal(redoStack.length, 1);\n\t\t\tredoStack[0].revert();\n\t\t\tassert.equal(view.root.content, 44);\n\t\t});\n\t});\n\n\tdescribe(\"runTransaction invoked via a node\", () => {\n\t\tit(\"runs transactions\", () => {\n\t\t\tconst { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tTree.runTransaction(root, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t});\n\t\t\tassert.equal(root.content, 43);\n\t\t});\n\n\t\tit(\"can be rolled back\", () => {\n\t\t\tconst { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tTree.runTransaction(root, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t\treturn \"rollback\";\n\t\t\t});\n\t\t\tassert.equal(root.content, 42);\n\t\t});\n\n\t\tit(\"rolls back transactions on error\", () => {\n\t\t\tconst { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\ttry {\n\t\t\t\tTree.runTransaction(root, (r) => {\n\t\t\t\t\tr.content = 43;\n\t\t\t\t\tthrow Error(\"Oh no\");\n\t\t\t\t});\n\t\t\t} catch (e) {\n\t\t\t\tassert(e instanceof Error);\n\t\t\t\tassert.equal(e.message, \"Oh no\");\n\t\t\t}\n\t\t\tassert.equal(root.content, 42);\n\t\t});\n\n\t\tit(\"emits change events\", () => {\n\t\t\tconst { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tlet event = false;\n\t\t\tTree.on(root, \"afterChange\", () => (event = true));\n\t\t\tTree.runTransaction(root, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t});\n\t\t\tassert.equal(event, true);\n\t\t});\n\n\t\tit(\"emits change events on rollback\", () => {\n\t\t\tconst { root } = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tlet eventCount = 0;\n\t\t\tTree.on(root, \"afterChange\", () => (eventCount += 1));\n\t\t\tTree.runTransaction(root, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t\treturn \"rollback\";\n\t\t\t});\n\t\t\tassert.equal(eventCount, 2);\n\t\t});\n\n\t\tit(\"undoes and redoes entire transaction\", () => {\n\t\t\tconst view = getView(new TreeConfiguration(TestObject, () => ({ content: 42 })));\n\t\t\tconst checkoutView = view.getViewOrError();\n\t\t\tassert(checkoutView instanceof CheckoutFlexTreeView);\n\t\t\tconst { undoStack, redoStack } = createTestUndoRedoStacks(checkoutView.checkout.events);\n\n\t\t\tTree.runTransaction(view.root, (r) => {\n\t\t\t\tr.content = 43;\n\t\t\t\tr.content = 44;\n\t\t\t});\n\t\t\tassert.equal(view.root.content, 44);\n\t\t\tassert.equal(undoStack.length, 1);\n\t\t\tundoStack[0].revert();\n\t\t\tassert.equal(view.root.content, 42);\n\t\t\tassert.equal(redoStack.length, 1);\n\t\t\tredoStack[0].revert();\n\t\t\tassert.equal(view.root.content, 44);\n\t\t});\n\n\t\t// TODO: When SchematizingSimpleTreeView supports forking, add test coverage to ensure that transactions work properly on forks\n\t});\n});\n"]}

package/lib/test/shared-tree/treeCheckout.spec.d.ts

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

package/lib/test/shared-tree/treeCheckout.spec.d.ts.map

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