@fluidframework/merge-tree 2.0.0-internal.8.0.0 → 2.0.0-rc.1.0.0

package/dist/test/sortedSegmentSet.spec.js

@@ -0,0 +1,95 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+const assert_1 = require("assert");
+const sortedSegmentSet_1 = require("../sortedSegmentSet");
+const ops_1 = require("../ops");
+const mergeTreeTracking_1 = require("../mergeTreeTracking");
+const testClient_1 = require("./testClient");
+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]);
+        (0, assert_1.strict)(a !== undefined, `${prefix}: Undefined ordinal ${i}`);
+        (0, assert_1.strict)(b !== undefined, `${prefix}: Undefined ordinal  ${i + 1}`);
+        (0, assert_1.strict)(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_1.strict.equal(set.remove(item), true, "remove failed");
+        assert_1.strict.equal(set.has(item), false);
+        validateSorted(set, getOrdinal, "during remove");
+    }
+}
+describe("SortedSegmentSet", () => {
+    const localUserLongId = "localUser";
+    let client;
+    beforeEach(() => {
+        client = new testClient_1.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_1.SortedSegmentSet();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segment = client.getContainingSegment(pos).segment;
+                (0, assert_1.strict)(segment);
+                const item = { segment };
+                assert_1.strict.equal(set.has(item), false);
+                set.addOrUpdate(item);
+                assert_1.strict.equal(set.has(item), true);
+            }
+        }
+        assert_1.strict.equal(set.size, client.getLength() * 2);
+        validateSet(client, set, (i) => i.segment.ordinal);
+    });
+    it("SortedSegmentSet of segments", () => {
+        const set = new sortedSegmentSet_1.SortedSegmentSet();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segment = client.getContainingSegment(pos).segment;
+                (0, assert_1.strict)(segment);
+                set.addOrUpdate(segment);
+                assert_1.strict.equal(set.has(segment), true);
+            }
+        }
+        assert_1.strict.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 mergeTreeTracking_1.TrackingGroup();
+        for (let i = 0; i < client.getLength(); i++) {
+            for (const pos of [i, client.getLength() - 1 - i]) {
+                const segmentInfo = client.getContainingSegment(pos);
+                (0, assert_1.strict)(segmentInfo?.segment);
+                const lref = client.createLocalReferencePosition(segmentInfo.segment, segmentInfo.offset, ops_1.ReferenceType.SlideOnRemove, undefined);
+                assert_1.strict.equal(set.has(lref), false);
+                set.link(lref);
+                assert_1.strict.equal(set.has(lref), true);
+            }
+        }
+        assert_1.strict.equal(set.size, client.getLength() * 2);
+        validateSet(client, set.trackedSet, (i) => i.getSegment()?.ordinal);
+    });
+});
+//# sourceMappingURL=sortedSegmentSet.spec.js.map

package/dist/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,mCAA0C;AAC1C,0DAA6E;AAG7E,gCAAuC;AACvC,4DAAqD;AACrD,6CAA0C;AAC1C,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,IAAA,eAAM,EAAC,CAAC,KAAK,SAAS,EAAE,GAAG,MAAM,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,CAAC,KAAK,SAAS,EAAE,GAAG,MAAM,wBAAwB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,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,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QACtD,eAAM,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,uBAAU,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,mCAAgB,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,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC;gBAChB,MAAM,IAAI,GAAG,EAAE,OAAO,EAAE,CAAC;gBACzB,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBACtB,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;aAClC;SACD;QACD,eAAM,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,mCAAgB,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,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC;gBAChB,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBACzB,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;aACrC;SACD;QACD,eAAM,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,iCAAa,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,IAAA,eAAM,EAAC,WAAW,EAAE,OAAO,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,4BAA4B,CAC/C,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,MAAM,EAClB,mBAAa,CAAC,aAAa,EAC3B,SAAS,CACT,CAAC;gBACF,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACf,eAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;aAClC;SACD;QACD,eAAM,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\";\nimport { ISegment } from \"../mergeTreeNodes\";\nimport { LocalReferencePosition } from \"../localReference\";\nimport { ReferenceType } from \"../ops\";\nimport { TrackingGroup } from \"../mergeTreeTracking\";\nimport { TestClient } from \"./testClient\";\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/dist/test/testClient.d.ts

@@ -0,0 +1,119 @@
+/*!
+ * 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";
+import { DoublyLinkedList } from "../collections";
+import { ISegment } from "../mergeTreeNodes";
+import { IJSONSegment, IMarkerDef, IMergeTreeOp, ReferenceType } from "../ops";
+import { PropertySet } from "../properties";
+import { MergeTree } from "../mergeTree";
+import { IMergeTreeDeltaOpArgs } from "../mergeTreeDeltaCallback";
+import { MergeTreeRevertibleDriver } from "../revertibles";
+import { IMergeTreeOptions, ReferencePosition } from "..";
+import { TestSerializer } from "./testSerializer";
+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);
+    /**
+     * @internal
+     */
+    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("..").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("..").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/dist/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,WAAW,CAAC;AACnC,OAAO,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAElD,OAAO,EAA2B,QAAQ,EAA2B,MAAM,mBAAmB,CAAC;AAE/F,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,YAAY,EAAsB,aAAa,EAAE,MAAM,QAAQ,CAAC;AACnG,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAG5C,OAAO,EAAoB,SAAS,EAAE,MAAM,cAAc,CAAC;AAE3D,OAAO,EAAE,qBAAqB,EAAE,MAAM,2BAA2B,CAAC;AAGlE,OAAO,EAAE,yBAAyB,EAAE,MAAM,gBAAgB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,MAAM,IAAI,CAAC;AAC1D,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD,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;gBACrC,OAAO,CAAC,EAAE,iBAAiB,GAAG,WAAW,EAAE,SAAS,uBAAgB;IAiBhF;;OAEG;IACI,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;CAkChC;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"}