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

package/lib/test/shared-tree-core/edit-manager/editManagerTestUtils.d.ts

@@ -1,211 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SessionId } from "@fluidframework/id-compressor";
-import { ChangeFamily, ChangeRebaser, ChangeFamilyEditor, DeltaRoot } from "../../../core/index.js";
-import { TestChangeFamily, TestChange } from "../../testChange.js";
-import { EditManager } from "../../../shared-tree-core/index.js";
-import { RecursiveReadonly } from "../../../util/index.js";
-export type TestEditManager = EditManager<ChangeFamilyEditor, TestChange, TestChangeFamily>;
-export declare function testChangeEditManagerFactory(options: {
-    rebaser?: ChangeRebaser<TestChange>;
-    sessionId?: SessionId;
-    autoDiscardRevertibles?: boolean;
-}): {
-    manager: TestEditManager;
-    family: ChangeFamily<ChangeFamilyEditor, TestChange>;
-};
-export declare function editManagerFactory<TChange = TestChange>(family: ChangeFamily<any, TChange>, options?: {
-    sessionId?: SessionId;
-    autoDiscardRevertibles?: boolean;
-}): EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>;
-/**
- * Simulates the following inputs to the EditManager:
- * - Apply local edit L1 with a ref seq# pointing to edit 0
- * ...(not incrementing the ref seq# for each L)
- * - Apply local edit Lc with a ref seq# pointing to edit 0
- * -- we start measuring from here
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc)
- *   └───────────────(L1)─...─(Lc)
- * ```
- *
- * @param localEditCount - The number of local edits to generate
- * @param trunkEditCount - The number of trunk edits to generate
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- */
-export declare function rebaseLocalEditsOverTrunkEdits<TChange>(localEditCount: number, trunkEditCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange): void;
-/**
- * Simulates the following inputs to the EditManager:
- * - Apply local edit L1 with a ref seq# pointing to edit 0
- * ...(not incrementing the ref seq# for each L)
- * - Apply local edit Lc with a ref seq# pointing to edit 0
- * -- inputs below this point are deferred until the returned thunk is invoked --
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc)
- *   └───────────────(L1)─...─(Lc)
- * ```
- *
- * @param localEditCount - The number of local edits to generate
- * @param trunkEditCount - The number of trunk edits to generate
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- * @param defer - Used to invoke this specific overload.
- * @returns A thunk that will apply the local edits when invoked.
- */
-export declare function rebaseLocalEditsOverTrunkEdits<TChange>(localEditCount: number, trunkEditCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange, defer: true): () => void;
-/**
- * Simulates the following inputs to the EditManager:
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- * - Sequence peer edit P1 with a ref seq# pointing to edit 0
- * ...(not incrementing the ref seq# for each P)
- * - Sequence peer edit Pc with a ref seq# pointing to edit 0
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc)
- *   └───────────────(P1)─...─(Pc)
- * ```
- *
- * @param peerEditCount - The number of peer edits to generate
- * @param trunkEditCount - The number of trunk edits to generate
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- */
-export declare function rebasePeerEditsOverTrunkEdits<TChange>(peerEditCount: number, trunkEditCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange): void;
-/**
- * Simulates the following inputs to the EditManager:
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- * -- inputs below this point are deferred until the returned thunk is invoked --
- * - Sequence peer edit P1 with a ref seq# pointing to edit 0
- * ...(not incrementing the ref seq# for each P)
- * - Sequence peer edit Pc with a ref seq# pointing to edit 0
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc)
- *   └───────────────(P1)─...─(Pc)
- * ```
- *
- * @param peerEditCount - The number of peer edits to generate
- * @param trunkEditCount - The number of trunk edits to generate
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- * @param defer - Used to invoke this specific overload.
- * @returns A thunk that will apply the peer edits when invoked.
- */
-export declare function rebasePeerEditsOverTrunkEdits<TChange>(peerEditCount: number, trunkEditCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange, defer: true): () => void;
-/**
- * Simulates the following inputs to the EditManager:
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- * - Sequence peer edit P1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each P)
- * - Sequence peer edit Pc with a ref seq# pointing to edit Tc-1
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc─1)─(Tc)
- *   |    |          └──────(P1)─(P2)─...─(Pc)
- *   |    └─────────────────(P1)─(P2)
- *   └──────────────────────(P1)
- * ```
- *
- * @param editCount - The number of peer and trunk edits to generate.
- * The total number of edits generated will be twice that.
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- */
-export declare function rebaseAdvancingPeerEditsOverTrunkEdits<TChange>(editCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange): void;
-/**
- * Simulates the following inputs to the EditManager:
- * - Sequence trunk edit T1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each T)
- * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1
- * -- inputs below this point are deferred until the returned thunk is invoked --
- * - Sequence peer edit P1 with a ref seq# pointing to edit 0
- * ...(incrementing the ref seq# for each P)
- * - Sequence peer edit Pc with a ref seq# pointing to edit Tc-1
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)─(T1)─...─(Tc─1)─(Tc)
- *   |    |          └──────(P1)─(P2)─...─(Pc)
- *   |    └─────────────────(P1)─(P2)
- *   └──────────────────────(P1)
- * ```
- *
- * @param editCount - The number of peer and trunk edits to generate.
- * The total number of edits generated will be twice that.
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- * @param defer - Used to invoke this specific overload.
- * @returns A thunk that will apply the peer edits when invoked.
- */
-export declare function rebaseAdvancingPeerEditsOverTrunkEdits<TChange>(editCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange, defer: true): () => void;
-/**
- * Simulates the following inputs to the EditManager:
- * Each peer edit is sequenced in a round-robin fashion starting with the first edit from peer 1 then
- * the first edit from peer 2, etc. Then the second edit from each peer (in the same peer order) etc.
- * All edit have a reference sequence number of 0.
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)
- *   ├─(P1E1)───────────────(P1E2)──────...──────(P1Ek)
- *   ├────────(P2E1)───────────────(P2E2)──────...──────(P2Ek)
- *   ├...
- *   └───────────────(PnE1)───────────────(PnE2)──────...──────(PnEk)
- * ```
- *
- * @param peerCount - The number of peer to generate edits for.
- * @param editCount - The number of edits to generate per peer.
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- */
-export declare function rebaseConcurrentPeerEdits<TChange>(peerCount: number, editsPerPeerCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange, defer: true): () => void;
-/**
- * Simulates the following inputs to the EditManager:
- * Each peer edit is sequenced in a round-robin fashion starting with the first edit from peer 1 then
- * the first edit from peer 2, etc. Then the second edit from each peer (in the same peer order) etc.
- * All edit have a reference sequence number of 0.
- *
- * This defines the following relationships between edits:
- * ```text
- * (0)
- *   ├─(P1E1)───────────────(P1E2)──────...──────(P1Ek)
- *   ├────────(P2E1)───────────────(P2E2)──────...──────(P2Ek)
- *   ├...
- *   └───────────────(PnE1)───────────────(PnE2)──────...──────(PnEk)
- * ```
- *
- * @param peerCount - The number of peer to generate edits for.
- * @param editCount - The number of edits to generate per peer.
- * @param manager - The edit manager to apply the edits to
- * @param mintChange - A function used to generate new changes
- * @param defer - Used to invoke this specific overload.
- * @returns A thunk that will apply the peer edits when invoked.
- */
-export declare function rebaseConcurrentPeerEdits<TChange>(peerCount: number, editsPerPeerCount: number, manager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>, mintChange: () => TChange): void;
-export declare function checkChangeList(manager: TestEditManager, intentions: number[]): void;
-export declare function getAllChanges(manager: TestEditManager): RecursiveReadonly<TestChange>[];
-/** Adds a sequenced change to an `EditManager` and returns the delta that was caused by the change */
-export declare function addSequencedChange(editManager: TestEditManager, ...args: Parameters<(typeof editManager)["addSequencedChange"]>): DeltaRoot;
-//# sourceMappingURL=editManagerTestUtils.d.ts.map

package/lib/test/shared-tree-core/edit-manager/editManagerTestUtils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerTestUtils.d.ts","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerTestUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,+BAA+B,CAAC;AAC1D,OAAO,EACN,YAAY,EACZ,aAAa,EACb,kBAAkB,EAClB,SAAS,EAET,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACN,gBAAgB,EAChB,UAAU,EAGV,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAU,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAoB,MAAM,wBAAwB,CAAC;AAE7E,MAAM,MAAM,eAAe,GAAG,WAAW,CAAC,kBAAkB,EAAE,UAAU,EAAE,gBAAgB,CAAC,CAAC;AAE5F,wBAAgB,4BAA4B,CAAC,OAAO,EAAE;IACrD,OAAO,CAAC,EAAE,aAAa,CAAC,UAAU,CAAC,CAAC;IACpC,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,sBAAsB,CAAC,EAAE,OAAO,CAAC;CACjC,GAAG;IACH,OAAO,EAAE,eAAe,CAAC;IACzB,MAAM,EAAE,YAAY,CAAC,kBAAkB,EAAE,UAAU,CAAC,CAAC;CACrD,CAQA;AAED,wBAAgB,kBAAkB,CAAC,OAAO,GAAG,UAAU,EACtD,MAAM,EAAE,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,EAClC,OAAO,GAAE;IACR,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB,sBAAsB,CAAC,EAAE,OAAO,CAAC;CAC5B,GACJ,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,CAgBrF;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,8BAA8B,CAAC,OAAO,EACrD,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,GACvB,IAAI,CAAC;AACR;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,8BAA8B,CAAC,OAAO,EACrD,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,EACzB,KAAK,EAAE,IAAI,GACT,MAAM,IAAI,CAAC;AA0Bd;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,EACpD,aAAa,EAAE,MAAM,EACrB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,GACvB,IAAI,CAAC;AACR;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,6BAA6B,CAAC,OAAO,EACpD,aAAa,EAAE,MAAM,EACrB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,EACzB,KAAK,EAAE,IAAI,GACT,MAAM,IAAI,CAAC;AAsCd;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,sCAAsC,CAAC,OAAO,EAC7D,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,GACvB,IAAI,CAAC;AACR;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,sCAAsC,CAAC,OAAO,EAC7D,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,EACzB,KAAK,EAAE,IAAI,GACT,MAAM,IAAI,CAAC;AAqCd;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAChD,SAAS,EAAE,MAAM,EACjB,iBAAiB,EAAE,MAAM,EACzB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,EACzB,KAAK,EAAE,IAAI,GACT,MAAM,IAAI,CAAC;AACd;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAChD,SAAS,EAAE,MAAM,EACjB,iBAAiB,EAAE,MAAM,EACzB,OAAO,EAAE,WAAW,CAAC,kBAAkB,EAAE,OAAO,EAAE,YAAY,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,EAC5F,UAAU,EAAE,MAAM,OAAO,GACvB,IAAI,CAAC;AA4BR,wBAAgB,eAAe,CAAC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI,CAEpF;AAED,wBAAgB,aAAa,CAAC,OAAO,EAAE,eAAe,GAAG,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAEvF;AAED,sGAAsG;AACtG,wBAAgB,kBAAkB,CACjC,WAAW,EAAE,eAAe,EAC5B,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,OAAO,WAAW,CAAC,CAAC,oBAAoB,CAAC,CAAC,GAC7D,SAAS,CAUX"}

package/lib/test/shared-tree-core/edit-manager/editManagerTestUtils.js

@@ -1,130 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { emptyDelta, } from "../../../core/index.js";
-import { TestChange, testChangeFamilyFactory, asDelta, } from "../../testChange.js";
-import { EditManager } from "../../../shared-tree-core/index.js";
-import { brand, makeArray } from "../../../util/index.js";
-import { mintRevisionTag, testIdCompressor } from "../../utils.js";
-export function testChangeEditManagerFactory(options) {
-    const family = testChangeFamilyFactory(options.rebaser);
-    const manager = editManagerFactory(family, {
-        sessionId: options.sessionId,
-        autoDiscardRevertibles: options.autoDiscardRevertibles,
-    });
-    return { manager, family };
-}
-export function editManagerFactory(family, options = {}) {
-    const autoDiscardRevertibles = options.autoDiscardRevertibles ?? true;
-    const genId = () => testIdCompressor.generateCompressedId();
-    const manager = new EditManager(family, options.sessionId ?? "0", genId);
-    if (autoDiscardRevertibles === true) {
-        // by default, discard revertibles in the edit manager tests
-        manager.localBranch.on("newRevertible", (revertible) => {
-            revertible.discard();
-        });
-    }
-    return manager;
-}
-export function rebaseLocalEditsOverTrunkEdits(localEditCount, trunkEditCount, manager, mintChange, defer = false) {
-    // Subscribe to the local branch to emulate the behavior of SharedTree
-    manager.localBranch.on("afterChange", ({ change }) => { });
-    for (let iChange = 0; iChange < localEditCount; iChange++) {
-        manager.localBranch.apply(mintChange(), mintRevisionTag());
-    }
-    const trunkEdits = makeArray(trunkEditCount, () => ({
-        change: mintChange(),
-        revision: mintRevisionTag(),
-        sessionId: "trunk",
-    }));
-    const run = () => {
-        for (let iChange = 0; iChange < trunkEditCount; iChange++) {
-            manager.addSequencedChange(trunkEdits[iChange], brand(iChange + 1), brand(iChange));
-        }
-    };
-    return defer ? run : run();
-}
-export function rebasePeerEditsOverTrunkEdits(peerEditCount, trunkEditCount, manager, mintChange, defer = false) {
-    // Subscribe to the local branch to emulate the behavior of SharedTree
-    manager.localBranch.on("afterChange", ({ change }) => { });
-    for (let iChange = 0; iChange < trunkEditCount; iChange++) {
-        manager.addSequencedChange({
-            change: mintChange(),
-            revision: mintRevisionTag(),
-            sessionId: "trunk",
-        }, brand(iChange + 1), brand(iChange));
-    }
-    const peerEdits = makeArray(peerEditCount, () => ({
-        change: mintChange(),
-        revision: mintRevisionTag(),
-        sessionId: "peer",
-    }));
-    const run = () => {
-        for (let iChange = 0; iChange < peerEditCount; iChange++) {
-            manager.addSequencedChange(peerEdits[iChange], brand(iChange + trunkEditCount + 1), brand(0));
-        }
-    };
-    return defer ? run : run();
-}
-export function rebaseAdvancingPeerEditsOverTrunkEdits(editCount, manager, mintChange, defer = false) {
-    // Subscribe to the local branch to emulate the behavior of SharedTree
-    manager.localBranch.on("afterChange", ({ change }) => { });
-    for (let iChange = 0; iChange < editCount; iChange++) {
-        manager.addSequencedChange({
-            change: mintChange(),
-            revision: mintRevisionTag(),
-            sessionId: "trunk",
-        }, brand(iChange + 1), brand(iChange));
-    }
-    const peerEdits = makeArray(editCount, () => ({
-        change: mintChange(),
-        revision: mintRevisionTag(),
-        sessionId: "peer",
-    }));
-    const run = () => {
-        for (let iChange = 0; iChange < editCount; iChange++) {
-            manager.addSequencedChange(peerEdits[iChange], brand(iChange + editCount + 1), brand(iChange));
-        }
-    };
-    return defer ? run : run();
-}
-export function rebaseConcurrentPeerEdits(peerCount, editsPerPeerCount, manager, mintChange, defer = false) {
-    // Subscribe to the local branch to emulate the behavior of SharedTree
-    manager.localBranch.on("afterChange", ({ change }) => { });
-    const peerEdits = [];
-    for (let iChange = 0; iChange < editsPerPeerCount; iChange++) {
-        for (let iPeer = 0; iPeer < peerCount; iPeer++) {
-            peerEdits.push({
-                change: mintChange(),
-                revision: mintRevisionTag(),
-                sessionId: `p${iPeer}`,
-            });
-        }
-    }
-    const run = () => {
-        for (let iChange = 0; iChange < peerEdits.length; iChange++) {
-            manager.addSequencedChange(peerEdits[iChange], brand(iChange + 1), brand(0));
-        }
-    };
-    return defer ? run : run();
-}
-export function checkChangeList(manager, intentions) {
-    TestChange.checkChangeList(getAllChanges(manager), intentions);
-}
-export function getAllChanges(manager) {
-    return manager.getTrunkChanges().concat(manager.getLocalChanges());
-}
-/** Adds a sequenced change to an `EditManager` and returns the delta that was caused by the change */
-export function addSequencedChange(editManager, ...args) {
-    let delta = emptyDelta;
-    const offChange = editManager.localBranch.on("afterChange", ({ change }) => {
-        if (change !== undefined) {
-            delta = asDelta(change.change.intentions);
-        }
-    });
-    editManager.addSequencedChange(...args);
-    offChange();
-    return delta;
-}
-//# sourceMappingURL=editManagerTestUtils.js.map

package/lib/test/shared-tree-core/edit-manager/editManagerTestUtils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"editManagerTestUtils.js","sourceRoot":"","sources":["../../../../src/test/shared-tree-core/edit-manager/editManagerTestUtils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAKN,UAAU,GACV,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAEN,UAAU,EACV,uBAAuB,EACvB,OAAO,GACP,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAU,WAAW,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,EAAqB,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAC7E,OAAO,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAGnE,MAAM,UAAU,4BAA4B,CAAC,OAI5C;IAIA,MAAM,MAAM,GAAG,uBAAuB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,kBAAkB,CAAC,MAAM,EAAE;QAC1C,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,sBAAsB,EAAE,OAAO,CAAC,sBAAsB;KACtD,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,kBAAkB,CACjC,MAAkC,EAClC,UAGI,EAAE;IAEN,MAAM,sBAAsB,GAAG,OAAO,CAAC,sBAAsB,IAAI,IAAI,CAAC;IACtE,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,gBAAgB,CAAC,oBAAoB,EAAE,CAAC;IAC5D,MAAM,OAAO,GAAG,IAAI,WAAW,CAI7B,MAAM,EAAE,OAAO,CAAC,SAAS,IAAK,GAAiB,EAAE,KAAK,CAAC,CAAC;IAE1D,IAAI,sBAAsB,KAAK,IAAI,EAAE;QACpC,4DAA4D;QAC5D,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,eAAe,EAAE,CAAC,UAAU,EAAE,EAAE;YACtD,UAAU,CAAC,OAAO,EAAE,CAAC;QACtB,CAAC,CAAC,CAAC;KACH;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AA2DD,MAAM,UAAU,8BAA8B,CAC7C,cAAsB,EACtB,cAAsB,EACtB,OAA4F,EAC5F,UAAyB,EACzB,QAAiB,KAAK;IAEtB,sEAAsE;IACtE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,cAAc,EAAE,OAAO,EAAE,EAAE;QAC1D,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,eAAe,EAAE,CAAC,CAAC;KAC3D;IACD,MAAM,UAAU,GAAG,SAAS,CAAC,cAAc,EAAE,GAAG,EAAE,CAAC,CAAC;QACnD,MAAM,EAAE,UAAU,EAAE;QACpB,QAAQ,EAAE,eAAe,EAAE;QAC3B,SAAS,EAAE,OAAoB;KAC/B,CAAC,CAAC,CAAC;IACJ,MAAM,GAAG,GAAG,GAAG,EAAE;QAChB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,cAAc,EAAE,OAAO,EAAE,EAAE;YAC1D,OAAO,CAAC,kBAAkB,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;SACpF;IACF,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAC5B,CAAC;AA0DD,MAAM,UAAU,6BAA6B,CAC5C,aAAqB,EACrB,cAAsB,EACtB,OAA4F,EAC5F,UAAyB,EACzB,QAAiB,KAAK;IAEtB,sEAAsE;IACtE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,cAAc,EAAE,OAAO,EAAE,EAAE;QAC1D,OAAO,CAAC,kBAAkB,CACzB;YACC,MAAM,EAAE,UAAU,EAAE;YACpB,QAAQ,EAAE,eAAe,EAAE;YAC3B,SAAS,EAAE,OAAoB;SAC/B,EACD,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAClB,KAAK,CAAC,OAAO,CAAC,CACd,CAAC;KACF;IACD,MAAM,SAAS,GAAG,SAAS,CAAC,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,UAAU,EAAE;QACpB,QAAQ,EAAE,eAAe,EAAE;QAC3B,SAAS,EAAE,MAAmB;KAC9B,CAAC,CAAC,CAAC;IACJ,MAAM,GAAG,GAAG,GAAG,EAAE;QAChB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,aAAa,EAAE,OAAO,EAAE,EAAE;YACzD,OAAO,CAAC,kBAAkB,CACzB,SAAS,CAAC,OAAO,CAAC,EAClB,KAAK,CAAC,OAAO,GAAG,cAAc,GAAG,CAAC,CAAC,EACnC,KAAK,CAAC,CAAC,CAAC,CACR,CAAC;SACF;IACF,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAC5B,CAAC;AA4DD,MAAM,UAAU,sCAAsC,CACrD,SAAiB,EACjB,OAA4F,EAC5F,UAAyB,EACzB,QAAiB,KAAK;IAEtB,sEAAsE;IACtE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,CAAC;IAC1D,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,SAAS,EAAE,OAAO,EAAE,EAAE;QACrD,OAAO,CAAC,kBAAkB,CACzB;YACC,MAAM,EAAE,UAAU,EAAE;YACpB,QAAQ,EAAE,eAAe,EAAE;YAC3B,SAAS,EAAE,OAAoB;SAC/B,EACD,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAClB,KAAK,CAAC,OAAO,CAAC,CACd,CAAC;KACF;IACD,MAAM,SAAS,GAAG,SAAS,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,EAAE,UAAU,EAAE;QACpB,QAAQ,EAAE,eAAe,EAAE;QAC3B,SAAS,EAAE,MAAmB;KAC9B,CAAC,CAAC,CAAC;IACJ,MAAM,GAAG,GAAG,GAAG,EAAE;QAChB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,SAAS,EAAE,OAAO,EAAE,EAAE;YACrD,OAAO,CAAC,kBAAkB,CACzB,SAAS,CAAC,OAAO,CAAC,EAClB,KAAK,CAAC,OAAO,GAAG,SAAS,GAAG,CAAC,CAAC,EAC9B,KAAK,CAAC,OAAO,CAAC,CACd,CAAC;SACF;IACF,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAC5B,CAAC;AAyDD,MAAM,UAAU,yBAAyB,CACxC,SAAiB,EACjB,iBAAyB,EACzB,OAA4F,EAC5F,UAAyB,EACzB,QAAiB,KAAK;IAEtB,sEAAsE;IACtE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,GAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAsB,EAAE,CAAC;IACxC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,iBAAiB,EAAE,OAAO,EAAE,EAAE;QAC7D,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,EAAE,EAAE;YAC/C,SAAS,CAAC,IAAI,CAAC;gBACd,MAAM,EAAE,UAAU,EAAE;gBACpB,QAAQ,EAAE,eAAe,EAAE;gBAC3B,SAAS,EAAE,IAAI,KAAK,EAAe;aACnC,CAAC,CAAC;SACH;KACD;IACD,MAAM,GAAG,GAAG,GAAG,EAAE;QAChB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE;YAC5D,OAAO,CAAC,kBAAkB,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7E;IACF,CAAC,CAAC;IACF,OAAO,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,OAAwB,EAAE,UAAoB;IAC7E,UAAU,CAAC,eAAe,CAAC,aAAa,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC;AAChE,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,OAAwB;IACrD,OAAO,OAAO,CAAC,eAAe,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;AACpE,CAAC;AAED,sGAAsG;AACtG,MAAM,UAAU,kBAAkB,CACjC,WAA4B,EAC5B,GAAG,IAA4D;IAE/D,IAAI,KAAK,GAAc,UAAU,CAAC;IAClC,MAAM,SAAS,GAAG,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE;QAC1E,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;SAC1C;IACF,CAAC,CAAC,CAAC;IACH,WAAW,CAAC,kBAAkB,CAAC,GAAG,IAAI,CAAC,CAAC;IACxC,SAAS,EAAE,CAAC;IACZ,OAAO,KAAK,CAAC;AACd,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { SessionId } from \"@fluidframework/id-compressor\";\nimport {\n\tChangeFamily,\n\tChangeRebaser,\n\tChangeFamilyEditor,\n\tDeltaRoot,\n\temptyDelta,\n} from \"../../../core/index.js\";\nimport {\n\tTestChangeFamily,\n\tTestChange,\n\ttestChangeFamilyFactory,\n\tasDelta,\n} from \"../../testChange.js\";\nimport { Commit, EditManager } from \"../../../shared-tree-core/index.js\";\nimport { RecursiveReadonly, brand, makeArray } from \"../../../util/index.js\";\nimport { mintRevisionTag, testIdCompressor } from \"../../utils.js\";\nexport type TestEditManager = EditManager<ChangeFamilyEditor, TestChange, TestChangeFamily>;\n\nexport function testChangeEditManagerFactory(options: {\n\trebaser?: ChangeRebaser<TestChange>;\n\tsessionId?: SessionId;\n\tautoDiscardRevertibles?: boolean;\n}): {\n\tmanager: TestEditManager;\n\tfamily: ChangeFamily<ChangeFamilyEditor, TestChange>;\n} {\n\tconst family = testChangeFamilyFactory(options.rebaser);\n\tconst manager = editManagerFactory(family, {\n\t\tsessionId: options.sessionId,\n\t\tautoDiscardRevertibles: options.autoDiscardRevertibles,\n\t});\n\n\treturn { manager, family };\n}\n\nexport function editManagerFactory<TChange = TestChange>(\n\tfamily: ChangeFamily<any, TChange>,\n\toptions: {\n\t\tsessionId?: SessionId;\n\t\tautoDiscardRevertibles?: boolean;\n\t} = {},\n): EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>> {\n\tconst autoDiscardRevertibles = options.autoDiscardRevertibles ?? true;\n\tconst genId = () => testIdCompressor.generateCompressedId();\n\tconst manager = new EditManager<\n\t\tChangeFamilyEditor,\n\t\tTChange,\n\t\tChangeFamily<ChangeFamilyEditor, TChange>\n\t>(family, options.sessionId ?? (\"0\" as SessionId), genId);\n\n\tif (autoDiscardRevertibles === true) {\n\t\t// by default, discard revertibles in the edit manager tests\n\t\tmanager.localBranch.on(\"newRevertible\", (revertible) => {\n\t\t\trevertible.discard();\n\t\t});\n\t}\n\treturn manager;\n}\n\n/**\n * Simulates the following inputs to the EditManager:\n * - Apply local edit L1 with a ref seq# pointing to edit 0\n * ...(not incrementing the ref seq# for each L)\n * - Apply local edit Lc with a ref seq# pointing to edit 0\n * -- we start measuring from here\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc)\n *   └───────────────(L1)─...─(Lc)\n * ```\n *\n * @param localEditCount - The number of local edits to generate\n * @param trunkEditCount - The number of trunk edits to generate\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n */\nexport function rebaseLocalEditsOverTrunkEdits<TChange>(\n\tlocalEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n): void;\n/**\n * Simulates the following inputs to the EditManager:\n * - Apply local edit L1 with a ref seq# pointing to edit 0\n * ...(not incrementing the ref seq# for each L)\n * - Apply local edit Lc with a ref seq# pointing to edit 0\n * -- inputs below this point are deferred until the returned thunk is invoked --\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc)\n *   └───────────────(L1)─...─(Lc)\n * ```\n *\n * @param localEditCount - The number of local edits to generate\n * @param trunkEditCount - The number of trunk edits to generate\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n * @param defer - Used to invoke this specific overload.\n * @returns A thunk that will apply the local edits when invoked.\n */\nexport function rebaseLocalEditsOverTrunkEdits<TChange>(\n\tlocalEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: true,\n): () => void;\nexport function rebaseLocalEditsOverTrunkEdits<TChange>(\n\tlocalEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: boolean = false,\n): void | (() => void) {\n\t// Subscribe to the local branch to emulate the behavior of SharedTree\n\tmanager.localBranch.on(\"afterChange\", ({ change }) => {});\n\tfor (let iChange = 0; iChange < localEditCount; iChange++) {\n\t\tmanager.localBranch.apply(mintChange(), mintRevisionTag());\n\t}\n\tconst trunkEdits = makeArray(trunkEditCount, () => ({\n\t\tchange: mintChange(),\n\t\trevision: mintRevisionTag(),\n\t\tsessionId: \"trunk\" as SessionId,\n\t}));\n\tconst run = () => {\n\t\tfor (let iChange = 0; iChange < trunkEditCount; iChange++) {\n\t\t\tmanager.addSequencedChange(trunkEdits[iChange], brand(iChange + 1), brand(iChange));\n\t\t}\n\t};\n\treturn defer ? run : run();\n}\n\n/**\n * Simulates the following inputs to the EditManager:\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n * - Sequence peer edit P1 with a ref seq# pointing to edit 0\n * ...(not incrementing the ref seq# for each P)\n * - Sequence peer edit Pc with a ref seq# pointing to edit 0\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc)\n *   └───────────────(P1)─...─(Pc)\n * ```\n *\n * @param peerEditCount - The number of peer edits to generate\n * @param trunkEditCount - The number of trunk edits to generate\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n */\nexport function rebasePeerEditsOverTrunkEdits<TChange>(\n\tpeerEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n): void;\n/**\n * Simulates the following inputs to the EditManager:\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n * -- inputs below this point are deferred until the returned thunk is invoked --\n * - Sequence peer edit P1 with a ref seq# pointing to edit 0\n * ...(not incrementing the ref seq# for each P)\n * - Sequence peer edit Pc with a ref seq# pointing to edit 0\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc)\n *   └───────────────(P1)─...─(Pc)\n * ```\n *\n * @param peerEditCount - The number of peer edits to generate\n * @param trunkEditCount - The number of trunk edits to generate\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n * @param defer - Used to invoke this specific overload.\n * @returns A thunk that will apply the peer edits when invoked.\n */\nexport function rebasePeerEditsOverTrunkEdits<TChange>(\n\tpeerEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: true,\n): () => void;\nexport function rebasePeerEditsOverTrunkEdits<TChange>(\n\tpeerEditCount: number,\n\ttrunkEditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: boolean = false,\n): void | (() => void) {\n\t// Subscribe to the local branch to emulate the behavior of SharedTree\n\tmanager.localBranch.on(\"afterChange\", ({ change }) => {});\n\tfor (let iChange = 0; iChange < trunkEditCount; iChange++) {\n\t\tmanager.addSequencedChange(\n\t\t\t{\n\t\t\t\tchange: mintChange(),\n\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\tsessionId: \"trunk\" as SessionId,\n\t\t\t},\n\t\t\tbrand(iChange + 1),\n\t\t\tbrand(iChange),\n\t\t);\n\t}\n\tconst peerEdits = makeArray(peerEditCount, () => ({\n\t\tchange: mintChange(),\n\t\trevision: mintRevisionTag(),\n\t\tsessionId: \"peer\" as SessionId,\n\t}));\n\tconst run = () => {\n\t\tfor (let iChange = 0; iChange < peerEditCount; iChange++) {\n\t\t\tmanager.addSequencedChange(\n\t\t\t\tpeerEdits[iChange],\n\t\t\t\tbrand(iChange + trunkEditCount + 1),\n\t\t\t\tbrand(0),\n\t\t\t);\n\t\t}\n\t};\n\treturn defer ? run : run();\n}\n\n/**\n * Simulates the following inputs to the EditManager:\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n * - Sequence peer edit P1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each P)\n * - Sequence peer edit Pc with a ref seq# pointing to edit Tc-1\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc─1)─(Tc)\n *   |    |          └──────(P1)─(P2)─...─(Pc)\n *   |    └─────────────────(P1)─(P2)\n *   └──────────────────────(P1)\n * ```\n *\n * @param editCount - The number of peer and trunk edits to generate.\n * The total number of edits generated will be twice that.\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n */\nexport function rebaseAdvancingPeerEditsOverTrunkEdits<TChange>(\n\teditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n): void;\n/**\n * Simulates the following inputs to the EditManager:\n * - Sequence trunk edit T1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each T)\n * - Sequence trunk edit Tc with a ref seq# pointing to edit Tc-1\n * -- inputs below this point are deferred until the returned thunk is invoked --\n * - Sequence peer edit P1 with a ref seq# pointing to edit 0\n * ...(incrementing the ref seq# for each P)\n * - Sequence peer edit Pc with a ref seq# pointing to edit Tc-1\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)─(T1)─...─(Tc─1)─(Tc)\n *   |    |          └──────(P1)─(P2)─...─(Pc)\n *   |    └─────────────────(P1)─(P2)\n *   └──────────────────────(P1)\n * ```\n *\n * @param editCount - The number of peer and trunk edits to generate.\n * The total number of edits generated will be twice that.\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n * @param defer - Used to invoke this specific overload.\n * @returns A thunk that will apply the peer edits when invoked.\n */\nexport function rebaseAdvancingPeerEditsOverTrunkEdits<TChange>(\n\teditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: true,\n): () => void;\nexport function rebaseAdvancingPeerEditsOverTrunkEdits<TChange>(\n\teditCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: boolean = false,\n): void | (() => void) {\n\t// Subscribe to the local branch to emulate the behavior of SharedTree\n\tmanager.localBranch.on(\"afterChange\", ({ change }) => {});\n\tfor (let iChange = 0; iChange < editCount; iChange++) {\n\t\tmanager.addSequencedChange(\n\t\t\t{\n\t\t\t\tchange: mintChange(),\n\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\tsessionId: \"trunk\" as SessionId,\n\t\t\t},\n\t\t\tbrand(iChange + 1),\n\t\t\tbrand(iChange),\n\t\t);\n\t}\n\tconst peerEdits = makeArray(editCount, () => ({\n\t\tchange: mintChange(),\n\t\trevision: mintRevisionTag(),\n\t\tsessionId: \"peer\" as SessionId,\n\t}));\n\tconst run = () => {\n\t\tfor (let iChange = 0; iChange < editCount; iChange++) {\n\t\t\tmanager.addSequencedChange(\n\t\t\t\tpeerEdits[iChange],\n\t\t\t\tbrand(iChange + editCount + 1),\n\t\t\t\tbrand(iChange),\n\t\t\t);\n\t\t}\n\t};\n\treturn defer ? run : run();\n}\n\n/**\n * Simulates the following inputs to the EditManager:\n * Each peer edit is sequenced in a round-robin fashion starting with the first edit from peer 1 then\n * the first edit from peer 2, etc. Then the second edit from each peer (in the same peer order) etc.\n * All edit have a reference sequence number of 0.\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)\n *   ├─(P1E1)───────────────(P1E2)──────...──────(P1Ek)\n *   ├────────(P2E1)───────────────(P2E2)──────...──────(P2Ek)\n *   ├...\n *   └───────────────(PnE1)───────────────(PnE2)──────...──────(PnEk)\n * ```\n *\n * @param peerCount - The number of peer to generate edits for.\n * @param editCount - The number of edits to generate per peer.\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n */\nexport function rebaseConcurrentPeerEdits<TChange>(\n\tpeerCount: number,\n\teditsPerPeerCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: true,\n): () => void;\n/**\n * Simulates the following inputs to the EditManager:\n * Each peer edit is sequenced in a round-robin fashion starting with the first edit from peer 1 then\n * the first edit from peer 2, etc. Then the second edit from each peer (in the same peer order) etc.\n * All edit have a reference sequence number of 0.\n *\n * This defines the following relationships between edits:\n * ```text\n * (0)\n *   ├─(P1E1)───────────────(P1E2)──────...──────(P1Ek)\n *   ├────────(P2E1)───────────────(P2E2)──────...──────(P2Ek)\n *   ├...\n *   └───────────────(PnE1)───────────────(PnE2)──────...──────(PnEk)\n * ```\n *\n * @param peerCount - The number of peer to generate edits for.\n * @param editCount - The number of edits to generate per peer.\n * @param manager - The edit manager to apply the edits to\n * @param mintChange - A function used to generate new changes\n * @param defer - Used to invoke this specific overload.\n * @returns A thunk that will apply the peer edits when invoked.\n */\nexport function rebaseConcurrentPeerEdits<TChange>(\n\tpeerCount: number,\n\teditsPerPeerCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n): void;\nexport function rebaseConcurrentPeerEdits<TChange>(\n\tpeerCount: number,\n\teditsPerPeerCount: number,\n\tmanager: EditManager<ChangeFamilyEditor, TChange, ChangeFamily<ChangeFamilyEditor, TChange>>,\n\tmintChange: () => TChange,\n\tdefer: boolean = false,\n): void | (() => void) {\n\t// Subscribe to the local branch to emulate the behavior of SharedTree\n\tmanager.localBranch.on(\"afterChange\", ({ change }) => {});\n\tconst peerEdits: Commit<TChange>[] = [];\n\tfor (let iChange = 0; iChange < editsPerPeerCount; iChange++) {\n\t\tfor (let iPeer = 0; iPeer < peerCount; iPeer++) {\n\t\t\tpeerEdits.push({\n\t\t\t\tchange: mintChange(),\n\t\t\t\trevision: mintRevisionTag(),\n\t\t\t\tsessionId: `p${iPeer}` as SessionId,\n\t\t\t});\n\t\t}\n\t}\n\tconst run = () => {\n\t\tfor (let iChange = 0; iChange < peerEdits.length; iChange++) {\n\t\t\tmanager.addSequencedChange(peerEdits[iChange], brand(iChange + 1), brand(0));\n\t\t}\n\t};\n\treturn defer ? run : run();\n}\n\nexport function checkChangeList(manager: TestEditManager, intentions: number[]): void {\n\tTestChange.checkChangeList(getAllChanges(manager), intentions);\n}\n\nexport function getAllChanges(manager: TestEditManager): RecursiveReadonly<TestChange>[] {\n\treturn manager.getTrunkChanges().concat(manager.getLocalChanges());\n}\n\n/** Adds a sequenced change to an `EditManager` and returns the delta that was caused by the change */\nexport function addSequencedChange(\n\teditManager: TestEditManager,\n\t...args: Parameters<(typeof editManager)[\"addSequencedChange\"]>\n): DeltaRoot {\n\tlet delta: DeltaRoot = emptyDelta;\n\tconst offChange = editManager.localBranch.on(\"afterChange\", ({ change }) => {\n\t\tif (change !== undefined) {\n\t\t\tdelta = asDelta(change.change.intentions);\n\t\t}\n\t});\n\teditManager.addSequencedChange(...args);\n\toffChange();\n\treturn delta;\n}\n"]}

package/lib/test/shared-tree-core/message.spec.d.ts

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

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

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

package/lib/test/shared-tree-core/message.spec.js

@@ -1,99 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { makeCodecFamily } from "../../codec/index.js";
-import { typeboxValidator } from "../../external-utilities/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { makeMessageCodec } from "../../shared-tree-core/messageCodecs.js";
-import { TestChange } from "../testChange.js";
-import { makeEncodingTestSuite, mintRevisionTag, testIdCompressor, testRevisionTagCodec, } from "../utils.js";
-const commit1 = {
-    revision: mintRevisionTag(),
-    change: TestChange.mint([], 0),
-};
-const commit2 = {
-    revision: mintRevisionTag(),
-    change: TestChange.mint([0], [1, 2, 3]),
-};
-const commitWithoutRevision = {
-    change: TestChange.mint([], 0),
-};
-const commitWithoutChange = {
-    revision: mintRevisionTag(),
-};
-const commitInvalid = {
-    revision: 1,
-    change: "Invalid change",
-};
-const dummyContext = { originatorId: testIdCompressor.localSessionId };
-const testCases = {
-    successes: [
-        [
-            "Message with commit 1",
-            {
-                sessionId: testIdCompressor.localSessionId,
-                commit: commit1,
-            },
-            dummyContext,
-        ],
-        [
-            "Message with commit 2",
-            {
-                sessionId: testIdCompressor.localSessionId,
-                commit: commit2,
-            },
-            dummyContext,
-        ],
-    ],
-    failures: {
-        0: [
-            ["Empty message", {}, dummyContext],
-            [
-                "Missing sessionId",
-                {
-                    commit: commit1,
-                },
-                dummyContext,
-            ],
-            [
-                "Missing commit",
-                {
-                    sessionId: "session1",
-                },
-                dummyContext,
-            ],
-            [
-                "Message with invalid sessionId",
-                {
-                    sessionId: 1,
-                    commit: commit1,
-                },
-                dummyContext,
-            ],
-            [
-                "Message with commit without revision",
-                {
-                    sessionId: "session1",
-                    commit: commitWithoutRevision,
-                },
-                dummyContext,
-            ],
-            [
-                "Message with invalid commit",
-                {
-                    sessionId: "session1",
-                    commit: commitInvalid,
-                },
-                dummyContext,
-            ],
-        ],
-    },
-};
-describe("message codec", () => {
-    const codec = makeMessageCodec(TestChange.codec, testRevisionTagCodec, {
-        jsonValidator: typeboxValidator,
-    });
-    makeEncodingTestSuite(makeCodecFamily([[0, codec]]), testCases);
-});
-//# sourceMappingURL=message.spec.js.map

package/lib/test/shared-tree-core/message.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"message.spec.js","sourceRoot":"","sources":["../../../src/test/shared-tree-core/message.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AACrE,sDAAsD;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yCAAyC,CAAC;AAI3E,OAAO,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAC9C,OAAO,EAEN,qBAAqB,EACrB,eAAe,EACf,gBAAgB,EAChB,oBAAoB,GACpB,MAAM,aAAa,CAAC;AAErB,MAAM,OAAO,GAAG;IACf,QAAQ,EAAE,eAAe,EAAE;IAC3B,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,OAAO,GAAG;IACf,QAAQ,EAAE,eAAe,EAAE;IAC3B,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CACvC,CAAC;AAEF,MAAM,qBAAqB,GAAG;IAC7B,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;CAC9B,CAAC;AAEF,MAAM,mBAAmB,GAAG;IAC3B,QAAQ,EAAE,eAAe,EAAE;CAC3B,CAAC;AAEF,MAAM,aAAa,GAAG;IACrB,QAAQ,EAAE,CAAC;IACX,MAAM,EAAE,gBAAgB;CACxB,CAAC;AAEF,MAAM,YAAY,GAAG,EAAE,YAAY,EAAE,gBAAgB,CAAC,cAAc,EAAE,CAAC;AACvE,MAAM,SAAS,GAAiF;IAC/F,SAAS,EAAE;QACV;YACC,uBAAuB;YACvB;gBACC,SAAS,EAAE,gBAAgB,CAAC,cAAc;gBAC1C,MAAM,EAAE,OAAO;aACf;YACD,YAAY;SACZ;QACD;YACC,uBAAuB;YACvB;gBACC,SAAS,EAAE,gBAAgB,CAAC,cAAc;gBAC1C,MAAM,EAAE,OAAO;aACf;YACD,YAAY;SACZ;KACD;IACD,QAAQ,EAAE;QACT,CAAC,EAAE;YACF,CAAC,eAAe,EAAE,EAAE,EAAE,YAAY,CAAC;YACnC;gBACC,mBAAmB;gBACnB;oBACC,MAAM,EAAE,OAAO;iBACf;gBACD,YAAY;aACZ;YACD;gBACC,gBAAgB;gBAChB;oBACC,SAAS,EAAE,UAAU;iBACrB;gBACD,YAAY;aACZ;YACD;gBACC,gCAAgC;gBAChC;oBACC,SAAS,EAAE,CAAC;oBACZ,MAAM,EAAE,OAAO;iBACf;gBACD,YAAY;aACZ;YACD;gBACC,sCAAsC;gBACtC;oBACC,SAAS,EAAE,UAAU;oBACrB,MAAM,EAAE,qBAAqB;iBAC7B;gBACD,YAAY;aACZ;YACD;gBACC,6BAA6B;gBAC7B;oBACC,SAAS,EAAE,UAAU;oBACrB,MAAM,EAAE,aAAa;iBACrB;gBACD,YAAY;aACZ;SACD;KACD;CACD,CAAC;AAEF,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC9B,MAAM,KAAK,GAAG,gBAAgB,CAAC,UAAU,CAAC,KAAK,EAAE,oBAAoB,EAAE;QACtE,aAAa,EAAE,gBAAgB;KAC/B,CAAC,CAAC;IAEH,qBAAqB,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;AACjE,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport { makeCodecFamily } from \"../../codec/index.js\";\nimport { typeboxValidator } from \"../../external-utilities/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { makeMessageCodec } from \"../../shared-tree-core/messageCodecs.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { DecodedMessage } from \"../../shared-tree-core/messageTypes.js\";\nimport { ChangeEncodingContext } from \"../../core/index.js\";\nimport { TestChange } from \"../testChange.js\";\nimport {\n\tEncodingTestData,\n\tmakeEncodingTestSuite,\n\tmintRevisionTag,\n\ttestIdCompressor,\n\ttestRevisionTagCodec,\n} from \"../utils.js\";\n\nconst commit1 = {\n\trevision: mintRevisionTag(),\n\tchange: TestChange.mint([], 0),\n};\n\nconst commit2 = {\n\trevision: mintRevisionTag(),\n\tchange: TestChange.mint([0], [1, 2, 3]),\n};\n\nconst commitWithoutRevision = {\n\tchange: TestChange.mint([], 0),\n};\n\nconst commitWithoutChange = {\n\trevision: mintRevisionTag(),\n};\n\nconst commitInvalid = {\n\trevision: 1,\n\tchange: \"Invalid change\",\n};\n\nconst dummyContext = { originatorId: testIdCompressor.localSessionId };\nconst testCases: EncodingTestData<DecodedMessage<TestChange>, unknown, ChangeEncodingContext> = {\n\tsuccesses: [\n\t\t[\n\t\t\t\"Message with commit 1\",\n\t\t\t{\n\t\t\t\tsessionId: testIdCompressor.localSessionId,\n\t\t\t\tcommit: commit1,\n\t\t\t},\n\t\t\tdummyContext,\n\t\t],\n\t\t[\n\t\t\t\"Message with commit 2\",\n\t\t\t{\n\t\t\t\tsessionId: testIdCompressor.localSessionId,\n\t\t\t\tcommit: commit2,\n\t\t\t},\n\t\t\tdummyContext,\n\t\t],\n\t],\n\tfailures: {\n\t\t0: [\n\t\t\t[\"Empty message\", {}, dummyContext],\n\t\t\t[\n\t\t\t\t\"Missing sessionId\",\n\t\t\t\t{\n\t\t\t\t\tcommit: commit1,\n\t\t\t\t},\n\t\t\t\tdummyContext,\n\t\t\t],\n\t\t\t[\n\t\t\t\t\"Missing commit\",\n\t\t\t\t{\n\t\t\t\t\tsessionId: \"session1\",\n\t\t\t\t},\n\t\t\t\tdummyContext,\n\t\t\t],\n\t\t\t[\n\t\t\t\t\"Message with invalid sessionId\",\n\t\t\t\t{\n\t\t\t\t\tsessionId: 1,\n\t\t\t\t\tcommit: commit1,\n\t\t\t\t},\n\t\t\t\tdummyContext,\n\t\t\t],\n\t\t\t[\n\t\t\t\t\"Message with commit without revision\",\n\t\t\t\t{\n\t\t\t\t\tsessionId: \"session1\",\n\t\t\t\t\tcommit: commitWithoutRevision,\n\t\t\t\t},\n\t\t\t\tdummyContext,\n\t\t\t],\n\t\t\t[\n\t\t\t\t\"Message with invalid commit\",\n\t\t\t\t{\n\t\t\t\t\tsessionId: \"session1\",\n\t\t\t\t\tcommit: commitInvalid,\n\t\t\t\t},\n\t\t\t\tdummyContext,\n\t\t\t],\n\t\t],\n\t},\n};\n\ndescribe(\"message codec\", () => {\n\tconst codec = makeMessageCodec(TestChange.codec, testRevisionTagCodec, {\n\t\tjsonValidator: typeboxValidator,\n\t});\n\n\tmakeEncodingTestSuite(makeCodecFamily([[0, codec]]), testCases);\n});\n"]}

package/lib/test/shared-tree-core/sharedTreeCore.spec.d.ts

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

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

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