@fluidframework/merge-tree 2.0.0-rc.1.0.4 → 2.0.0-rc.2.0.0

package/lib/test/sortedSegmentSet.spec.js

@@ -0,0 +1,93 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { SortedSegmentSet } from "../sortedSegmentSet.js";
+import { ReferenceType } from "../ops.js";
+import { TrackingGroup } from "../mergeTreeTracking.js";
+import { TestClient } from "./testClient.js";
+const segmentCount = 15;
+function validateSorted(set, getOrdinal, prefix) {
+    for (let i = 0; i < set.size - 1; i++) {
+        const a = getOrdinal(set.items[i]);
+        const b = getOrdinal(set.items[i + 1]);
+        assert(a !== undefined, `${prefix}: Undefined ordinal ${i}`);
+        assert(b !== undefined, `${prefix}: Undefined ordinal  ${i + 1}`);
+        assert(a <= b, `${prefix}: Not sorted at item ${i}`);
+    }
+}
+function validateSet(client, set, getOrdinal) {
+    validateSorted(set, getOrdinal, "initial");
+    // add content to shift ordinals in tree
+    for (let i = 0; i < segmentCount * 5; i++) {
+        client.insertTextLocal((i * 3) % client.getLength(), `X`);
+    }
+    validateSorted(set, getOrdinal, "after insert");
+    for (let i = set.size; set.size > 0; i += set.size) {
+        // jump around the list a bit, so its not just an in-order remove
+        const item = set.items[i % set.size];
+        assert.equal(set.remove(item), true, "remove failed");
+        assert.equal(set.has(item), false);
+        validateSorted(set, getOrdinal, "during remove");
+    }
+}
+describe("SortedSegmentSet", () => {
+    const localUserLongId = "localUser";
+    let client;
+    beforeEach(() => {
+        client = new TestClient();
+        for (let i = 0; i < segmentCount; i++) {
+            client.insertTextLocal(client.getLength(), i.toString()[0].repeat(i + 1));
+        }
+        client.startOrUpdateCollaboration(localUserLongId);
+    });
+    it("SortedSegmentSet of objects with segments", () => {
+        const set = new SortedSegmentSet();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segment = client.getContainingSegment(pos).segment;
+                assert(segment);
+                const item = { segment };
+                assert.equal(set.has(item), false);
+                set.addOrUpdate(item);
+                assert.equal(set.has(item), true);
+            }
+        }
+        assert.equal(set.size, client.getLength() * 2);
+        validateSet(client, set, (i) => i.segment.ordinal);
+    });
+    it("SortedSegmentSet of segments", () => {
+        const set = new SortedSegmentSet();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segment = client.getContainingSegment(pos).segment;
+                assert(segment);
+                set.addOrUpdate(segment);
+                assert.equal(set.has(segment), true);
+            }
+        }
+        assert.equal(set.size, segmentCount);
+        validateSet(client, set, (i) => i.ordinal);
+    });
+    it("SortedSegmentSet of local references", () => {
+        // using a sorted segment set directly creates problems,
+        // as we don't correctly split, or merge, so leverage
+        // the tracking group for correct behavior in those case
+        // and spy it's internal set
+        const set = new TrackingGroup();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segmentInfo = client.getContainingSegment(pos);
+                assert(segmentInfo?.segment);
+                const lref = client.createLocalReferencePosition(segmentInfo.segment, segmentInfo.offset, ReferenceType.SlideOnRemove, undefined);
+                assert.equal(set.has(lref), false);
+                set.link(lref);
+                assert.equal(set.has(lref), true);
+            }
+        }
+        assert.equal(set.size, client.getLength() * 2);
+        validateSet(client, set.trackedSet, (i) => i.getSegment()?.ordinal);
+    });
+});
+//# sourceMappingURL=sortedSegmentSet.spec.js.map

package/lib/test/sortedSegmentSet.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortedSegmentSet.spec.js","sourceRoot":"","sources":["../../src/test/sortedSegmentSet.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAwB,MAAM,wBAAwB,CAAC;AAGhF,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,MAAM,YAAY,GAAG,EAAE,CAAC;AAExB,SAAS,cAAc,CACtB,GAAwB,EACxB,UAA2C,EAC3C,MAAc;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACtC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,KAAK,SAAS,EAAE,GAAG,MAAM,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC7D,MAAM,CAAC,CAAC,KAAK,SAAS,EAAE,GAAG,MAAM,wBAAwB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,wBAAwB,CAAC,EAAE,CAAC,CAAC;KACrD;AACF,CAAC;AAED,SAAS,WAAW,CACnB,MAAkB,EAClB,GAAwB,EACxB,UAA2C;IAE3C,cAAc,CAAC,GAAG,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;IAE3C,wCAAwC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1C,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,GAAG,CAAC,CAAC;KAC1D;IACD,cAAc,CAAC,GAAG,EAAE,UAAU,EAAE,cAAc,CAAC,CAAC;IAEhD,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE;QACnD,iEAAiE;QACjE,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QACtD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QACnC,cAAc,CAAC,GAAG,EAAE,UAAU,EAAE,eAAe,CAAC,CAAC;KACjD;AACF,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,MAAM,eAAe,GAAG,WAAW,CAAC;IACpC,IAAI,MAAkB,CAAC;IACvB,UAAU,CAAC,GAAG,EAAE;QACf,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1E;QACD,MAAM,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,GAAG,GAAG,IAAI,gBAAgB,EAAyB,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;gBAClD,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBACzD,MAAM,CAAC,OAAO,CAAC,CAAC;gBAChB,MAAM,IAAI,GAAG,EAAE,OAAO,EAAE,CAAC;gBACzB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACtB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;aAClC;SACD;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;gBAClD,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;gBACzD,MAAM,CAAC,OAAO,CAAC,CAAC;gBAChB,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBACzB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;aACrC;SACD;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;QACrC,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,wDAAwD;QACxD,qDAAqD;QACrD,wDAAwD;QACxD,4BAA4B;QAC5B,MAAM,GAAG,GAAG,IAAI,aAAa,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;YAC5C,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE;gBAClD,MAAM,WAAW,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;gBACrD,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,4BAA4B,CAC/C,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,MAAM,EAClB,aAAa,CAAC,aAAa,EAC3B,SAAS,CACT,CAAC;gBACF,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACf,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;aAClC;SACD;QACD,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,WAAW,CACV,MAAM,EACL,GAAW,CAAC,UAAU,EACvB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,OAAO,CAC9B,CAAC;IACH,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 { SortedSegmentSet, SortedSegmentSetItem } from \"../sortedSegmentSet.js\";\nimport { ISegment } from \"../mergeTreeNodes.js\";\nimport { LocalReferencePosition } from \"../localReference.js\";\nimport { ReferenceType } from \"../ops.js\";\nimport { TrackingGroup } from \"../mergeTreeTracking.js\";\nimport { TestClient } from \"./testClient.js\";\nconst segmentCount = 15;\n\nfunction validateSorted<T extends SortedSegmentSetItem>(\n\tset: SortedSegmentSet<T>,\n\tgetOrdinal: (item: T) => string | undefined,\n\tprefix: string,\n) {\n\tfor (let i = 0; i < set.size - 1; i++) {\n\t\tconst a = getOrdinal(set.items[i]);\n\t\tconst b = getOrdinal(set.items[i + 1]);\n\t\tassert(a !== undefined, `${prefix}: Undefined ordinal ${i}`);\n\t\tassert(b !== undefined, `${prefix}: Undefined ordinal  ${i + 1}`);\n\t\tassert(a <= b, `${prefix}: Not sorted at item ${i}`);\n\t}\n}\n\nfunction validateSet<T extends SortedSegmentSetItem>(\n\tclient: TestClient,\n\tset: SortedSegmentSet<T>,\n\tgetOrdinal: (item: T) => string | undefined,\n) {\n\tvalidateSorted(set, getOrdinal, \"initial\");\n\n\t// add content to shift ordinals in tree\n\tfor (let i = 0; i < segmentCount * 5; i++) {\n\t\tclient.insertTextLocal((i * 3) % client.getLength(), `X`);\n\t}\n\tvalidateSorted(set, getOrdinal, \"after insert\");\n\n\tfor (let i = set.size; set.size > 0; i += set.size) {\n\t\t// jump around the list a bit, so its not just an in-order remove\n\t\tconst item = set.items[i % set.size];\n\t\tassert.equal(set.remove(item), true, \"remove failed\");\n\t\tassert.equal(set.has(item), false);\n\t\tvalidateSorted(set, getOrdinal, \"during remove\");\n\t}\n}\n\ndescribe(\"SortedSegmentSet\", () => {\n\tconst localUserLongId = \"localUser\";\n\tlet client: TestClient;\n\tbeforeEach(() => {\n\t\tclient = new TestClient();\n\t\tfor (let i = 0; i < segmentCount; i++) {\n\t\t\tclient.insertTextLocal(client.getLength(), i.toString()[0].repeat(i + 1));\n\t\t}\n\t\tclient.startOrUpdateCollaboration(localUserLongId);\n\t});\n\n\tit(\"SortedSegmentSet of objects with segments\", () => {\n\t\tconst set = new SortedSegmentSet<{ segment: ISegment }>();\n\t\tfor (let i = 0; i < client.getLength(); i++) {\n\t\t\tfor (const pos of [i, client.getLength() - 1 - i]) {\n\t\t\t\tconst segment = client.getContainingSegment(pos).segment;\n\t\t\t\tassert(segment);\n\t\t\t\tconst item = { segment };\n\t\t\t\tassert.equal(set.has(item), false);\n\t\t\t\tset.addOrUpdate(item);\n\t\t\t\tassert.equal(set.has(item), true);\n\t\t\t}\n\t\t}\n\t\tassert.equal(set.size, client.getLength() * 2);\n\t\tvalidateSet(client, set, (i) => i.segment.ordinal);\n\t});\n\n\tit(\"SortedSegmentSet of segments\", () => {\n\t\tconst set = new SortedSegmentSet();\n\t\tfor (let i = 0; i < client.getLength(); i++) {\n\t\t\tfor (const pos of [i, client.getLength() - 1 - i]) {\n\t\t\t\tconst segment = client.getContainingSegment(pos).segment;\n\t\t\t\tassert(segment);\n\t\t\t\tset.addOrUpdate(segment);\n\t\t\t\tassert.equal(set.has(segment), true);\n\t\t\t}\n\t\t}\n\t\tassert.equal(set.size, segmentCount);\n\t\tvalidateSet(client, set, (i) => i.ordinal);\n\t});\n\n\tit(\"SortedSegmentSet of local references\", () => {\n\t\t// using a sorted segment set directly creates problems,\n\t\t// as we don't correctly split, or merge, so leverage\n\t\t// the tracking group for correct behavior in those case\n\t\t// and spy it's internal set\n\t\tconst set = new TrackingGroup();\n\t\tfor (let i = 0; i < client.getLength(); i++) {\n\t\t\tfor (const pos of [i, client.getLength() - 1 - i]) {\n\t\t\t\tconst segmentInfo = client.getContainingSegment(pos);\n\t\t\t\tassert(segmentInfo?.segment);\n\t\t\t\tconst lref = client.createLocalReferencePosition(\n\t\t\t\t\tsegmentInfo.segment,\n\t\t\t\t\tsegmentInfo.offset,\n\t\t\t\t\tReferenceType.SlideOnRemove,\n\t\t\t\t\tundefined,\n\t\t\t\t);\n\t\t\t\tassert.equal(set.has(lref), false);\n\t\t\t\tset.link(lref);\n\t\t\t\tassert.equal(set.has(lref), true);\n\t\t\t}\n\t\t}\n\t\tassert.equal(set.size, client.getLength() * 2);\n\t\tvalidateSet<LocalReferencePosition>(\n\t\t\tclient,\n\t\t\t(set as any).trackedSet,\n\t\t\t(i) => i.getSegment()?.ordinal,\n\t\t);\n\t});\n});\n"]}

package/lib/test/testClient.d.ts

@@ -0,0 +1,116 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { ISequencedDocumentMessage, ISummaryTree, ITree } from "@fluidframework/protocol-definitions";
+import { MockStorage } from "@fluidframework/test-runtime-utils";
+import { AttributionKey } from "@fluidframework/runtime-definitions";
+import { Client } from "../client.js";
+import { DoublyLinkedList } from "../collections/index.js";
+import { ISegment } from "../mergeTreeNodes.js";
+import { IJSONSegment, IMarkerDef, IMergeTreeOp, ReferenceType } from "../ops.js";
+import { PropertySet } from "../properties.js";
+import { MergeTree } from "../mergeTree.js";
+import { IMergeTreeDeltaOpArgs } from "../mergeTreeDeltaCallback.js";
+import { MergeTreeRevertibleDriver } from "../revertibles.js";
+import { IMergeTreeOptions, ReferencePosition } from "../index.js";
+import { TestSerializer } from "./testSerializer.js";
+export declare function specToSegment(spec: IJSONSegment): ISegment;
+export declare class TestClient extends Client {
+    static searchChunkSize: number;
+    static readonly serializer: TestSerializer;
+    measureOps: boolean;
+    accumTime: number;
+    accumWindowTime: number;
+    accumWindow: number;
+    accumOps: number;
+    maxWindowTime: number;
+    /**
+     * Used for in-memory testing.  This will queue a reference string for each client message.
+     */
+    static useCheckQ: boolean;
+    static createFromClientSnapshot(client1: TestClient, newLongClientId: string): Promise<TestClient>;
+    static createFromSnapshot(snapshotTree: ITree, newLongClientId: string, specToSeg: (spec: IJSONSegment) => ISegment, options?: PropertySet): Promise<TestClient>;
+    static createFromSummary(summaryTree: ISummaryTree, newLongClientId: string, specToSeg: (spec: IJSONSegment) => ISegment, options?: PropertySet): Promise<TestClient>;
+    static createFromStorage(storage: MockStorage, newLongClientId: string, specToSeg: (spec: IJSONSegment) => ISegment, options?: PropertySet): Promise<TestClient>;
+    readonly mergeTree: MergeTree;
+    readonly checkQ: DoublyLinkedList<string>;
+    protected readonly q: DoublyLinkedList<ISequencedDocumentMessage>;
+    private readonly textHelper;
+    constructor(options?: IMergeTreeOptions & PropertySet, specToSeg?: typeof specToSegment, getMinInFlightRefSeq?: () => number | undefined);
+    obliterateRange({ start, end, refSeq, clientId, seq, overwrite, opArgs, }: {
+        start: number;
+        end: number;
+        refSeq: number;
+        clientId: number;
+        seq: number;
+        overwrite?: boolean;
+        opArgs: IMergeTreeDeltaOpArgs;
+    }): void;
+    getText(start?: number, end?: number): string;
+    enqueueTestString(): void;
+    getMessageCount(): number;
+    enqueueMsg(msg: ISequencedDocumentMessage): void;
+    dequeueMsg(): ISequencedDocumentMessage | undefined;
+    applyMessages(msgCount: number): boolean;
+    insertTextLocal(pos: number, text: string, props?: PropertySet): import("../ops.js").IMergeTreeInsertMsg | undefined;
+    insertTextRemote(pos: number, text: string, props: PropertySet | undefined, seq: number, refSeq: number, longClientId: string): void;
+    removeRangeRemote(start: number, end: number, seq: number, refSeq: number, longClientId: string): void;
+    annotateRangeRemote(start: number, end: number, props: PropertySet, seq: number, refSeq: number, longClientId: string): void;
+    insertMarkerLocal(pos: number, behaviors: ReferenceType, props?: PropertySet): import("../ops.js").IMergeTreeInsertMsg | undefined;
+    insertMarkerRemote(pos: number, markerDef: IMarkerDef, props: PropertySet, seq: number, refSeq: number, longClientId: string): void;
+    relText(clientId: number, refSeq: number): string;
+    makeOpMessage(op: IMergeTreeOp | undefined, seq?: number, refSeq?: number, longClientId?: string, minSeqNumber?: number): ISequencedDocumentMessage;
+    validate(): void;
+    searchFromPos(pos: number, target: RegExp): {
+        text: string;
+        pos: number;
+    } | undefined;
+    findRandomWord(): {
+        text: string;
+        pos: number;
+    } | undefined;
+    debugDumpTree(tree: MergeTree): void;
+    /**
+     * Rebases a (local) position from the perspective `{ seq: seqNumberFrom, localSeq }` to the perspective
+     * of the current sequence number. This is desirable when rebasing operations for reconnection. Perform
+     * slow-path computations in this function without leveraging the merge-tree's structure
+     */
+    rebasePosition(pos: number, seqNumberFrom: number, localSeq: number): number;
+    findReconnectionPosition(segment: ISegment, localSeq: number): number;
+    /**
+     * @param channel - Attribution channel name to request information from.
+     * @returns an array of all attribution seq#s from the current perspective.
+     * The `i`th entry of the array is the attribution key for the character at position `i`.
+     * Validates segments either all have attribution information or none of them.
+     * If no segment has attribution information, returns undefined.
+     */
+    getAllAttributionSeqs(channel?: string): (number | AttributionKey | undefined)[];
+    /**
+     * Override and add some test only metrics
+     */
+    applyMsg(msg: ISequencedDocumentMessage, local?: boolean): void;
+    /**
+     * Override and add some test only metrics
+     */
+    updateMinSeq(minSeq: number): void;
+    slowSearchForMarker(startPos: number, markerLabel: string, forwards?: boolean): ReferencePosition | undefined;
+}
+export type TestClientRevertibleDriver = MergeTreeRevertibleDriver & Partial<{
+    submitOpCallback?: (op: IMergeTreeOp | undefined) => void;
+}>;
+export declare const createRevertDriver: (client: TestClient) => TestClientRevertibleDriver;
+export interface MergeTreeStats {
+    maxHeight: number;
+    nodeCount: number;
+    leafCount: number;
+    removedLeafCount: number;
+    liveCount: number;
+    histo: number[];
+    windowTime?: number;
+    packTime?: number;
+    ordTime?: number;
+    maxOrdTime?: number;
+}
+export declare function getStats(tree: MergeTree): MergeTreeStats;
+//# sourceMappingURL=testClient.d.ts.map

package/lib/test/testClient.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"testClient.d.ts","sourceRoot":"","sources":["../../src/test/testClient.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EACN,yBAAyB,EACzB,YAAY,EACZ,KAAK,EAEL,MAAM,sCAAsC,CAAC;AAE9C,OAAO,EAAE,WAAW,EAAE,MAAM,oCAAoC,CAAC;AAEjE,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AACrE,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAA6B,QAAQ,EAA2B,MAAM,sBAAsB,CAAC;AAEpG,OAAO,EACN,YAAY,EACZ,UAAU,EACV,YAAY,EAEZ,aAAa,EACb,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAG/C,OAAO,EAAoB,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC;AAC9D,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAC;AAGrD,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,GAAG,QAAQ,CAY1D;AAID,qBAAa,UAAW,SAAQ,MAAM;IACrC,OAAc,eAAe,SAAO;IACpC,gBAAuB,UAAU,iBAAwB;IAClD,UAAU,UAAS;IACnB,SAAS,SAAK;IACd,eAAe,SAAK;IACpB,WAAW,SAAK;IAChB,QAAQ,SAAK;IACb,aAAa,SAAK;IAEzB;;OAEG;IACH,OAAc,SAAS,UAAS;WAEZ,wBAAwB,CAC3C,OAAO,EAAE,UAAU,EACnB,eAAe,EAAE,MAAM,GACrB,OAAO,CAAC,UAAU,CAAC;WAgBF,kBAAkB,CACrC,YAAY,EAAE,KAAK,EACnB,eAAe,EAAE,MAAM,EACvB,SAAS,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,QAAQ,EAC3C,OAAO,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,UAAU,CAAC;WASF,iBAAiB,CACpC,WAAW,EAAE,YAAY,EACzB,eAAe,EAAE,MAAM,EACvB,SAAS,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,QAAQ,EAC3C,OAAO,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,UAAU,CAAC;WASF,iBAAiB,CACpC,OAAO,EAAE,WAAW,EACpB,eAAe,EAAE,MAAM,EACvB,SAAS,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,QAAQ,EAC3C,OAAO,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,UAAU,CAAC;IActB,SAAgB,SAAS,EAAE,SAAS,CAAC;IAErC,SAAgB,MAAM,EAAE,gBAAgB,CAAC,MAAM,CAAC,CAAkC;IAClF,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,gBAAgB,CAAC,yBAAyB,CAAC,CACd;IAEnD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAsB;gBAEhD,OAAO,CAAC,EAAE,iBAAiB,GAAG,WAAW,EACzC,SAAS,uBAAgB,EACzB,oBAAoB,GAAE,MAAM,MAAM,GAAG,SAA2B;IAuB1D,eAAe,CAAC,EACtB,KAAK,EACL,GAAG,EACH,MAAM,EACN,QAAQ,EACR,GAAG,EACH,SAAiB,EACjB,MAAM,GACN,EAAE;QACF,KAAK,EAAE,MAAM,CAAC;QACd,GAAG,EAAE,MAAM,CAAC;QACZ,MAAM,EAAE,MAAM,CAAC;QACf,QAAQ,EAAE,MAAM,CAAC;QACjB,GAAG,EAAE,MAAM,CAAC;QACZ,SAAS,CAAC,EAAE,OAAO,CAAC;QACpB,MAAM,EAAE,qBAAqB,CAAC;KAC9B,GAAG,IAAI;IAID,OAAO,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM;IAI7C,iBAAiB;IAGjB,eAAe,IAAI,MAAM;IAGzB,UAAU,CAAC,GAAG,EAAE,yBAAyB;IAGzC,UAAU,IAAI,yBAAyB,GAAG,SAAS;IAGnD,aAAa,CAAC,QAAQ,EAAE,MAAM;IAe9B,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,WAAW;IAQ9D,gBAAgB,CACtB,GAAG,EAAE,MAAM,EACX,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,WAAW,GAAG,SAAS,EAC9B,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM;IAWd,iBAAiB,CACvB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM;IAOd,mBAAmB,CACzB,KAAK,EAAE,MAAM,EACb,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,WAAW,EAClB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM;IAOd,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,KAAK,CAAC,EAAE,WAAW;IAQ5E,kBAAkB,CACxB,GAAG,EAAE,MAAM,EACX,SAAS,EAAE,UAAU,EACrB,KAAK,EAAE,WAAW,EAClB,GAAG,EAAE,MAAM,EACX,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,MAAM;IAWd,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IAOxC,aAAa,CACnB,EAAE,EAAE,YAAY,GAAG,SAAS,EAC5B,GAAG,GAAE,MAAiC,EACtC,MAAM,GAAE,MAA6B,EACrC,YAAY,CAAC,EAAE,MAAM,EACrB,YAAY,SAAI;IAoBV,QAAQ;IAIR,aAAa,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;;;;IAczC,cAAc;;;;IAOd,aAAa,CAAC,IAAI,EAAE,SAAS;IAmBpC;;;;OAIG;IACI,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IA2C5E,wBAAwB,CAAC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IA6C5E;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAO,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,GAAG,cAAc,GAAG,SAAS,CAAC,EAAE;IAavF;;OAEG;IACI,QAAQ,CAAC,GAAG,EAAE,yBAAyB,EAAE,KAAK,GAAE,OAAe;IAetE;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM;IAgB3B,mBAAmB,CAClB,QAAQ,EAAE,MAAM,EAChB,WAAW,EAAE,MAAM,EACnB,QAAQ,UAAO,GACb,iBAAiB,GAAG,SAAS;CAmChC;AAOD,MAAM,MAAM,0BAA0B,GAAG,yBAAyB,GACjE,OAAO,CAAC;IAAE,gBAAgB,CAAC,EAAE,CAAC,EAAE,EAAE,YAAY,GAAG,SAAS,KAAK,IAAI,CAAA;CAAE,CAAC,CAAC;AAExE,eAAO,MAAM,kBAAkB,WAAY,UAAU,KAAG,0BAevD,CAAC;AAEF,MAAM,WAAW,cAAc;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,UAAU,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,kBA4CvC"}

package/lib/test/testClient.js

@@ -0,0 +1,430 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { makeRandom } from "@fluid-private/stochastic-test-utils";
+import { createChildLogger } from "@fluidframework/telemetry-utils";
+import { MessageType, } from "@fluidframework/protocol-definitions";
+import { MockStorage } from "@fluidframework/test-runtime-utils";
+import { Trace } from "@fluid-internal/client-utils";
+import { Client } from "../client.js";
+import { DoublyLinkedList } from "../collections/index.js";
+import { UnassignedSequenceNumber } from "../constants.js";
+import { Marker, MaxNodesInBlock } from "../mergeTreeNodes.js";
+import { createAnnotateRangeOp, createInsertSegmentOp, createRemoveRangeOp } from "../opBuilder.js";
+import { MergeTreeDeltaType, ReferenceType, } from "../ops.js";
+import { SnapshotLegacy } from "../snapshotlegacy.js";
+import { TextSegment } from "../textSegment.js";
+import { getSlideToSegoff } from "../mergeTree.js";
+import { MergeTreeTextHelper } from "../MergeTreeTextHelper.js";
+import { backwardExcursion, forwardExcursion, walkAllChildSegments } from "../mergeTreeNodeWalk.js";
+import { DetachedReferencePosition, refHasTileLabel } from "../referencePositions.js";
+import { TestSerializer } from "./testSerializer.js";
+import { nodeOrdinalsHaveIntegrity } from "./testUtils.js";
+export function specToSegment(spec) {
+    const maybeText = TextSegment.fromJSONObject(spec);
+    if (maybeText) {
+        return maybeText;
+    }
+    const maybeMarker = Marker.fromJSONObject(spec);
+    if (maybeMarker) {
+        return maybeMarker;
+    }
+    throw new Error(`Unrecognized IJSONSegment type: '${JSON.stringify(spec)}'`);
+}
+const random = makeRandom(0xdeadbeef, 0xfeedbed);
+export class TestClient extends Client {
+    static async createFromClientSnapshot(client1, newLongClientId) {
+        const snapshot = new SnapshotLegacy(client1.mergeTree, createChildLogger({ namespace: "fluid:snapshot" }));
+        snapshot.extractSync();
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const summaryTree = snapshot.emit([], TestClient.serializer, undefined).summary;
+        return TestClient.createFromSummary(summaryTree, newLongClientId, client1.specToSegment, client1.mergeTree.options);
+    }
+    static async createFromSnapshot(snapshotTree, newLongClientId, specToSeg, options) {
+        return TestClient.createFromStorage(new MockStorage(snapshotTree), newLongClientId, specToSeg, options);
+    }
+    static async createFromSummary(summaryTree, newLongClientId, specToSeg, options) {
+        return TestClient.createFromStorage(MockStorage.createFromSummary(summaryTree), newLongClientId, specToSeg, options);
+    }
+    static async createFromStorage(storage, newLongClientId, specToSeg, options) {
+        const client2 = new TestClient(options, specToSeg);
+        const { catchupOpsP } = await client2.load({
+            logger: client2.logger,
+            clientId: newLongClientId,
+        }, storage, TestClient.serializer);
+        await catchupOpsP;
+        return client2;
+    }
+    constructor(options, specToSeg = specToSegment, getMinInFlightRefSeq = () => undefined) {
+        super(specToSeg, createChildLogger({ namespace: "fluid:testClient" }), options, getMinInFlightRefSeq);
+        this.measureOps = false;
+        this.accumTime = 0;
+        this.accumWindowTime = 0;
+        this.accumWindow = 0;
+        this.accumOps = 0;
+        this.maxWindowTime = 0;
+        this.checkQ = new DoublyLinkedList();
+        this.q = new DoublyLinkedList();
+        this.mergeTree = this._mergeTree;
+        this.textHelper = new MergeTreeTextHelper(this.mergeTree);
+        // Validate by default
+        this.on("delta", (o, d) => {
+            // assert.notEqual(d.deltaSegments.length, 0);
+            d.deltaSegments.forEach((s) => {
+                if (d.operation === MergeTreeDeltaType.INSERT) {
+                    const seg = s.segment;
+                    assert.notEqual(seg.parent, undefined);
+                }
+            });
+        });
+    }
+    obliterateRange({ start, end, refSeq, clientId, seq, overwrite = false, opArgs, }) {
+        this.mergeTree.obliterateRange(start, end, refSeq, clientId, seq, overwrite, opArgs);
+    }
+    getText(start, end) {
+        return this.textHelper.getText(this.getCurrentSeq(), this.getClientId(), "", start, end);
+    }
+    enqueueTestString() {
+        this.checkQ.push(this.getText());
+    }
+    getMessageCount() {
+        return this.q.length;
+    }
+    enqueueMsg(msg) {
+        this.q.push(msg);
+    }
+    dequeueMsg() {
+        return this.q.shift()?.data;
+    }
+    applyMessages(msgCount) {
+        let currMsgCount = msgCount;
+        while (currMsgCount > 0) {
+            const msg = this.dequeueMsg();
+            if (msg) {
+                this.applyMsg(msg);
+            }
+            else {
+                break;
+            }
+            currMsgCount--;
+        }
+        return true;
+    }
+    insertTextLocal(pos, text, props) {
+        const segment = new TextSegment(text);
+        if (props) {
+            segment.addProperties(props);
+        }
+        return this.insertSegmentLocal(pos, segment);
+    }
+    insertTextRemote(pos, text, props, seq, refSeq, longClientId) {
+        const segment = new TextSegment(text);
+        if (props) {
+            segment.addProperties(props);
+        }
+        this.applyMsg(this.makeOpMessage(createInsertSegmentOp(pos, segment), seq, refSeq, longClientId));
+    }
+    removeRangeRemote(start, end, seq, refSeq, longClientId) {
+        this.applyMsg(this.makeOpMessage(createRemoveRangeOp(start, end), seq, refSeq, longClientId));
+    }
+    annotateRangeRemote(start, end, props, seq, refSeq, longClientId) {
+        this.applyMsg(this.makeOpMessage(createAnnotateRangeOp(start, end, props), seq, refSeq, longClientId));
+    }
+    insertMarkerLocal(pos, behaviors, props) {
+        const segment = new Marker(behaviors);
+        if (props) {
+            segment.addProperties(props);
+        }
+        return this.insertSegmentLocal(pos, segment);
+    }
+    insertMarkerRemote(pos, markerDef, props, seq, refSeq, longClientId) {
+        const segment = new Marker(markerDef.refType ?? ReferenceType.Tile);
+        if (props) {
+            segment.addProperties(props);
+        }
+        this.applyMsg(this.makeOpMessage(createInsertSegmentOp(pos, segment), seq, refSeq, longClientId));
+    }
+    relText(clientId, refSeq) {
+        return `cli: ${this.getLongClientId(clientId)} refSeq: ${refSeq}: ${this.textHelper.getText(refSeq, clientId)}`;
+    }
+    makeOpMessage(op, seq = UnassignedSequenceNumber, refSeq = this.getCurrentSeq(), longClientId, minSeqNumber = 0) {
+        if (op === undefined) {
+            throw new Error("op cannot be undefined");
+        }
+        const msg = {
+            clientId: longClientId ?? this.longClientId ?? "",
+            clientSequenceNumber: 1,
+            contents: op,
+            metadata: undefined,
+            minimumSequenceNumber: minSeqNumber,
+            referenceSequenceNumber: refSeq,
+            sequenceNumber: seq,
+            timestamp: Date.now(),
+            traces: [],
+            type: MessageType.Operation,
+        };
+        return msg;
+    }
+    validate() {
+        assert(nodeOrdinalsHaveIntegrity(this.mergeTree.root));
+    }
+    searchFromPos(pos, target) {
+        let start = pos;
+        let chunk = "";
+        while (start < this.getLength()) {
+            chunk = this.getText(start, start + TestClient.searchChunkSize);
+            const result = chunk.match(target);
+            if (result?.index) {
+                return { text: result[0], pos: result.index + start };
+            }
+            start += TestClient.searchChunkSize;
+        }
+    }
+    findRandomWord() {
+        const len = this.getLength();
+        const pos = random.integer(0, len);
+        const nextWord = this.searchFromPos(pos, /\s\w+\b/);
+        return nextWord;
+    }
+    debugDumpTree(tree) {
+        // want the segment's content and the state of insert/remove
+        const test = [];
+        walkAllChildSegments(tree.root, (segment) => {
+            const prefixes = [];
+            prefixes.push(segment.seq !== UnassignedSequenceNumber ? segment.seq : `L${segment.localSeq}`);
+            if (segment.removedSeq !== undefined) {
+                prefixes.push(segment.removedSeq !== UnassignedSequenceNumber
+                    ? segment.removedSeq
+                    : `L${segment.localRemovedSeq}`);
+            }
+            test.push(`${prefixes.join(",")}:${segment.text}`);
+        });
+    }
+    /**
+     * Rebases a (local) position from the perspective `{ seq: seqNumberFrom, localSeq }` to the perspective
+     * of the current sequence number. This is desirable when rebasing operations for reconnection. Perform
+     * slow-path computations in this function without leveraging the merge-tree's structure
+     */
+    rebasePosition(pos, seqNumberFrom, localSeq) {
+        let segment;
+        let posAccumulated = 0;
+        let offset = pos;
+        const isInsertedInView = (seg) => (seg.seq !== undefined &&
+            seg.seq !== UnassignedSequenceNumber &&
+            seg.seq <= seqNumberFrom) ||
+            (seg.localSeq !== undefined && seg.localSeq <= localSeq);
+        const isRemovedFromView = ({ removedSeq, localRemovedSeq }) => (removedSeq !== undefined &&
+            removedSeq !== UnassignedSequenceNumber &&
+            removedSeq <= seqNumberFrom) ||
+            (localRemovedSeq !== undefined && localRemovedSeq <= localSeq);
+        walkAllChildSegments(this.mergeTree.root, (seg) => {
+            assert(seg.seq !== undefined || seg.localSeq !== undefined, "either seq or localSeq should be defined");
+            segment = seg;
+            if (isInsertedInView(seg) && !isRemovedFromView(seg)) {
+                posAccumulated += seg.cachedLength;
+                if (offset >= seg.cachedLength) {
+                    offset -= seg.cachedLength;
+                }
+            }
+            // Keep going while we've yet to reach the segment at the desired position
+            return posAccumulated <= pos;
+        });
+        assert(segment !== undefined, "No segment found");
+        const segoff = getSlideToSegoff({ segment, offset }) ?? segment;
+        if (segoff.segment === undefined || segoff.offset === undefined) {
+            return DetachedReferencePosition;
+        }
+        return this.findReconnectionPosition(segoff.segment, localSeq) + segoff.offset;
+    }
+    findReconnectionPosition(segment, localSeq) {
+        const fasterComputedPosition = super.findReconnectionPosition(segment, localSeq);
+        let segmentPosition = 0;
+        const isInsertedInView = (seg) => seg.localSeq === undefined || seg.localSeq <= localSeq;
+        const isRemovedFromView = ({ removedSeq, localRemovedSeq }) => removedSeq !== undefined &&
+            (removedSeq !== UnassignedSequenceNumber ||
+                (localRemovedSeq !== undefined && localRemovedSeq <= localSeq));
+        const isMovedFromView = ({ movedSeq, localMovedSeq }) => movedSeq !== undefined &&
+            (movedSeq !== UnassignedSequenceNumber ||
+                (localMovedSeq !== undefined && localMovedSeq <= localSeq));
+        /*
+            Walk the segments up to the current segment, and calculate its
+            position taking into account local segments that were modified,
+            after the current segment.
+        */
+        walkAllChildSegments(this.mergeTree.root, (seg) => {
+            // If we've found the desired segment, terminate the walk and return 'segmentPosition'.
+            if (seg === segment) {
+                return false;
+            }
+            // Otherwise, advance segmentPosition if the segment has been inserted and not removed
+            // with respect to the given 'localSeq'.
+            //
+            // Note that all ACKed / remote ops are applied and we only need concern ourself with
+            // determining if locally pending ops fall before/after the given 'localSeq'.
+            if (isInsertedInView(seg) && !isRemovedFromView(seg) && !isMovedFromView(seg)) {
+                segmentPosition += seg.cachedLength;
+            }
+            return true;
+        });
+        assert.equal(fasterComputedPosition, segmentPosition, "Expected fast-path computation to match result from walk all segments");
+        return segmentPosition;
+    }
+    /**
+     * @param channel - Attribution channel name to request information from.
+     * @returns an array of all attribution seq#s from the current perspective.
+     * The `i`th entry of the array is the attribution key for the character at position `i`.
+     * Validates segments either all have attribution information or none of them.
+     * If no segment has attribution information, returns undefined.
+     */
+    getAllAttributionSeqs(channel) {
+        const seqs = [];
+        this.walkAllSegments((segment) => {
+            for (let i = 0; i < segment.cachedLength; i++) {
+                const key = segment.attribution?.getAtOffset(i, channel);
+                seqs.push(key?.type === "op" ? key.seq : key);
+            }
+            return true;
+        });
+        return seqs;
+    }
+    /**
+     * Override and add some test only metrics
+     */
+    applyMsg(msg, local = false) {
+        let traceStart;
+        if (this.measureOps) {
+            traceStart = Trace.start();
+        }
+        super.applyMsg(msg, local);
+        if (traceStart) {
+            this.accumTime += elapsedMicroseconds(traceStart);
+            this.accumOps++;
+            this.accumWindow += this.getCurrentSeq() - this.getCollabWindow().minSeq;
+        }
+    }
+    /**
+     * Override and add some test only metrics
+     */
+    updateMinSeq(minSeq) {
+        let trace;
+        if (this.measureOps) {
+            trace = Trace.start();
+        }
+        super.updateMinSeq(minSeq);
+        if (trace) {
+            const elapsed = elapsedMicroseconds(trace);
+            this.accumWindowTime += elapsed;
+            if (elapsed > this.maxWindowTime) {
+                this.maxWindowTime = elapsed;
+            }
+        }
+    }
+    slowSearchForMarker(startPos, markerLabel, forwards = true) {
+        let foundMarker;
+        const { segment } = this.getContainingSegment(startPos);
+        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+        const segWithParent = segment;
+        if (Marker.is(segWithParent)) {
+            if (refHasTileLabel(segWithParent, markerLabel)) {
+                foundMarker = segWithParent;
+            }
+        }
+        else {
+            if (forwards) {
+                forwardExcursion(segWithParent, (seg) => {
+                    if (Marker.is(seg)) {
+                        if (refHasTileLabel(seg, markerLabel)) {
+                            foundMarker = seg;
+                            return false;
+                        }
+                    }
+                });
+            }
+            else {
+                backwardExcursion(segWithParent, (seg) => {
+                    if (Marker.is(seg)) {
+                        if (refHasTileLabel(seg, markerLabel)) {
+                            foundMarker = seg;
+                            return false;
+                        }
+                    }
+                });
+            }
+        }
+        return foundMarker;
+    }
+}
+TestClient.searchChunkSize = 256;
+TestClient.serializer = new TestSerializer();
+/**
+ * Used for in-memory testing.  This will queue a reference string for each client message.
+ */
+TestClient.useCheckQ = false;
+function elapsedMicroseconds(trace) {
+    return trace.trace().duration * 1000;
+}
+export const createRevertDriver = (client) => {
+    return {
+        removeRange(start, end) {
+            const op = client.removeRangeLocal(start, end);
+            this.submitOpCallback?.(op);
+        },
+        annotateRange(start, end, props) {
+            const op = client.annotateRangeLocal(start, end, props);
+            this.submitOpCallback?.(op);
+        },
+        insertFromSpec(pos, spec) {
+            const op = client.insertSegmentLocal(pos, client.specToSegment(spec));
+            this.submitOpCallback?.(op);
+        },
+    };
+};
+export function getStats(tree) {
+    const nodeGetStats = (block) => {
+        const stats = {
+            maxHeight: 0,
+            nodeCount: 0,
+            leafCount: 0,
+            removedLeafCount: 0,
+            liveCount: 0,
+            histo: [],
+        };
+        for (let k = 0; k < MaxNodesInBlock; k++) {
+            stats.histo[k] = 0;
+        }
+        for (let i = 0; i < block.childCount; i++) {
+            const child = block.children[i];
+            let height = 1;
+            if (!child.isLeaf()) {
+                const childStats = nodeGetStats(child);
+                height = 1 + childStats.maxHeight;
+                stats.nodeCount += childStats.nodeCount;
+                stats.leafCount += childStats.leafCount;
+                stats.removedLeafCount += childStats.removedLeafCount;
+                stats.liveCount += childStats.liveCount;
+                for (let j = 0; j < MaxNodesInBlock; j++) {
+                    stats.histo[j] += childStats.histo[j];
+                }
+            }
+            else {
+                stats.leafCount++;
+                const segment = child;
+                if (segment.removedSeq !== undefined) {
+                    stats.removedLeafCount++;
+                }
+            }
+            if (height > stats.maxHeight) {
+                stats.maxHeight = height;
+            }
+        }
+        stats.histo[block.childCount]++;
+        stats.nodeCount++;
+        stats.liveCount += block.childCount;
+        return stats;
+    };
+    const rootStats = nodeGetStats(tree.root);
+    return rootStats;
+}
+//# sourceMappingURL=testClient.js.map