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

package/lib/test/rebase/fuzz.js

@@ -1,57 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { makeRandom } from "@fluid-private/stochastic-test-utils";
-import { unreachableCase } from "@fluidframework/core-utils";
-import { makeAnonChange, revisionMetadataSourceFromInfo } from "../../core/index.js";
-var Operation;
-(function (Operation) {
-    Operation[Operation["Rebase"] = 0] = "Rebase";
-    Operation[Operation["Compose"] = 1] = "Compose";
-    Operation[Operation["Invert"] = 2] = "Invert";
-})(Operation || (Operation = {}));
-/**
- *
- * @param rebaser - `ChangeRebaser` instance used to combine generated changes
- * @param changeGenerator - Random change generator function
- * @param seed - Seed used to randomly generate and combine the changes
- * @param maxCombinations - Maximum number of changes to combine in order
- * to produce the final change. Must be greater or equal to 0.
- * @returns A random change resulting from the combination of several random changes.
- */
-export function generateFuzzyCombinedChange(rebaser, changeGenerator, seed, maxCombinations) {
-    const random = makeRandom(seed);
-    const rebase = rebaser.rebase.bind(rebaser);
-    const compose = rebaser.compose.bind(rebaser);
-    const invert = rebaser.invert.bind(rebaser);
-    let change = changeGenerator(seed);
-    // Rules for combining changes:
-    // - We must not combine a change with itself
-    // - We must not rebase a change over itself
-    // - We must not rebase a change over its inverse
-    // - We can only combine a change with its inverse if the inverse comes after the original
-    // - We can only combine a change with its inverse if it hasn't already been combined with its inverse
-    for (let i = random.integer(0, maxCombinations); i > 0; --i) {
-        const operation = random.integer(Operation.Rebase, Operation.Invert);
-        switch (operation) {
-            case Operation.Rebase:
-                change = rebase(change, makeAnonChange(changeGenerator(random.real())), revisionMetadataSourceFromInfo([]));
-                break;
-            case Operation.Compose:
-                change = compose([
-                    makeAnonChange(change),
-                    makeAnonChange(changeGenerator(random.real())),
-                ]);
-                break;
-            case Operation.Invert:
-                // TODO: test rollback inversions as well
-                change = invert(makeAnonChange(change), false);
-                break;
-            default:
-                unreachableCase(operation);
-        }
-    }
-    return change;
-}
-//# sourceMappingURL=fuzz.js.map

package/lib/test/rebase/fuzz.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fuzz.js","sourceRoot":"","sources":["../../../src/test/rebase/fuzz.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAiB,cAAc,EAAE,8BAA8B,EAAE,MAAM,qBAAqB,CAAC;AAEpG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACb,6CAAU,CAAA;IACV,+CAAW,CAAA;IACX,6CAAU,CAAA;AACX,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,2BAA2B,CAC1C,OAA+B,EAC/B,eAA0C,EAC1C,IAAY,EACZ,eAAuB;IAEvB,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAE5C,IAAI,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;IAEnC,+BAA+B;IAC/B,6CAA6C;IAC7C,4CAA4C;IAC5C,iDAAiD;IACjD,0FAA0F;IAC1F,sGAAsG;IACtG,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,eAAe,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;QAC5D,MAAM,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,MAAM,CAAc,CAAC;QAClF,QAAQ,SAAS,EAAE;YAClB,KAAK,SAAS,CAAC,MAAM;gBACpB,MAAM,GAAG,MAAM,CACd,MAAM,EACN,cAAc,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,EAC9C,8BAA8B,CAAC,EAAE,CAAC,CAClC,CAAC;gBACF,MAAM;YACP,KAAK,SAAS,CAAC,OAAO;gBACrB,MAAM,GAAG,OAAO,CAAC;oBAChB,cAAc,CAAC,MAAM,CAAC;oBACtB,cAAc,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;iBAC9C,CAAC,CAAC;gBACH,MAAM;YACP,KAAK,SAAS,CAAC,MAAM;gBACpB,yCAAyC;gBACzC,MAAM,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC/C,MAAM;YACP;gBACC,eAAe,CAAC,SAAS,CAAC,CAAC;SAC5B;KACD;IACD,OAAO,MAAM,CAAC;AACf,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { unreachableCase } from \"@fluidframework/core-utils\";\nimport { ChangeRebaser, makeAnonChange, revisionMetadataSourceFromInfo } from \"../../core/index.js\";\n\nenum Operation {\n\tRebase = 0,\n\tCompose = 1,\n\tInvert = 2,\n}\n\n/**\n *\n * @param rebaser - `ChangeRebaser` instance used to combine generated changes\n * @param changeGenerator - Random change generator function\n * @param seed - Seed used to randomly generate and combine the changes\n * @param maxCombinations - Maximum number of changes to combine in order\n * to produce the final change. Must be greater or equal to 0.\n * @returns A random change resulting from the combination of several random changes.\n */\nexport function generateFuzzyCombinedChange<TChange>(\n\trebaser: ChangeRebaser<TChange>,\n\tchangeGenerator: (seed: number) => TChange,\n\tseed: number,\n\tmaxCombinations: number,\n): TChange {\n\tconst random = makeRandom(seed);\n\tconst rebase = rebaser.rebase.bind(rebaser);\n\tconst compose = rebaser.compose.bind(rebaser);\n\tconst invert = rebaser.invert.bind(rebaser);\n\n\tlet change = changeGenerator(seed);\n\n\t// Rules for combining changes:\n\t// - We must not combine a change with itself\n\t// - We must not rebase a change over itself\n\t// - We must not rebase a change over its inverse\n\t// - We can only combine a change with its inverse if the inverse comes after the original\n\t// - We can only combine a change with its inverse if it hasn't already been combined with its inverse\n\tfor (let i = random.integer(0, maxCombinations); i > 0; --i) {\n\t\tconst operation = random.integer(Operation.Rebase, Operation.Invert) as Operation;\n\t\tswitch (operation) {\n\t\t\tcase Operation.Rebase:\n\t\t\t\tchange = rebase(\n\t\t\t\t\tchange,\n\t\t\t\t\tmakeAnonChange(changeGenerator(random.real())),\n\t\t\t\t\trevisionMetadataSourceFromInfo([]),\n\t\t\t\t);\n\t\t\t\tbreak;\n\t\t\tcase Operation.Compose:\n\t\t\t\tchange = compose([\n\t\t\t\t\tmakeAnonChange(change),\n\t\t\t\t\tmakeAnonChange(changeGenerator(random.real())),\n\t\t\t\t]);\n\t\t\t\tbreak;\n\t\t\tcase Operation.Invert:\n\t\t\t\t// TODO: test rollback inversions as well\n\t\t\t\tchange = invert(makeAnonChange(change), false);\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tunreachableCase(operation);\n\t\t}\n\t}\n\treturn change;\n}\n"]}

package/lib/test/rebase/generateFuzzyCombinedChange.spec.d.ts

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

package/lib/test/rebase/generateFuzzyCombinedChange.spec.d.ts.map

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

package/lib/test/rebase/generateFuzzyCombinedChange.spec.js

@@ -1,42 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { generateFuzzyCombinedChange } from "./fuzz.js";
-const testSeed = 432167897;
-const testRebaser = {
-    compose: (changes) => changes.map((c) => c.change),
-    invert: (change) => ({ I: change.change }),
-    rebase: (change, over) => ({ C: change, O: over.change }),
-};
-function generateRandomChange(seed) {
-    return seed;
-}
-describe("generateFuzzyCombinedChange", () => {
-    it("consistent given the same seed", () => {
-        const change1 = generateFuzzyCombinedChange(testRebaser, generateRandomChange, testSeed, 10);
-        const change2 = generateFuzzyCombinedChange(testRebaser, generateRandomChange, testSeed, 10);
-        assert.deepStrictEqual(change1, change2);
-    });
-    it("generates random combination of changes", () => {
-        const change1 = generateFuzzyCombinedChange(testRebaser, generateRandomChange, testSeed, 15);
-        const expected = {
-            C: {
-                C: {
-                    C: [
-                        {
-                            I: 432167897,
-                        },
-                        0.9933325823949589,
-                    ],
-                    O: 0.6981920829135596,
-                },
-                O: 0.013476674234232933,
-            },
-            O: 0.9375291806987182,
-        };
-        assert.deepStrictEqual(change1, expected);
-    });
-});
-//# sourceMappingURL=generateFuzzyCombinedChange.spec.js.map

package/lib/test/rebase/generateFuzzyCombinedChange.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"generateFuzzyCombinedChange.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/generateFuzzyCombinedChange.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,2BAA2B,EAAE,MAAM,WAAW,CAAC;AAExD,MAAM,QAAQ,GAAG,SAAS,CAAC;AAI3B,MAAM,WAAW,GAA8B;IAC9C,OAAO,EAAE,CAAC,OAAmC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9E,MAAM,EAAE,CAAC,MAAgC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;IACpE,MAAM,EAAE,CAAC,MAAkB,EAAE,IAA8B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;CAC/F,CAAC;AAEF,SAAS,oBAAoB,CAAC,IAAY;IACzC,OAAO,IAAI,CAAC;AACb,CAAC;AAED,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;IAC5C,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,2BAA2B,CAC1C,WAAW,EACX,oBAAoB,EACpB,QAAQ,EACR,EAAE,CACF,CAAC;QACF,MAAM,OAAO,GAAG,2BAA2B,CAC1C,WAAW,EACX,oBAAoB,EACpB,QAAQ,EACR,EAAE,CACF,CAAC;QACF,MAAM,CAAC,eAAe,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,OAAO,GAAG,2BAA2B,CAC1C,WAAW,EACX,oBAAoB,EACpB,QAAQ,EACR,EAAE,CACF,CAAC;QACF,MAAM,QAAQ,GAAG;YAChB,CAAC,EAAE;gBACF,CAAC,EAAE;oBACF,CAAC,EAAE;wBACF;4BACC,CAAC,EAAE,SAAS;yBACZ;wBACD,kBAAkB;qBAClB;oBACD,CAAC,EAAE,kBAAkB;iBACrB;gBACD,CAAC,EAAE,oBAAoB;aACvB;YACD,CAAC,EAAE,kBAAkB;SACrB,CAAC;QACF,MAAM,CAAC,eAAe,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3C,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 { strict as assert } from \"assert\";\nimport { ChangeRebaser, TaggedChange } from \"../../core/index.js\";\nimport { generateFuzzyCombinedChange } from \"./fuzz.js\";\n\nconst testSeed = 432167897;\n\ntype TestChange = TestChange[] | { I: TestChange } | { C: TestChange; O: TestChange } | number;\n\nconst testRebaser: ChangeRebaser<TestChange> = {\n\tcompose: (changes: TaggedChange<TestChange>[]) => changes.map((c) => c.change),\n\tinvert: (change: TaggedChange<TestChange>) => ({ I: change.change }),\n\trebase: (change: TestChange, over: TaggedChange<TestChange>) => ({ C: change, O: over.change }),\n};\n\nfunction generateRandomChange(seed: number) {\n\treturn seed;\n}\n\ndescribe(\"generateFuzzyCombinedChange\", () => {\n\tit(\"consistent given the same seed\", () => {\n\t\tconst change1 = generateFuzzyCombinedChange(\n\t\t\ttestRebaser,\n\t\t\tgenerateRandomChange,\n\t\t\ttestSeed,\n\t\t\t10,\n\t\t);\n\t\tconst change2 = generateFuzzyCombinedChange(\n\t\t\ttestRebaser,\n\t\t\tgenerateRandomChange,\n\t\t\ttestSeed,\n\t\t\t10,\n\t\t);\n\t\tassert.deepStrictEqual(change1, change2);\n\t});\n\n\tit(\"generates random combination of changes\", () => {\n\t\tconst change1 = generateFuzzyCombinedChange(\n\t\t\ttestRebaser,\n\t\t\tgenerateRandomChange,\n\t\t\ttestSeed,\n\t\t\t15,\n\t\t);\n\t\tconst expected = {\n\t\t\tC: {\n\t\t\t\tC: {\n\t\t\t\t\tC: [\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tI: 432167897,\n\t\t\t\t\t\t},\n\t\t\t\t\t\t0.9933325823949589,\n\t\t\t\t\t],\n\t\t\t\t\tO: 0.6981920829135596,\n\t\t\t\t},\n\t\t\t\tO: 0.013476674234232933,\n\t\t\t},\n\t\t\tO: 0.9375291806987182,\n\t\t};\n\t\tassert.deepStrictEqual(change1, expected);\n\t});\n});\n"]}

package/lib/test/rebase/rebaseBranch.spec.d.ts

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

package/lib/test/rebase/rebaseBranch.spec.d.ts.map

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

package/lib/test/rebase/rebaseBranch.spec.js

@@ -1,208 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert, fail } from "assert";
-import { validateAssertionError } from "@fluidframework/test-runtime-utils";
-// Allow importing from these specific files which are being tested:
-import { findAncestor, findCommonAncestor, rebaseBranch,
-/* eslint-disable-next-line import/no-internal-modules */
- } from "../../core/rebase/index.js";
-import { TestChange, TestChangeRebaser } from "../testChange.js";
-import { mintRevisionTag } from "../utils.js";
-function newCommit(intention, parent) {
-    const inputContext2 = [];
-    if (parent !== undefined) {
-        const path = [];
-        const ancestor = findAncestor([parent, path]);
-        inputContext2.push(...[ancestor, ...path].map((c) => {
-            assert(typeof c.revision === "number", "root revision should not be present on test commit");
-            return c.revision;
-        }));
-    }
-    return {
-        change: TestChange.mint(inputContext2, intention),
-        revision: intention,
-        parent,
-    };
-}
-describe("rebaseBranch", () => {
-    function assertChanges(commits, ...changes) {
-        for (const commit of commits) {
-            const change = changes.shift();
-            assert(change !== undefined, "Fewer changes than commits");
-            assert.deepEqual(commit.change, change);
-        }
-        assert(changes.length === 0, "Fewer commits than changes");
-    }
-    function assertOutputContext(change, ...expected) {
-        const outputContext = change?.outputContext ??
-            fail("Expected output context");
-        assert.deepEqual(outputContext, expected);
-    }
-    // These tests use the following notation to show the commit graph used in each scenario:
-    //
-    // 1 ─(2)─ 3
-    // └─ 4 ─ 5
-    //
-    // Commit "3" has a parent "2", which has a parent "1". Commit "5" has a parent "4" which has a parent "1".
-    // Commit "1" is the common ancestor of the branch with head commit "3" and the branch with head commit "5".
-    // Commit "2" is in parentheses and is the target commit of the rebase operation.
-    it("fails if branches are disjoint", () => {
-        // 1 ─ 2
-        // 3
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3);
-        assert.throws(() => rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3, n2), (e) => validateAssertionError(e, "branches must be related"));
-        assert.throws(() => rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n2, n3, n1), (e) => validateAssertionError(e, "target commit is not in target branch"));
-    });
-    it("does nothing if already rebased onto target", () => {
-        // 1
-        // └─ 2 ─ 3
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        // (1)
-        //  └─ 2 ─ 3
-        const { newSourceHead: n3_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3, n1);
-        assert.equal(n3_1, n3);
-        assert.equal(sourceChange, undefined);
-        assert.deepEqual(commits.deletedSourceCommits, []);
-        assert.deepEqual(commits.targetCommits, []);
-        assert.deepEqual(commits.sourceCommits, [n2, n3]);
-    });
-    it("can rebase a branch onto the head of another branch", () => {
-        // 1 ─ 2 ─ 3
-        // └─ 4 ─ 5
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n1);
-        const n5 = newCommit(5, n4);
-        // 1 ─ 2 ─(3)
-        //         └─ 4'─ 5'
-        const { newSourceHead: n5_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n3);
-        const newPath = getPath(n3, n5_1);
-        assertChanges(newPath, { inputContext: [1, 2, 3], intentions: [4], outputContext: [1, 2, 3, 4] }, { inputContext: [1, 2, 3, 4], intentions: [5], outputContext: [1, 2, 3, 4, 5] });
-        assertOutputContext(sourceChange, 1, 2, 3, 4, 5);
-        assert.deepEqual(commits.deletedSourceCommits, [n4, n5]);
-        assert.deepEqual(commits.targetCommits, [n2, n3]);
-        assert.deepEqual(commits.sourceCommits, newPath);
-    });
-    it("can rebase a branch onto the middle of another branch", () => {
-        // 1 ─ 2 ─ 3
-        // └─ 4 ─ 5
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n1);
-        const n5 = newCommit(5, n4);
-        // 1 ─(2)─ 3
-        //     └─ 4'─ 5'
-        const { newSourceHead: n5_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n2, n3);
-        const newPath = getPath(n2, n5_1);
-        assertChanges(newPath, { inputContext: [1, 2], intentions: [4], outputContext: [1, 2, 4] }, { inputContext: [1, 2, 4], intentions: [5], outputContext: [1, 2, 4, 5] });
-        assertOutputContext(sourceChange, 1, 2, 4, 5);
-        assert.deepEqual(commits.deletedSourceCommits, [n4, n5]);
-        assert.deepEqual(commits.targetCommits, [n2]);
-        assert.deepEqual(commits.sourceCommits, newPath);
-    });
-    it("skips and advances over commits with the same revision tag", () => {
-        // 1 ─ 2 ─ 3 ─ 4
-        // └─ 2'─ 3'─ 5
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n3);
-        const n2_1 = newCommit(2, n1);
-        const n3_1 = newCommit(3, n2_1);
-        const n5 = newCommit(5, n3_1);
-        // 1 ─(2)─ 3 ─ 4
-        //         └─ 5'
-        const { newSourceHead: n5_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n2, n4);
-        const newPath = getPath(n3, n5_1);
-        assertChanges(newPath, {
-            inputContext: [1, 2, 3],
-            intentions: [5],
-            outputContext: [1, 2, 3, 5],
-        });
-        assert.equal(sourceChange, undefined);
-        assert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1, n5]);
-        assert.deepEqual(commits.targetCommits, [n2, n3]);
-        assert.deepEqual(commits.sourceCommits, newPath);
-    });
-    it("correctly rebases over branches that share some commits", () => {
-        // 1 ─ 2 ─ 3 ─ 4
-        // └─ 2'─ 3'─ 5
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n3);
-        const n2_1 = newCommit(2, n1);
-        const n3_1 = newCommit(3, n2_1);
-        const n5 = newCommit(5, n3_1);
-        // 1 ─ 2 ─ 3 ─(4)
-        //             └─ 5'
-        const { newSourceHead: n5_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n4);
-        const newPath = getPath(n4, n5_1);
-        assertChanges(newPath, {
-            inputContext: [1, 2, 3, 4],
-            intentions: [5],
-            outputContext: [1, 2, 3, 4, 5],
-        });
-        assertOutputContext(sourceChange, 1, 2, 3, 4, 5);
-        assert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1, n5]);
-        assert.deepEqual(commits.targetCommits, [n2, n3, n4]);
-        assert.deepEqual(commits.sourceCommits, newPath);
-    });
-    it("rebases the source branch farther than `newBase` if the source branch's next commits after `newBase` match those on the target branch", () => {
-        // 1 ─ 2 ─ 3 ─ 4 ─ 5
-        // └─ 3' ─ 4' ─ 6
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n3);
-        const n5 = newCommit(5, n4);
-        const n3_1 = newCommit(3, n1);
-        const n4_1 = newCommit(4, n3_1);
-        const n6 = newCommit(6, n4_1);
-        // 1 ─(2)─ 3 ─ 4 ─ 5
-        //             └─ 6
-        const { newSourceHead: n6_1, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n6, n2, n5);
-        const newPath = getPath(n2, n6_1);
-        assertChanges(newPath, TestChange.mint([1, 2], 3), TestChange.mint([1, 2, 3], 4), TestChange.mint([1, 2, 3, 4], 6));
-        assertOutputContext(sourceChange, 1, 2, 3, 4, 6);
-        assert.deepEqual(commits.deletedSourceCommits, [n3_1, n4_1, n6]);
-        assert.deepEqual(commits.targetCommits, [n2, n3, n4]);
-        assert.deepEqual(commits.sourceCommits, [n6_1]);
-    });
-    it("reports no change for equivalent branches", () => {
-        // 1 ─ 2 ─ 3 ─ 4
-        // └─ 2'─ 3'
-        const n1 = newCommit(1);
-        const n2 = newCommit(2, n1);
-        const n3 = newCommit(3, n2);
-        const n4 = newCommit(4, n3);
-        const n2_1 = newCommit(2, n1);
-        const n3_1 = newCommit(3, n2_1);
-        // 1 ─ 2 ─(3)─ 4
-        //         └─
-        const { newSourceHead: n3_2, sourceChange, commits, } = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3_1, n3, n4);
-        assert.equal(n3_2, n3);
-        assert.equal(sourceChange, undefined);
-        assert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1]);
-        assert.deepEqual(commits.targetCommits, [n2, n3]);
-        assert.deepEqual(commits.sourceCommits, []);
-    });
-});
-/**
- * @returns the path from the base of a branch to its head
- */
-function getPath(fromAncestor, toHead) {
-    const path = [];
-    const ancestor = findCommonAncestor(fromAncestor, [toHead, path]);
-    assert.equal(ancestor, fromAncestor);
-    return path;
-}
-//# sourceMappingURL=rebaseBranch.spec.js.map

package/lib/test/rebase/rebaseBranch.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rebaseBranch.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/rebaseBranch.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,oEAAoE;AACpE,OAAO,EAGN,YAAY,EACZ,kBAAkB,EAClB,YAAY;AACZ,yDAAyD;EACzD,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAsB,UAAU,EAAE,iBAAiB,EAAE,MAAM,kBAAkB,CAAC;AACrF,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9C,SAAS,SAAS,CACjB,SAA4B,EAC5B,MAAgC;IAEhC,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,MAAM,IAAI,GAA8B,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9C,aAAa,CAAC,IAAI,CACjB,GAAG,CAAC,QAAQ,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAChC,MAAM,CACL,OAAO,CAAC,CAAC,QAAQ,KAAK,QAAQ,EAC9B,oDAAoD,CACpD,CAAC;YACF,OAAO,CAAC,CAAC,QAAQ,CAAC;QACnB,CAAC,CAAC,CACF,CAAC;KACF;IACD,OAAO;QACN,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,aAAa,EAAE,SAAS,CAAC;QACjD,QAAQ,EAAE,SAAwB;QAClC,MAAM;KACN,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,SAAS,aAAa,CACrB,OAA0C,EAC1C,GAAG,OAAqB;QAExB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE,4BAA4B,CAAC,CAAC;YAC3D,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;SACxC;QACD,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,4BAA4B,CAAC,CAAC;IAC5D,CAAC;IAED,SAAS,mBAAmB,CAAC,MAAmB,EAAE,GAAG,QAAkB;QACtE,MAAM,aAAa,GACjB,MAAyC,EAAE,aAAa;YACzD,IAAI,CAAC,yBAAyB,CAAC,CAAC;QAEjC,MAAM,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,yFAAyF;IACzF,EAAE;IACF,YAAY;IACZ,WAAW;IACX,EAAE;IACF,2GAA2G;IAC3G,4GAA4G;IAC5G,iFAAiF;IAEjF,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACzC,QAAQ;QACR,IAAI;QACJ,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAExB,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EACpE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,0BAA0B,CAAC,CACnE,CAAC;QAEF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EACxE,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,uCAAuC,CAAC,CAChF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,IAAI;QACJ,WAAW;QACX,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAE5B,MAAM;QACN,YAAY;QACZ,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC9D,YAAY;QACZ,WAAW;QACX,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAE5B,aAAa;QACb,oBAAoB;QACpB,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAClC,aAAa,CACZ,OAAO,EACP,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EACzE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAC/E,CAAC;QACF,mBAAmB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAChE,YAAY;QACZ,WAAW;QACX,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAE5B,YAAY;QACZ,gBAAgB;QAChB,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACvE,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAClC,aAAa,CACZ,OAAO,EACP,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EACnE,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CACzE,CAAC;QACF,mBAAmB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACrE,gBAAgB;QAChB,eAAe;QACf,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE9B,gBAAgB;QAChB,gBAAgB;QAChB,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACvE,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAClC,aAAa,CAAC,OAAO,EAAE;YACtB,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACvB,UAAU,EAAE,CAAC,CAAC,CAAC;YACf,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC3B,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,gBAAgB;QAChB,eAAe;QACf,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE9B,iBAAiB;QACjB,oBAAoB;QACpB,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACnE,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAClC,aAAa,CAAC,OAAO,EAAE;YACtB,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1B,UAAU,EAAE,CAAC,CAAC,CAAC;YACf,aAAa,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SAC9B,CAAC,CAAC;QACH,mBAAmB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uIAAuI,EAAE,GAAG,EAAE;QAChJ,oBAAoB;QACpB,iBAAiB;QACjB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAChC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAE9B,oBAAoB;QACpB,mBAAmB;QACnB,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACvE,MAAM,OAAO,GAAG,OAAO,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAClC,aAAa,CACZ,OAAO,EACP,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAC1B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAC7B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAChC,CAAC;QACF,mBAAmB,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,gBAAgB;QAChB,YAAY;QACZ,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAEhC,gBAAgB;QAChB,aAAa;QACb,MAAM,EACL,aAAa,EAAE,IAAI,EACnB,YAAY,EACZ,OAAO,GACP,GAAG,YAAY,CAAC,eAAe,EAAE,IAAI,iBAAiB,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACvB,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;QACtC,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,oBAAoB,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH;;GAEG;AACH,SAAS,OAAO,CACf,YAA8C,EAC9C,MAA4B;IAE5B,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,MAAM,QAAQ,GAAG,kBAAkB,CAAC,YAAY,EAAE,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert, fail } from \"assert\";\nimport { validateAssertionError } from \"@fluidframework/test-runtime-utils\";\n// Allow importing from these specific files which are being tested:\nimport {\n\tGraphCommit,\n\tRevisionTag,\n\tfindAncestor,\n\tfindCommonAncestor,\n\trebaseBranch,\n\t/* eslint-disable-next-line import/no-internal-modules */\n} from \"../../core/rebase/index.js\";\nimport { NonEmptyTestChange, TestChange, TestChangeRebaser } from \"../testChange.js\";\nimport { mintRevisionTag } from \"../utils.js\";\n\nfunction newCommit(\n\tintention: number | number[],\n\tparent?: GraphCommit<TestChange>,\n): GraphCommit<TestChange> {\n\tconst inputContext2: number[] = [];\n\tif (parent !== undefined) {\n\t\tconst path: GraphCommit<TestChange>[] = [];\n\t\tconst ancestor = findAncestor([parent, path]);\n\t\tinputContext2.push(\n\t\t\t...[ancestor, ...path].map((c) => {\n\t\t\t\tassert(\n\t\t\t\t\ttypeof c.revision === \"number\",\n\t\t\t\t\t\"root revision should not be present on test commit\",\n\t\t\t\t);\n\t\t\t\treturn c.revision;\n\t\t\t}),\n\t\t);\n\t}\n\treturn {\n\t\tchange: TestChange.mint(inputContext2, intention),\n\t\trevision: intention as RevisionTag,\n\t\tparent,\n\t};\n}\n\ndescribe(\"rebaseBranch\", () => {\n\tfunction assertChanges(\n\t\tcommits: Iterable<GraphCommit<TestChange>>,\n\t\t...changes: TestChange[]\n\t): void {\n\t\tfor (const commit of commits) {\n\t\t\tconst change = changes.shift();\n\t\t\tassert(change !== undefined, \"Fewer changes than commits\");\n\t\t\tassert.deepEqual(commit.change, change);\n\t\t}\n\t\tassert(changes.length === 0, \"Fewer commits than changes\");\n\t}\n\n\tfunction assertOutputContext(change?: TestChange, ...expected: number[]): void {\n\t\tconst outputContext =\n\t\t\t(change as NonEmptyTestChange | undefined)?.outputContext ??\n\t\t\tfail(\"Expected output context\");\n\n\t\tassert.deepEqual(outputContext, expected);\n\t}\n\n\t// These tests use the following notation to show the commit graph used in each scenario:\n\t//\n\t// 1 ─(2)─ 3\n\t// └─ 4 ─ 5\n\t//\n\t// Commit \"3\" has a parent \"2\", which has a parent \"1\". Commit \"5\" has a parent \"4\" which has a parent \"1\".\n\t// Commit \"1\" is the common ancestor of the branch with head commit \"3\" and the branch with head commit \"5\".\n\t// Commit \"2\" is in parentheses and is the target commit of the rebase operation.\n\n\tit(\"fails if branches are disjoint\", () => {\n\t\t// 1 ─ 2\n\t\t// 3\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3);\n\n\t\tassert.throws(\n\t\t\t() => rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3, n2),\n\t\t\t(e: Error) => validateAssertionError(e, \"branches must be related\"),\n\t\t);\n\n\t\tassert.throws(\n\t\t\t() => rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n2, n3, n1),\n\t\t\t(e: Error) => validateAssertionError(e, \"target commit is not in target branch\"),\n\t\t);\n\t});\n\n\tit(\"does nothing if already rebased onto target\", () => {\n\t\t// 1\n\t\t// └─ 2 ─ 3\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\n\t\t// (1)\n\t\t//  └─ 2 ─ 3\n\t\tconst {\n\t\t\tnewSourceHead: n3_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3, n1);\n\t\tassert.equal(n3_1, n3);\n\t\tassert.equal(sourceChange, undefined);\n\t\tassert.deepEqual(commits.deletedSourceCommits, []);\n\t\tassert.deepEqual(commits.targetCommits, []);\n\t\tassert.deepEqual(commits.sourceCommits, [n2, n3]);\n\t});\n\n\tit(\"can rebase a branch onto the head of another branch\", () => {\n\t\t// 1 ─ 2 ─ 3\n\t\t// └─ 4 ─ 5\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n1);\n\t\tconst n5 = newCommit(5, n4);\n\n\t\t// 1 ─ 2 ─(3)\n\t\t//         └─ 4'─ 5'\n\t\tconst {\n\t\t\tnewSourceHead: n5_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n3);\n\t\tconst newPath = getPath(n3, n5_1);\n\t\tassertChanges(\n\t\t\tnewPath,\n\t\t\t{ inputContext: [1, 2, 3], intentions: [4], outputContext: [1, 2, 3, 4] },\n\t\t\t{ inputContext: [1, 2, 3, 4], intentions: [5], outputContext: [1, 2, 3, 4, 5] },\n\t\t);\n\t\tassertOutputContext(sourceChange, 1, 2, 3, 4, 5);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n4, n5]);\n\t\tassert.deepEqual(commits.targetCommits, [n2, n3]);\n\t\tassert.deepEqual(commits.sourceCommits, newPath);\n\t});\n\n\tit(\"can rebase a branch onto the middle of another branch\", () => {\n\t\t// 1 ─ 2 ─ 3\n\t\t// └─ 4 ─ 5\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n1);\n\t\tconst n5 = newCommit(5, n4);\n\n\t\t// 1 ─(2)─ 3\n\t\t//     └─ 4'─ 5'\n\t\tconst {\n\t\t\tnewSourceHead: n5_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n2, n3);\n\t\tconst newPath = getPath(n2, n5_1);\n\t\tassertChanges(\n\t\t\tnewPath,\n\t\t\t{ inputContext: [1, 2], intentions: [4], outputContext: [1, 2, 4] },\n\t\t\t{ inputContext: [1, 2, 4], intentions: [5], outputContext: [1, 2, 4, 5] },\n\t\t);\n\t\tassertOutputContext(sourceChange, 1, 2, 4, 5);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n4, n5]);\n\t\tassert.deepEqual(commits.targetCommits, [n2]);\n\t\tassert.deepEqual(commits.sourceCommits, newPath);\n\t});\n\n\tit(\"skips and advances over commits with the same revision tag\", () => {\n\t\t// 1 ─ 2 ─ 3 ─ 4\n\t\t// └─ 2'─ 3'─ 5\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n3);\n\t\tconst n2_1 = newCommit(2, n1);\n\t\tconst n3_1 = newCommit(3, n2_1);\n\t\tconst n5 = newCommit(5, n3_1);\n\n\t\t// 1 ─(2)─ 3 ─ 4\n\t\t//         └─ 5'\n\t\tconst {\n\t\t\tnewSourceHead: n5_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n2, n4);\n\t\tconst newPath = getPath(n3, n5_1);\n\t\tassertChanges(newPath, {\n\t\t\tinputContext: [1, 2, 3],\n\t\t\tintentions: [5],\n\t\t\toutputContext: [1, 2, 3, 5],\n\t\t});\n\t\tassert.equal(sourceChange, undefined);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1, n5]);\n\t\tassert.deepEqual(commits.targetCommits, [n2, n3]);\n\t\tassert.deepEqual(commits.sourceCommits, newPath);\n\t});\n\n\tit(\"correctly rebases over branches that share some commits\", () => {\n\t\t// 1 ─ 2 ─ 3 ─ 4\n\t\t// └─ 2'─ 3'─ 5\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n3);\n\t\tconst n2_1 = newCommit(2, n1);\n\t\tconst n3_1 = newCommit(3, n2_1);\n\t\tconst n5 = newCommit(5, n3_1);\n\n\t\t// 1 ─ 2 ─ 3 ─(4)\n\t\t//             └─ 5'\n\t\tconst {\n\t\t\tnewSourceHead: n5_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n5, n4);\n\t\tconst newPath = getPath(n4, n5_1);\n\t\tassertChanges(newPath, {\n\t\t\tinputContext: [1, 2, 3, 4],\n\t\t\tintentions: [5],\n\t\t\toutputContext: [1, 2, 3, 4, 5],\n\t\t});\n\t\tassertOutputContext(sourceChange, 1, 2, 3, 4, 5);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1, n5]);\n\t\tassert.deepEqual(commits.targetCommits, [n2, n3, n4]);\n\t\tassert.deepEqual(commits.sourceCommits, newPath);\n\t});\n\n\tit(\"rebases the source branch farther than `newBase` if the source branch's next commits after `newBase` match those on the target branch\", () => {\n\t\t// 1 ─ 2 ─ 3 ─ 4 ─ 5\n\t\t// └─ 3' ─ 4' ─ 6\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n3);\n\t\tconst n5 = newCommit(5, n4);\n\t\tconst n3_1 = newCommit(3, n1);\n\t\tconst n4_1 = newCommit(4, n3_1);\n\t\tconst n6 = newCommit(6, n4_1);\n\n\t\t// 1 ─(2)─ 3 ─ 4 ─ 5\n\t\t//             └─ 6\n\t\tconst {\n\t\t\tnewSourceHead: n6_1,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n6, n2, n5);\n\t\tconst newPath = getPath(n2, n6_1);\n\t\tassertChanges(\n\t\t\tnewPath,\n\t\t\tTestChange.mint([1, 2], 3),\n\t\t\tTestChange.mint([1, 2, 3], 4),\n\t\t\tTestChange.mint([1, 2, 3, 4], 6),\n\t\t);\n\t\tassertOutputContext(sourceChange, 1, 2, 3, 4, 6);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n3_1, n4_1, n6]);\n\t\tassert.deepEqual(commits.targetCommits, [n2, n3, n4]);\n\t\tassert.deepEqual(commits.sourceCommits, [n6_1]);\n\t});\n\n\tit(\"reports no change for equivalent branches\", () => {\n\t\t// 1 ─ 2 ─ 3 ─ 4\n\t\t// └─ 2'─ 3'\n\t\tconst n1 = newCommit(1);\n\t\tconst n2 = newCommit(2, n1);\n\t\tconst n3 = newCommit(3, n2);\n\t\tconst n4 = newCommit(4, n3);\n\t\tconst n2_1 = newCommit(2, n1);\n\t\tconst n3_1 = newCommit(3, n2_1);\n\n\t\t// 1 ─ 2 ─(3)─ 4\n\t\t//         └─\n\t\tconst {\n\t\t\tnewSourceHead: n3_2,\n\t\t\tsourceChange,\n\t\t\tcommits,\n\t\t} = rebaseBranch(mintRevisionTag, new TestChangeRebaser(), n3_1, n3, n4);\n\t\tassert.equal(n3_2, n3);\n\t\tassert.equal(sourceChange, undefined);\n\t\tassert.deepEqual(commits.deletedSourceCommits, [n2_1, n3_1]);\n\t\tassert.deepEqual(commits.targetCommits, [n2, n3]);\n\t\tassert.deepEqual(commits.sourceCommits, []);\n\t});\n});\n\n/**\n * @returns the path from the base of a branch to its head\n */\nfunction getPath<TChange>(\n\tfromAncestor: GraphCommit<TChange> | undefined,\n\ttoHead: GraphCommit<TChange>,\n): GraphCommit<TChange>[] {\n\tconst path: GraphCommit<TChange>[] = [];\n\tconst ancestor = findCommonAncestor(fromAncestor, [toHead, path]);\n\tassert.equal(ancestor, fromAncestor);\n\treturn path;\n}\n"]}

package/lib/test/rebase/rebaser.spec.d.ts

@@ -1,14 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ChangeRebaser } from "../../core/index.js";
-declare const dummyChange: {};
-/** A change rebaser which does nothing at all and always returns the same object */
-export declare class DummyChangeRebaser implements ChangeRebaser<typeof dummyChange> {
-    compose(): typeof dummyChange;
-    invert(): typeof dummyChange;
-    rebase(): typeof dummyChange;
-}
-export {};
-//# sourceMappingURL=rebaser.spec.d.ts.map

package/lib/test/rebase/rebaser.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"rebaser.spec.d.ts","sourceRoot":"","sources":["../../../src/test/rebase/rebaser.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,aAAa,EAAe,MAAM,qBAAqB,CAAC;AAkBjE,QAAA,MAAM,WAAW,IAAK,CAAC;AAGvB,oFAAoF;AACpF,qBAAa,kBAAmB,YAAW,aAAa,CAAC,OAAO,WAAW,CAAC;IACpE,OAAO,IAAI,OAAO,WAAW;IAI7B,MAAM,IAAI,OAAO,WAAW;IAI5B,MAAM,IAAI,OAAO,WAAW;CAGnC"}

package/lib/test/rebase/rebaser.spec.js

@@ -1,166 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-// Allow importing from these specific files which are being tested:
-/* eslint-disable-next-line import/no-internal-modules */
-import { rebaseBranch } from "../../core/rebase/index.js";
-import { fail } from "../../util/index.js";
-import { mintRevisionTag } from "../utils.js";
-/** Given a number in the range [0, 15], turn it into a deterministic and human-rememberable v4 UUID */
-function makeRevisionTag(tag) {
-    if (tag > 15) {
-        fail("Tags bigger than 15 are not supported");
-    }
-    return tag;
-}
-const dummyChange = {};
-/** A change rebaser which does nothing at all and always returns the same object */
-export class DummyChangeRebaser {
-    compose() {
-        return {};
-    }
-    invert() {
-        return {};
-    }
-    rebase() {
-        return {};
-    }
-}
-describe("rebaser", () => {
-    /**
-     * This suite of tests ensures that the `Rebaser` class properly structures its output branches.
-     * It does not test the rebasing of the changes within the branches, only that the edges in the
-     * commit graph are accurate.
-     */
-    describe("correctly parents", () => {
-        /**
-         * This is a utility class for the tests below which makes it easy to create branches
-         * and keep track of the generated commits, as well as assert the parentage of a given
-         * commit.
-         */
-        class BranchTester {
-            constructor(main, branch) {
-                let cur;
-                for (const revision of main) {
-                    cur = {
-                        revision: makeRevisionTag(revision),
-                        change: {},
-                        parent: cur,
-                    };
-                    this[revision] = cur;
-                }
-                this.main = cur ?? fail("Expected main to have at least one commit");
-                const [baseInMain] = branch;
-                cur = this[baseInMain] ?? fail("branch base must be in main");
-                for (const revision of branch.slice(1)) {
-                    cur = {
-                        revision: makeRevisionTag(revision),
-                        change: {},
-                        parent: cur,
-                    };
-                }
-                this.branch = cur ?? fail("Expected branch to have at least one commit");
-            }
-            assertParentage(head, ...revisions) {
-                const branch = [];
-                for (let cur = head; cur !== undefined; cur = cur.parent) {
-                    branch.unshift(cur.revision);
-                }
-                assert.deepEqual(branch, revisions.map(makeRevisionTag));
-            }
-        }
-        function formatBranch(branch) {
-            let s = "";
-            for (const b of branch) {
-                s = `${s}─(${b})`;
-            }
-            return s.slice(1);
-        }
-        /**
-         * Test a branch properly rebases over another branch. All parameters are numbers which represent the tag of each commit.
-         * @param main - the primary branch
-         * @param branch - the branch that branches off of `main`
-         * @param expected - what `branch` is expected to look like after being rebased over `main`
-         * @param baseInMain - the commit in `main` to rebase up to. Defaults to the last commit in `main`
-         */
-        function itRebase(main, branch, expected, baseInMain) {
-            const title = `${formatBranch(main)} ⇘ ${formatBranch(branch)}${baseInMain !== undefined ? `  (base: ${baseInMain})` : ""}`;
-            it(title, () => {
-                const tester = new BranchTester(main, branch);
-                const base = baseInMain !== undefined
-                    ? tester[baseInMain] ?? fail("Expected baseInMain to be in main")
-                    : tester.main;
-                const { newSourceHead } = rebaseBranch(mintRevisionTag, new DummyChangeRebaser(), tester.branch, base, tester.main);
-                // The `expected` parameter starts at the base of the branch. Prepend the rest of the main
-                // branch to it so that it can be fully compared against the `BranchTester`'s `main`.
-                const expectedBaseIndex = main.indexOf(expected[0]);
-                assert.notEqual(expectedBaseIndex, -1, "Expected expected base to be in main");
-                const mainBeforeExpected = main.slice(0, expectedBaseIndex);
-                tester.assertParentage(newSourceHead, ...[...mainBeforeExpected, ...expected]);
-            });
-        }
-        // 0
-        itRebase([0], [0], [0]);
-        // 0 ─ 1
-        itRebase([0, 1], [0], [1]);
-        // 0
-        // └─ 1
-        itRebase([0], [0, 1], [0, 1]);
-        // 0 ─ 1
-        // └─ 2 ─ 3
-        itRebase([0, 1], [0, 2, 3], [1, 2, 3]);
-        // 0 ─ 1 ─ 2
-        // └─ 3
-        itRebase([0, 1, 2], [0, 3], [2, 3]);
-        // 0 ─ 1 ─ 2
-        //     └─ 3
-        itRebase([0, 1, 2], [1, 3], [2, 3]);
-        // With base set:
-        // (0)─ 1
-        //  └─ 2 ─ 3
-        itRebase([0, 1], [0, 2, 3], [0, 2, 3], 0);
-        // 0 ─(1)─ 2
-        // └─ 3
-        itRebase([0, 1, 2], [0, 3], [1, 3], 1);
-        // 0 ─(1)─ 2
-        //      └─ 3
-        itRebase([0, 1, 2], [1, 3], [1, 3], 1);
-        // With shared ids:
-        // 0 ─ 1
-        // └─ 1
-        itRebase([0, 1], [0, 1], [1]);
-        // 0 ─ 1 ─ 2
-        // └─ 1 ─ 3
-        itRebase([0, 1, 2], [0, 1, 3], [2, 3]);
-        // 0 ─ 1 ─ 2
-        //     └─ 2
-        itRebase([0, 1, 2], [1, 2], [2]);
-        // Base set and shared ids:
-        // 0 ─(1)─ 2
-        itRebase([0, 1, 2], [0], [1], 1);
-        // (0)─ 1
-        //  └─ 1
-        itRebase([0, 1], [0, 1], [1], 0);
-        // (0)─ 1 ─ 2
-        //  └─ 1 ─ 3
-        itRebase([0, 1, 2], [0, 1, 3], [1, 3], 0);
-        // 0 ─(1)─ 2
-        // └─ 1 ─ 3
-        itRebase([0, 1, 2], [0, 1, 3], [1, 3], 1);
-        // 0)─ 1 ─ 2
-        //     └─ 2
-        itRebase([0, 1, 2], [0, 1, 2], [2], 0);
-        // 0 ─(1)─ 2
-        //     └─ 2
-        itRebase([0, 1, 2], [1, 2], [2], 1);
-        // 0 ─ 1 ─(2)─ 3 ─ 4 ─ 5
-        //     └─ 2 ─ 4 ─ 5
-        itRebase([0, 1, 2, 3, 4, 5], [1, 2, 4, 5], [2, 4, 5], 2);
-        // 0 ─ 1 ─ 2 ─(3)─ 4 ─ 5
-        //     └─ 2 ─ 4 ─ 5
-        itRebase([0, 1, 2, 3, 4, 5], [1, 2, 4, 5], [5], 3);
-    });
-});
-//# sourceMappingURL=rebaser.spec.js.map

package/lib/test/rebase/rebaser.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rebaser.spec.js","sourceRoot":"","sources":["../../../src/test/rebase/rebaser.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAG1C,oEAAoE;AACpE,yDAAyD;AACzD,OAAO,EAAe,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAEvE,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAC3C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9C,uGAAuG;AACvG,SAAS,eAAe,CAAC,GAAW;IACnC,IAAI,GAAG,GAAG,EAAE,EAAE;QACb,IAAI,CAAC,uCAAuC,CAAC,CAAC;KAC9C;IAED,OAAO,GAAkB,CAAC;AAC3B,CAAC;AAED,MAAM,WAAW,GAAG,EAAE,CAAC;AAGvB,oFAAoF;AACpF,MAAM,OAAO,kBAAkB;IACvB,OAAO;QACb,OAAO,EAAE,CAAC;IACX,CAAC;IAEM,MAAM;QACZ,OAAO,EAAE,CAAC;IACX,CAAC;IAEM,MAAM;QACZ,OAAO,EAAE,CAAC;IACX,CAAC;CACD;AAED,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACxB;;;;OAIG;IACH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC;;;;WAIG;QACH,MAAM,YAAY;YAMjB,YACC,IAA2B,EAC3B,MAAiD;gBAEjD,IAAI,GAA4B,CAAC;gBACjC,KAAK,MAAM,QAAQ,IAAI,IAAI,EAAE;oBAC5B,GAAG,GAAG;wBACL,QAAQ,EAAE,eAAe,CAAC,QAAQ,CAAC;wBACnC,MAAM,EAAE,EAAE;wBACV,MAAM,EAAE,GAAG;qBACX,CAAC;oBACF,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC;iBACrB;gBACD,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,2CAA2C,CAAC,CAAC;gBACrE,MAAM,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC;gBAC5B,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,6BAA6B,CAAC,CAAC;gBAC9D,KAAK,MAAM,QAAQ,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;oBACvC,GAAG,GAAG;wBACL,QAAQ,EAAE,eAAe,CAAC,QAAQ,CAAC;wBACnC,MAAM,EAAE,EAAE;wBACV,MAAM,EAAE,GAAG;qBACX,CAAC;iBACF;gBAED,IAAI,CAAC,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,6CAA6C,CAAC,CAAC;YAC1E,CAAC;YAEM,eAAe,CAAC,IAAiB,EAAE,GAAG,SAAmB;gBAC/D,MAAM,MAAM,GAAkB,EAAE,CAAC;gBACjC,KAAK,IAAI,GAAG,GAA4B,IAAI,EAAE,GAAG,KAAK,SAAS,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE;oBAClF,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;iBAC7B;gBAED,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC;YAC1D,CAAC;SACD;QAED,SAAS,YAAY,CAAI,MAAmB;YAC3C,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;gBACvB,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;aAClB;YAED,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QAED;;;;;;WAMG;QACH,SAAS,QAAQ,CAChB,IAA2B,EAC3B,MAAiD,EACjD,QAAmD,EACnD,UAAmB;YAEnB,MAAM,KAAK,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,YAAY,CAAC,MAAM,CAAC,GAC5D,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,YAAY,UAAU,GAAG,CAAC,CAAC,CAAC,EACxD,EAAE,CAAC;YAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;gBACd,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;gBAC9C,MAAM,IAAI,GACT,UAAU,KAAK,SAAS;oBACvB,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,mCAAmC,CAAC;oBACjE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;gBAEhB,MAAM,EAAE,aAAa,EAAE,GAAG,YAAY,CACrC,eAAe,EACf,IAAI,kBAAkB,EAAE,EACxB,MAAM,CAAC,MAAM,EACb,IAAI,EACJ,MAAM,CAAC,IAAI,CACX,CAAC;gBACF,0FAA0F;gBAC1F,qFAAqF;gBACrF,MAAM,iBAAiB,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACpD,MAAM,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,CAAC,EAAE,sCAAsC,CAAC,CAAC;gBAC/E,MAAM,kBAAkB,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;gBAC5D,MAAM,CAAC,eAAe,CAAC,aAAa,EAAE,GAAG,CAAC,GAAG,kBAAkB,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC;YAChF,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,IAAI;QACJ,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAExB,QAAQ;QACR,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3B,IAAI;QACJ,OAAO;QACP,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAE9B,QAAQ;QACR,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEvC,YAAY;QACZ,OAAO;QACP,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEpC,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEpC,iBAAiB;QAEjB,SAAS;QACT,YAAY;QACZ,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1C,YAAY;QACZ,OAAO;QACP,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvC,YAAY;QACZ,YAAY;QACZ,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvC,mBAAmB;QAEnB,QAAQ;QACR,OAAO;QACP,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE9B,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEvC,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAEjC,2BAA2B;QAE3B,YAAY;QACZ,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjC,SAAS;QACT,QAAQ;QACR,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEjC,aAAa;QACb,YAAY;QACZ,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1C,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1C,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEvC,YAAY;QACZ,WAAW;QACX,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEpC,wBAAwB;QACxB,mBAAmB;QACnB,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzD,wBAAwB;QACxB,mBAAmB;QACnB,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,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 { strict as assert } from \"assert\";\nimport { ChangeRebaser, RevisionTag } from \"../../core/index.js\";\n\n// Allow importing from these specific files which are being tested:\n/* eslint-disable-next-line import/no-internal-modules */\nimport { GraphCommit, rebaseBranch } from \"../../core/rebase/index.js\";\n\nimport { fail } from \"../../util/index.js\";\nimport { mintRevisionTag } from \"../utils.js\";\n\n/** Given a number in the range [0, 15], turn it into a deterministic and human-rememberable v4 UUID */\nfunction makeRevisionTag(tag: number): RevisionTag {\n\tif (tag > 15) {\n\t\tfail(\"Tags bigger than 15 are not supported\");\n\t}\n\n\treturn tag as RevisionTag;\n}\n\nconst dummyChange = {};\ntype DummyCommit = GraphCommit<typeof dummyChange>;\n\n/** A change rebaser which does nothing at all and always returns the same object */\nexport class DummyChangeRebaser implements ChangeRebaser<typeof dummyChange> {\n\tpublic compose(): typeof dummyChange {\n\t\treturn {};\n\t}\n\n\tpublic invert(): typeof dummyChange {\n\t\treturn {};\n\t}\n\n\tpublic rebase(): typeof dummyChange {\n\t\treturn {};\n\t}\n}\n\ndescribe(\"rebaser\", () => {\n\t/**\n\t * This suite of tests ensures that the `Rebaser` class properly structures its output branches.\n\t * It does not test the rebasing of the changes within the branches, only that the edges in the\n\t * commit graph are accurate.\n\t */\n\tdescribe(\"correctly parents\", () => {\n\t\t/**\n\t\t * This is a utility class for the tests below which makes it easy to create branches\n\t\t * and keep track of the generated commits, as well as assert the parentage of a given\n\t\t * commit.\n\t\t */\n\t\tclass BranchTester {\n\t\t\t[tag: number]: DummyCommit | undefined;\n\n\t\t\tpublic readonly main: DummyCommit;\n\t\t\tpublic readonly branch: DummyCommit;\n\n\t\t\tpublic constructor(\n\t\t\t\tmain: [number, ...number[]],\n\t\t\t\tbranch: [baseInMain: number, ...branch: number[]],\n\t\t\t) {\n\t\t\t\tlet cur: DummyCommit | undefined;\n\t\t\t\tfor (const revision of main) {\n\t\t\t\t\tcur = {\n\t\t\t\t\t\trevision: makeRevisionTag(revision),\n\t\t\t\t\t\tchange: {},\n\t\t\t\t\t\tparent: cur,\n\t\t\t\t\t};\n\t\t\t\t\tthis[revision] = cur;\n\t\t\t\t}\n\t\t\t\tthis.main = cur ?? fail(\"Expected main to have at least one commit\");\n\t\t\t\tconst [baseInMain] = branch;\n\t\t\t\tcur = this[baseInMain] ?? fail(\"branch base must be in main\");\n\t\t\t\tfor (const revision of branch.slice(1)) {\n\t\t\t\t\tcur = {\n\t\t\t\t\t\trevision: makeRevisionTag(revision),\n\t\t\t\t\t\tchange: {},\n\t\t\t\t\t\tparent: cur,\n\t\t\t\t\t};\n\t\t\t\t}\n\n\t\t\t\tthis.branch = cur ?? fail(\"Expected branch to have at least one commit\");\n\t\t\t}\n\n\t\t\tpublic assertParentage(head: DummyCommit, ...revisions: number[]): void {\n\t\t\t\tconst branch: RevisionTag[] = [];\n\t\t\t\tfor (let cur: DummyCommit | undefined = head; cur !== undefined; cur = cur.parent) {\n\t\t\t\t\tbranch.unshift(cur.revision);\n\t\t\t\t}\n\n\t\t\t\tassert.deepEqual(branch, revisions.map(makeRevisionTag));\n\t\t\t}\n\t\t}\n\n\t\tfunction formatBranch<T>(branch: Iterable<T>): string {\n\t\t\tlet s = \"\";\n\t\t\tfor (const b of branch) {\n\t\t\t\ts = `${s}─(${b})`;\n\t\t\t}\n\n\t\t\treturn s.slice(1);\n\t\t}\n\n\t\t/**\n\t\t * Test a branch properly rebases over another branch. All parameters are numbers which represent the tag of each commit.\n\t\t * @param main - the primary branch\n\t\t * @param branch - the branch that branches off of `main`\n\t\t * @param expected - what `branch` is expected to look like after being rebased over `main`\n\t\t * @param baseInMain - the commit in `main` to rebase up to. Defaults to the last commit in `main`\n\t\t */\n\t\tfunction itRebase(\n\t\t\tmain: [number, ...number[]],\n\t\t\tbranch: [baseInMain: number, ...branch: number[]],\n\t\t\texpected: [baseInMain: number, ...branch: number[]],\n\t\t\tbaseInMain?: number,\n\t\t): void {\n\t\t\tconst title = `${formatBranch(main)} ⇘ ${formatBranch(branch)}${\n\t\t\t\tbaseInMain !== undefined ? `  (base: ${baseInMain})` : \"\"\n\t\t\t}`;\n\n\t\t\tit(title, () => {\n\t\t\t\tconst tester = new BranchTester(main, branch);\n\t\t\t\tconst base =\n\t\t\t\t\tbaseInMain !== undefined\n\t\t\t\t\t\t? tester[baseInMain] ?? fail(\"Expected baseInMain to be in main\")\n\t\t\t\t\t\t: tester.main;\n\n\t\t\t\tconst { newSourceHead } = rebaseBranch(\n\t\t\t\t\tmintRevisionTag,\n\t\t\t\t\tnew DummyChangeRebaser(),\n\t\t\t\t\ttester.branch,\n\t\t\t\t\tbase,\n\t\t\t\t\ttester.main,\n\t\t\t\t);\n\t\t\t\t// The `expected` parameter starts at the base of the branch. Prepend the rest of the main\n\t\t\t\t// branch to it so that it can be fully compared against the `BranchTester`'s `main`.\n\t\t\t\tconst expectedBaseIndex = main.indexOf(expected[0]);\n\t\t\t\tassert.notEqual(expectedBaseIndex, -1, \"Expected expected base to be in main\");\n\t\t\t\tconst mainBeforeExpected = main.slice(0, expectedBaseIndex);\n\t\t\t\ttester.assertParentage(newSourceHead, ...[...mainBeforeExpected, ...expected]);\n\t\t\t});\n\t\t}\n\n\t\t// 0\n\t\titRebase([0], [0], [0]);\n\n\t\t// 0 ─ 1\n\t\titRebase([0, 1], [0], [1]);\n\n\t\t// 0\n\t\t// └─ 1\n\t\titRebase([0], [0, 1], [0, 1]);\n\n\t\t// 0 ─ 1\n\t\t// └─ 2 ─ 3\n\t\titRebase([0, 1], [0, 2, 3], [1, 2, 3]);\n\n\t\t// 0 ─ 1 ─ 2\n\t\t// └─ 3\n\t\titRebase([0, 1, 2], [0, 3], [2, 3]);\n\n\t\t// 0 ─ 1 ─ 2\n\t\t//     └─ 3\n\t\titRebase([0, 1, 2], [1, 3], [2, 3]);\n\n\t\t// With base set:\n\n\t\t// (0)─ 1\n\t\t//  └─ 2 ─ 3\n\t\titRebase([0, 1], [0, 2, 3], [0, 2, 3], 0);\n\n\t\t// 0 ─(1)─ 2\n\t\t// └─ 3\n\t\titRebase([0, 1, 2], [0, 3], [1, 3], 1);\n\n\t\t// 0 ─(1)─ 2\n\t\t//      └─ 3\n\t\titRebase([0, 1, 2], [1, 3], [1, 3], 1);\n\n\t\t// With shared ids:\n\n\t\t// 0 ─ 1\n\t\t// └─ 1\n\t\titRebase([0, 1], [0, 1], [1]);\n\n\t\t// 0 ─ 1 ─ 2\n\t\t// └─ 1 ─ 3\n\t\titRebase([0, 1, 2], [0, 1, 3], [2, 3]);\n\n\t\t// 0 ─ 1 ─ 2\n\t\t//     └─ 2\n\t\titRebase([0, 1, 2], [1, 2], [2]);\n\n\t\t// Base set and shared ids:\n\n\t\t// 0 ─(1)─ 2\n\t\titRebase([0, 1, 2], [0], [1], 1);\n\n\t\t// (0)─ 1\n\t\t//  └─ 1\n\t\titRebase([0, 1], [0, 1], [1], 0);\n\n\t\t// (0)─ 1 ─ 2\n\t\t//  └─ 1 ─ 3\n\t\titRebase([0, 1, 2], [0, 1, 3], [1, 3], 0);\n\n\t\t// 0 ─(1)─ 2\n\t\t// └─ 1 ─ 3\n\t\titRebase([0, 1, 2], [0, 1, 3], [1, 3], 1);\n\n\t\t// 0)─ 1 ─ 2\n\t\t//     └─ 2\n\t\titRebase([0, 1, 2], [0, 1, 2], [2], 0);\n\n\t\t// 0 ─(1)─ 2\n\t\t//     └─ 2\n\t\titRebase([0, 1, 2], [1, 2], [2], 1);\n\n\t\t// 0 ─ 1 ─(2)─ 3 ─ 4 ─ 5\n\t\t//     └─ 2 ─ 4 ─ 5\n\t\titRebase([0, 1, 2, 3, 4, 5], [1, 2, 4, 5], [2, 4, 5], 2);\n\n\t\t// 0 ─ 1 ─ 2 ─(3)─ 4 ─ 5\n\t\t//     └─ 2 ─ 4 ─ 5\n\t\titRebase([0, 1, 2, 3, 4, 5], [1, 2, 4, 5], [5], 3);\n\t});\n});\n"]}

package/lib/test/rebase/revisionTagCodec.spec.d.ts

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

package/lib/test/rebase/revisionTagCodec.spec.d.ts.map

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