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

package/dist/test/client.applyStashedOpFarm.spec.js

@@ -0,0 +1,144 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.defaultOptions = void 0;
+const stochastic_test_utils_1 = require("@fluid-private/stochastic-test-utils");
+const mergeTreeOperationRunner_1 = require("./mergeTreeOperationRunner");
+const testClient_1 = require("./testClient");
+const testClientLogger_1 = require("./testClientLogger");
+function applyMessagesWithReconnect(startingSeq, messageDatas, clients, stashClients) {
+    let seq = startingSeq;
+    const reconnectClientMsgs = [];
+    let minSeq = 0;
+    // apply ops as stashed ops except for client #1
+    const stashedOps = [];
+    for (const messageData of messageDatas) {
+        if (messageData[0].clientId !== clients[1].longClientId) {
+            const index = clients
+                .map((c) => c.longClientId)
+                .indexOf(messageData[0].clientId);
+            const localMetadata = stashClients[index].applyStashedOp(messageData[0].contents);
+            stashedOps.push([messageData[0].contents, localMetadata, index]);
+        }
+    }
+    // this should put all stash clients (except #1) in the same state as the
+    // respective normal clients, having local changes only.
+    for (let i = 0; i < clients.length; ++i) {
+        if (i !== 1) {
+            testClientLogger_1.TestClientLogger.validate([clients[i], stashClients[i]]);
+        }
+    }
+    testClientLogger_1.TestClientLogger.validate([clients[0], stashClients[1]]);
+    // apply the ops to the normal clients. they will all be the same now,
+    // except #1 which has local changes other clients haven't seen yet
+    for (const [message, sg] of messageDatas) {
+        if (message.clientId === clients[1].longClientId) {
+            reconnectClientMsgs.push([message.contents, sg]);
+        }
+        else {
+            message.sequenceNumber = ++seq;
+            clients.forEach((c) => c.applyMsg(message));
+            minSeq = message.minimumSequenceNumber;
+        }
+    }
+    // regenerate the ops that were applied as stashed ops. this simulates resubmit()
+    const regeneratedStashedOps = stashedOps.map((op) => stashClients[op[2]].makeOpMessage(stashClients[op[2]].regeneratePendingOp(op[0], op[1])));
+    // apply the regenerated stashed ops
+    let stashedOpSeq = startingSeq;
+    for (const msg of regeneratedStashedOps) {
+        msg.sequenceNumber = ++stashedOpSeq;
+        stashClients.forEach((c) => c.applyMsg(msg));
+    }
+    // all stash and normal clients should now be in the same state,
+    // except #1 (normal) which still has local changes
+    testClientLogger_1.TestClientLogger.validate([...clients.filter((_, i) => i !== 1), ...stashClients]);
+    // regenerate ops for client #1
+    const reconnectMsgs = [];
+    reconnectClientMsgs.forEach((opData) => {
+        const newMsg = clients[1].makeOpMessage(clients[1].regeneratePendingOp(opData[0], opData[1]));
+        newMsg.minimumSequenceNumber = minSeq;
+        reconnectMsgs.push(newMsg);
+    });
+    // apply regenerated ops as stashed ops for client #1
+    const stashedRegeneratedOps = reconnectMsgs.map((message) => {
+        const localMetadata = stashClients[1].applyStashedOp(message.contents);
+        return [message.contents, localMetadata];
+    });
+    // now both clients at index 1 should be the same
+    testClientLogger_1.TestClientLogger.validate([clients[1], stashClients[1]]);
+    // apply the regenerated ops from client #1
+    for (const message of reconnectMsgs) {
+        message.sequenceNumber = ++seq;
+        clients.forEach((c) => c.applyMsg(message));
+    }
+    // resubmit regenerated stashed ops
+    const reRegeneratedStashedMessages = stashedRegeneratedOps.map((stashedOp) => stashClients[1].makeOpMessage(stashClients[1].regeneratePendingOp(stashedOp[0], stashedOp[1])));
+    for (const reRegeneratedStashedOp of reRegeneratedStashedMessages) {
+        reRegeneratedStashedOp.sequenceNumber = ++stashedOpSeq;
+        stashClients.forEach((c) => c.applyMsg(reRegeneratedStashedOp));
+    }
+    // all clients should now be the same
+    testClientLogger_1.TestClientLogger.validate([...clients, ...stashClients]);
+    return seq;
+}
+exports.defaultOptions = {
+    minLength: 16,
+    clients: { min: 3, max: 12 },
+    opsPerRoundRange: { min: 40, max: 120 },
+    rounds: 3,
+    operations: [mergeTreeOperationRunner_1.annotateRange, mergeTreeOperationRunner_1.removeRange, mergeTreeOperationRunner_1.insert],
+    growthFunc: (input) => input * 2,
+};
+// Generate a list of single character client names, support up to 69 clients
+const clientNames = (0, mergeTreeOperationRunner_1.generateClientNames)();
+function runApplyStashedOpFarmTests(opts, extraSeed) {
+    (0, mergeTreeOperationRunner_1.doOverRange)(opts.clients, opts.growthFunc.bind(opts), (clientCount) => {
+        it(`applyStashedOpFarm_${clientCount}`, async () => {
+            const random = (0, stochastic_test_utils_1.makeRandom)(0xdeadbeef, 0xfeedbed, clientCount, extraSeed ?? 0);
+            const testOpts = { ...opts };
+            if (extraSeed) {
+                testOpts.resultsFilePostfix ?? (testOpts.resultsFilePostfix = "");
+                testOpts.resultsFilePostfix += extraSeed;
+            }
+            const clients = [new testClient_1.TestClient()];
+            // This test is based on reconnectFarm, but we keep a second set of clients. For
+            // these clients, we apply the generated ops as stashed ops, then regenerate
+            // them to simulate resubmit(), then apply them. In the end, they should arrive
+            // at the same state as the "normal" set of clients
+            let stashClients = [];
+            clients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));
+            stashClients = [new testClient_1.TestClient()];
+            stashClients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));
+            let seq = 0;
+            clients.forEach((c) => c.updateMinSeq(seq));
+            stashClients.forEach((c) => c.updateMinSeq(seq));
+            // Add double the number of clients each iteration
+            const targetClients = Math.max(opts.clients.min, clientCount);
+            for (let cc = clients.length; cc < targetClients; cc++) {
+                const newClient = await testClient_1.TestClient.createFromClientSnapshot(clients[0], clientNames[cc]);
+                clients.push(newClient);
+                // add 1 stash client per normal client
+                const anotherNewClient = await testClient_1.TestClient.createFromClientSnapshot(clients[0], clientNames[cc]);
+                stashClients.push(anotherNewClient);
+            }
+            seq = (0, mergeTreeOperationRunner_1.runMergeTreeOperationRunner)(random, seq, clients, opts.minLength, opts, (s, m, c) => applyMessagesWithReconnect(s, m, c, stashClients));
+        }).timeout(30 * 1000);
+    });
+}
+(0, stochastic_test_utils_1.describeFuzz)("MergeTree.Client", ({ testCount }) => {
+    const opts = exports.defaultOptions;
+    if (testCount > 1) {
+        (0, mergeTreeOperationRunner_1.doOverRange)({ min: 0, max: testCount - 1 }, (x) => x + 1, (seed) => {
+            describe(`with seed ${seed}`, () => {
+                runApplyStashedOpFarmTests(opts, seed);
+            });
+        });
+    }
+    else {
+        runApplyStashedOpFarmTests(opts);
+    }
+});
+//# sourceMappingURL=client.applyStashedOpFarm.spec.js.map

package/dist/test/client.applyStashedOpFarm.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.applyStashedOpFarm.spec.js","sourceRoot":"","sources":["../../src/test/client.applyStashedOpFarm.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,gFAAgF;AAIhF,yEASoC;AACpC,6CAA0C;AAC1C,yDAAsD;AAEtD,SAAS,0BAA0B,CAClC,WAAmB,EACnB,YAA0E,EAC1E,OAA8B,EAC9B,YAAmC;IAEnC,IAAI,GAAG,GAAG,WAAW,CAAC;IACtB,MAAM,mBAAmB,GAAoD,EAAE,CAAC;IAChF,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,gDAAgD;IAChD,MAAM,UAAU,GAA4D,EAAE,CAAC;IAC/E,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;QACvC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE;YACxD,MAAM,KAAK,GAAG,OAAO;iBACnB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC;iBAC1B,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAkB,CAAC,CAAC;YAC7C,MAAM,aAAa,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,cAAc,CACvD,WAAW,CAAC,CAAC,CAAC,CAAC,QAAwB,CACvC,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAwB,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;SACjF;KACD;IACD,yEAAyE;IACzE,wDAAwD;IACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QACxC,IAAI,CAAC,KAAK,CAAC,EAAE;YACZ,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzD;KACD;IACD,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,sEAAsE;IACtE,mEAAmE;IACnE,KAAK,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,YAAY,EAAE;QACzC,IAAI,OAAO,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,EAAE;YACjD,mBAAmB,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAwB,EAAE,EAAE,CAAC,CAAC,CAAC;SACjE;aAAM;YACN,OAAO,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC;YAC/B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5C,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC;SACvC;KACD;IAED,iFAAiF;IACjF,MAAM,qBAAqB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACnD,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CACxF,CAAC;IAEF,oCAAoC;IACpC,IAAI,YAAY,GAAG,WAAW,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,qBAAqB,EAAE;QACxC,GAAG,CAAC,cAAc,GAAG,EAAE,YAAY,CAAC;QACpC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;KAC7C;IACD,gEAAgE;IAChE,mDAAmD;IACnD,mCAAgB,CAAC,QAAQ,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;IAEnF,+BAA+B;IAC/B,MAAM,aAAa,GAAgC,EAAE,CAAC;IACtD,mBAAmB,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE;QACtC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,aAAa,CACtC,OAAO,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CACpD,CAAC;QACF,MAAM,CAAC,qBAAqB,GAAG,MAAM,CAAC;QACtC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,qDAAqD;IACrD,MAAM,qBAAqB,GAC1B,aAAa,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QAC7B,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,QAAwB,CAAC,CAAC;QACvF,OAAO,CAAC,OAAO,CAAC,QAAwB,EAAE,aAAa,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IACJ,iDAAiD;IACjD,mCAAgB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,2CAA2C;IAC3C,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE;QACpC,OAAO,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC;QAC/B,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC;KAC5C;IAED,mCAAmC;IACnC,MAAM,4BAA4B,GAAG,qBAAqB,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAC5E,YAAY,CAAC,CAAC,CAAC,CAAC,aAAa,CAC5B,YAAY,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAC/D,CACD,CAAC;IAEF,KAAK,MAAM,sBAAsB,IAAI,4BAA4B,EAAE;QAClE,sBAAsB,CAAC,cAAc,GAAG,EAAE,YAAY,CAAC;QACvD,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC,CAAC;KAChE;IAED,qCAAqC;IACrC,mCAAgB,CAAC,QAAQ,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;IAEzD,OAAO,GAAG,CAAC;AACZ,CAAC;AAOY,QAAA,cAAc,GAA8B;IACxD,SAAS,EAAE,EAAE;IACb,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;IAC5B,gBAAgB,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;IACvC,MAAM,EAAE,CAAC;IACT,UAAU,EAAE,CAAC,wCAAa,EAAE,sCAAW,EAAE,iCAAM,CAAC;IAChD,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,WAAW,GAAG,IAAA,8CAAmB,GAAE,CAAC;AAE1C,SAAS,0BAA0B,CAAC,IAA+B,EAAE,SAAkB;IACtF,IAAA,sCAAW,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE;QACrE,EAAE,CAAC,sBAAsB,WAAW,EAAE,EAAE,KAAK,IAAI,EAAE;YAClD,MAAM,MAAM,GAAG,IAAA,kCAAU,EAAC,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC;YAC9E,MAAM,QAAQ,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;YAC7B,IAAI,SAAS,EAAE;gBACd,QAAQ,CAAC,kBAAkB,KAA3B,QAAQ,CAAC,kBAAkB,GAAK,EAAE,EAAC;gBACnC,QAAQ,CAAC,kBAAkB,IAAI,SAAS,CAAC;aACzC;YAED,MAAM,OAAO,GAAiB,CAAC,IAAI,uBAAU,EAAE,CAAC,CAAC;YACjD,gFAAgF;YAChF,4EAA4E;YAC5E,+EAA+E;YAC/E,mDAAmD;YACnD,IAAI,YAAY,GAAiB,EAAE,CAAC;YAEpC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,YAAY,GAAG,CAAC,IAAI,uBAAU,EAAE,CAAC,CAAC;YAClC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAE7E,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAEjD,kDAAkD;YAClD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;YAC9D,KAAK,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,GAAG,aAAa,EAAE,EAAE,EAAE,EAAE;gBACvD,MAAM,SAAS,GAAG,MAAM,uBAAU,CAAC,wBAAwB,CAC1D,OAAO,CAAC,CAAC,CAAC,EACV,WAAW,CAAC,EAAE,CAAC,CACf,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACxB,uCAAuC;gBACvC,MAAM,gBAAgB,GAAG,MAAM,uBAAU,CAAC,wBAAwB,CACjE,OAAO,CAAC,CAAC,CAAC,EACV,WAAW,CAAC,EAAE,CAAC,CACf,CAAC;gBACF,YAAY,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;aACpC;YAED,GAAG,GAAG,IAAA,sDAA2B,EAChC,MAAM,EACN,GAAG,EACH,OAAO,EACP,IAAI,CAAC,SAAS,EACd,IAAI,EACJ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAA0B,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAC9D,CAAC;QACH,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,IAAA,oCAAY,EAAC,kBAAkB,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE;IAClD,MAAM,IAAI,GAAG,sBAAc,CAAC;IAE5B,IAAI,SAAS,GAAG,CAAC,EAAE;QAClB,IAAA,sCAAW,EACV,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,GAAG,CAAC,EAAE,EAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EACZ,CAAC,IAAI,EAAE,EAAE;YACR,QAAQ,CAAC,aAAa,IAAI,EAAE,EAAE,GAAG,EAAE;gBAClC,0BAA0B,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC,CAAC,CAAC;QACJ,CAAC,CACD,CAAC;KACF;SAAM;QACN,0BAA0B,CAAC,IAAI,CAAC,CAAC;KACjC;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { describeFuzz, makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport { IMergeTreeOp } from \"../ops\";\nimport { SegmentGroup } from \"../mergeTreeNodes\";\nimport {\n\tgenerateClientNames,\n\tdoOverRange,\n\trunMergeTreeOperationRunner,\n\tannotateRange,\n\tremoveRange,\n\tIMergeTreeOperationRunnerConfig,\n\tIConfigRange,\n\tinsert,\n} from \"./mergeTreeOperationRunner\";\nimport { TestClient } from \"./testClient\";\nimport { TestClientLogger } from \"./testClientLogger\";\n\nfunction applyMessagesWithReconnect(\n\tstartingSeq: number,\n\tmessageDatas: [ISequencedDocumentMessage, SegmentGroup | SegmentGroup[]][],\n\tclients: readonly TestClient[],\n\tstashClients: readonly TestClient[],\n) {\n\tlet seq = startingSeq;\n\tconst reconnectClientMsgs: [IMergeTreeOp, SegmentGroup | SegmentGroup[]][] = [];\n\tlet minSeq = 0;\n\n\t// apply ops as stashed ops except for client #1\n\tconst stashedOps: [IMergeTreeOp, SegmentGroup | SegmentGroup[], number][] = [];\n\tfor (const messageData of messageDatas) {\n\t\tif (messageData[0].clientId !== clients[1].longClientId) {\n\t\t\tconst index = clients\n\t\t\t\t.map((c) => c.longClientId)\n\t\t\t\t.indexOf(messageData[0].clientId as string);\n\t\t\tconst localMetadata = stashClients[index].applyStashedOp(\n\t\t\t\tmessageData[0].contents as IMergeTreeOp,\n\t\t\t);\n\t\t\tstashedOps.push([messageData[0].contents as IMergeTreeOp, localMetadata, index]);\n\t\t}\n\t}\n\t// this should put all stash clients (except #1) in the same state as the\n\t// respective normal clients, having local changes only.\n\tfor (let i = 0; i < clients.length; ++i) {\n\t\tif (i !== 1) {\n\t\t\tTestClientLogger.validate([clients[i], stashClients[i]]);\n\t\t}\n\t}\n\tTestClientLogger.validate([clients[0], stashClients[1]]);\n\n\t// apply the ops to the normal clients. they will all be the same now,\n\t// except #1 which has local changes other clients haven't seen yet\n\tfor (const [message, sg] of messageDatas) {\n\t\tif (message.clientId === clients[1].longClientId) {\n\t\t\treconnectClientMsgs.push([message.contents as IMergeTreeOp, sg]);\n\t\t} else {\n\t\t\tmessage.sequenceNumber = ++seq;\n\t\t\tclients.forEach((c) => c.applyMsg(message));\n\t\t\tminSeq = message.minimumSequenceNumber;\n\t\t}\n\t}\n\n\t// regenerate the ops that were applied as stashed ops. this simulates resubmit()\n\tconst regeneratedStashedOps = stashedOps.map((op) =>\n\t\tstashClients[op[2]].makeOpMessage(stashClients[op[2]].regeneratePendingOp(op[0], op[1])),\n\t);\n\n\t// apply the regenerated stashed ops\n\tlet stashedOpSeq = startingSeq;\n\tfor (const msg of regeneratedStashedOps) {\n\t\tmsg.sequenceNumber = ++stashedOpSeq;\n\t\tstashClients.forEach((c) => c.applyMsg(msg));\n\t}\n\t// all stash and normal clients should now be in the same state,\n\t// except #1 (normal) which still has local changes\n\tTestClientLogger.validate([...clients.filter((_, i) => i !== 1), ...stashClients]);\n\n\t// regenerate ops for client #1\n\tconst reconnectMsgs: ISequencedDocumentMessage[] = [];\n\treconnectClientMsgs.forEach((opData) => {\n\t\tconst newMsg = clients[1].makeOpMessage(\n\t\t\tclients[1].regeneratePendingOp(opData[0], opData[1]),\n\t\t);\n\t\tnewMsg.minimumSequenceNumber = minSeq;\n\t\treconnectMsgs.push(newMsg);\n\t});\n\n\t// apply regenerated ops as stashed ops for client #1\n\tconst stashedRegeneratedOps: [IMergeTreeOp, SegmentGroup | SegmentGroup[]][] =\n\t\treconnectMsgs.map((message) => {\n\t\t\tconst localMetadata = stashClients[1].applyStashedOp(message.contents as IMergeTreeOp);\n\t\t\treturn [message.contents as IMergeTreeOp, localMetadata];\n\t\t});\n\t// now both clients at index 1 should be the same\n\tTestClientLogger.validate([clients[1], stashClients[1]]);\n\n\t// apply the regenerated ops from client #1\n\tfor (const message of reconnectMsgs) {\n\t\tmessage.sequenceNumber = ++seq;\n\t\tclients.forEach((c) => c.applyMsg(message));\n\t}\n\n\t// resubmit regenerated stashed ops\n\tconst reRegeneratedStashedMessages = stashedRegeneratedOps.map((stashedOp) =>\n\t\tstashClients[1].makeOpMessage(\n\t\t\tstashClients[1].regeneratePendingOp(stashedOp[0], stashedOp[1]),\n\t\t),\n\t);\n\n\tfor (const reRegeneratedStashedOp of reRegeneratedStashedMessages) {\n\t\treRegeneratedStashedOp.sequenceNumber = ++stashedOpSeq;\n\t\tstashClients.forEach((c) => c.applyMsg(reRegeneratedStashedOp));\n\t}\n\n\t// all clients should now be the same\n\tTestClientLogger.validate([...clients, ...stashClients]);\n\n\treturn seq;\n}\n\ninterface IApplyStashedOpFarmConfig extends IMergeTreeOperationRunnerConfig {\n\tminLength: number;\n\tclients: IConfigRange;\n}\n\nexport const defaultOptions: IApplyStashedOpFarmConfig = {\n\tminLength: 16,\n\tclients: { min: 3, max: 12 },\n\topsPerRoundRange: { min: 40, max: 120 },\n\trounds: 3,\n\toperations: [annotateRange, removeRange, insert],\n\tgrowthFunc: (input: number) => input * 2,\n};\n\n// Generate a list of single character client names, support up to 69 clients\nconst clientNames = generateClientNames();\n\nfunction runApplyStashedOpFarmTests(opts: IApplyStashedOpFarmConfig, extraSeed?: number): void {\n\tdoOverRange(opts.clients, opts.growthFunc.bind(opts), (clientCount) => {\n\t\tit(`applyStashedOpFarm_${clientCount}`, async () => {\n\t\t\tconst random = makeRandom(0xdeadbeef, 0xfeedbed, clientCount, extraSeed ?? 0);\n\t\t\tconst testOpts = { ...opts };\n\t\t\tif (extraSeed) {\n\t\t\t\ttestOpts.resultsFilePostfix ??= \"\";\n\t\t\t\ttestOpts.resultsFilePostfix += extraSeed;\n\t\t\t}\n\n\t\t\tconst clients: TestClient[] = [new TestClient()];\n\t\t\t// This test is based on reconnectFarm, but we keep a second set of clients. For\n\t\t\t// these clients, we apply the generated ops as stashed ops, then regenerate\n\t\t\t// them to simulate resubmit(), then apply them. In the end, they should arrive\n\t\t\t// at the same state as the \"normal\" set of clients\n\t\t\tlet stashClients: TestClient[] = [];\n\n\t\t\tclients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));\n\t\t\tstashClients = [new TestClient()];\n\t\t\tstashClients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));\n\n\t\t\tlet seq = 0;\n\t\t\tclients.forEach((c) => c.updateMinSeq(seq));\n\t\t\tstashClients.forEach((c) => c.updateMinSeq(seq));\n\n\t\t\t// Add double the number of clients each iteration\n\t\t\tconst targetClients = Math.max(opts.clients.min, clientCount);\n\t\t\tfor (let cc = clients.length; cc < targetClients; cc++) {\n\t\t\t\tconst newClient = await TestClient.createFromClientSnapshot(\n\t\t\t\t\tclients[0],\n\t\t\t\t\tclientNames[cc],\n\t\t\t\t);\n\t\t\t\tclients.push(newClient);\n\t\t\t\t// add 1 stash client per normal client\n\t\t\t\tconst anotherNewClient = await TestClient.createFromClientSnapshot(\n\t\t\t\t\tclients[0],\n\t\t\t\t\tclientNames[cc],\n\t\t\t\t);\n\t\t\t\tstashClients.push(anotherNewClient);\n\t\t\t}\n\n\t\t\tseq = runMergeTreeOperationRunner(\n\t\t\t\trandom,\n\t\t\t\tseq,\n\t\t\t\tclients,\n\t\t\t\topts.minLength,\n\t\t\t\topts,\n\t\t\t\t(s, m, c) => applyMessagesWithReconnect(s, m, c, stashClients),\n\t\t\t);\n\t\t}).timeout(30 * 1000);\n\t});\n}\n\ndescribeFuzz(\"MergeTree.Client\", ({ testCount }) => {\n\tconst opts = defaultOptions;\n\n\tif (testCount > 1) {\n\t\tdoOverRange(\n\t\t\t{ min: 0, max: testCount - 1 },\n\t\t\t(x) => x + 1,\n\t\t\t(seed) => {\n\t\t\t\tdescribe(`with seed ${seed}`, () => {\n\t\t\t\t\trunApplyStashedOpFarmTests(opts, seed);\n\t\t\t\t});\n\t\t\t},\n\t\t);\n\t} else {\n\t\trunApplyStashedOpFarmTests(opts);\n\t}\n});\n"]}

package/dist/test/client.attributionFarm.spec.d.ts

@@ -0,0 +1,7 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { TestOperation } from "./mergeTreeOperationRunner";
+export declare const annotateRange: TestOperation;
+//# sourceMappingURL=client.attributionFarm.spec.d.ts.map

package/dist/test/client.attributionFarm.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.attributionFarm.spec.d.ts","sourceRoot":"","sources":["../../src/test/client.attributionFarm.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,EAMN,aAAa,EAGb,MAAM,4BAA4B,CAAC;AAIpC,eAAO,MAAM,aAAa,EAAE,aACoD,CAAC"}

package/dist/test/client.attributionFarm.spec.js

@@ -0,0 +1,96 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.annotateRange = void 0;
+const assert_1 = require("assert");
+const test_pairwise_generator_1 = require("@fluid-private/test-pairwise-generator");
+const stochastic_test_utils_1 = require("@fluid-private/stochastic-test-utils");
+const attributionPolicy_1 = require("../attributionPolicy");
+const mergeTreeOperationRunner_1 = require("./mergeTreeOperationRunner");
+const testClient_1 = require("./testClient");
+const testClientLogger_1 = require("./testClientLogger");
+const annotateRange = (client, opStart, opEnd) => client.annotateRangeLocal(opStart, opEnd, { trackedProp: client.longClientId });
+exports.annotateRange = annotateRange;
+const defaultOptions = {
+    initLen: { min: 2, max: 4 },
+    modLen: { min: 1, max: 8 },
+    opsPerRoundRange: { min: 10, max: 40 },
+    rounds: 10,
+    operations: [mergeTreeOperationRunner_1.removeRange, exports.annotateRange, mergeTreeOperationRunner_1.insert],
+    growthFunc: (input) => input * 2,
+};
+(0, stochastic_test_utils_1.describeFuzz)("MergeTree.Attribution", ({ testCount }) => {
+    // Generate a list of single character client names, support up to 69 clients
+    const clientNames = (0, mergeTreeOperationRunner_1.generateClientNames)();
+    const rangeOptions = (0, mergeTreeOperationRunner_1.resolveRanges)(defaultOptions, defaultOptions.growthFunc);
+    for (let extraSeed = 0; extraSeed < testCount; extraSeed++) {
+        (0, test_pairwise_generator_1.generatePairwiseOptions)(rangeOptions).forEach(({ initLen, modLen, opsPerRoundRange }) => {
+            it(`AttributionFarm_${initLen}_${modLen}_${opsPerRoundRange}`, async () => {
+                const random = (0, stochastic_test_utils_1.makeRandom)(0xdeadbeef, initLen, modLen, extraSeed ?? 0);
+                const clients = new Array(3).fill(0).map(() => new testClient_1.TestClient({
+                    attribution: {
+                        track: true,
+                        policyFactory: (0, attributionPolicy_1.createPropertyTrackingAndInsertionAttributionPolicyFactory)("trackedProp"),
+                    },
+                }));
+                clients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));
+                const getAttributionAtPosition = (client, pos) => {
+                    const { segment, offset } = client.getContainingSegment(pos);
+                    if (segment?.attribution === undefined || offset === undefined) {
+                        return undefined;
+                    }
+                    const { attribution } = segment;
+                    let channels;
+                    const result = {
+                        root: attribution.getAtOffset(offset),
+                    };
+                    for (const name of attribution.channelNames) {
+                        (channels ?? (channels = {}))[name] = attribution.getAtOffset(offset, name);
+                        result.channels = channels;
+                    }
+                    return channels;
+                };
+                const validateAnnotation = (reason, workload) => {
+                    const preWorkload = testClientLogger_1.TestClientLogger.toString(clients);
+                    workload();
+                    const attributions = Array.from({ length: clients[0].getLength() }).map((_, i) => getAttributionAtPosition(clients[0], i));
+                    for (let c = 1; c < clients.length; c++) {
+                        for (let i = 0; i < clients[c].getLength(); i++) {
+                            const attribution0 = attributions[i];
+                            const attributionC = getAttributionAtPosition(clients[c], i);
+                            if (attribution0 !== attributionC) {
+                                assert_1.strict.deepEqual(attribution0, attributionC, `${reason}:\n${preWorkload}\n${testClientLogger_1.TestClientLogger.toString([
+                                    clients[0],
+                                    clients[c],
+                                ])}`);
+                            }
+                        }
+                    }
+                };
+                let seq = 0;
+                validateAnnotation("Initialize", () => {
+                    seq = (0, mergeTreeOperationRunner_1.runMergeTreeOperationRunner)(random, seq, clients, initLen, defaultOptions);
+                });
+                validateAnnotation("After Init Zamboni", () => {
+                    // trigger zamboni multiple times as it is incremental
+                    for (let i = clients[0].getCollabWindow().minSeq; i <= seq; i++) {
+                        clients.forEach((c) => c.updateMinSeq(i));
+                    }
+                });
+                validateAnnotation("After More Ops", () => {
+                    seq = (0, mergeTreeOperationRunner_1.runMergeTreeOperationRunner)(random, seq, clients, modLen, defaultOptions);
+                });
+                validateAnnotation("After Final Zamboni", () => {
+                    // trigger zamboni multiple times as it is incremental
+                    for (let i = clients[0].getCollabWindow().minSeq; i <= seq; i++) {
+                        clients.forEach((c) => c.updateMinSeq(i));
+                    }
+                });
+            });
+        });
+    }
+});
+//# sourceMappingURL=client.attributionFarm.spec.js.map

package/dist/test/client.attributionFarm.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.attributionFarm.spec.js","sourceRoot":"","sources":["../../src/test/client.attributionFarm.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,mCAA0C;AAC1C,oFAAiF;AACjF,gFAAgF;AAEhF,4DAAkG;AAClG,yEASoC;AACpC,6CAA0C;AAC1C,yDAAsD;AAE/C,MAAM,aAAa,GAAkB,CAAC,MAAkB,EAAE,OAAe,EAAE,KAAa,EAAE,EAAE,CAClG,MAAM,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,WAAW,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;AADpE,QAAA,aAAa,iBACuD;AAEjF,MAAM,cAAc,GACnB;IACC,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC3B,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC1B,gBAAgB,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;IACtC,MAAM,EAAE,EAAE;IACV,UAAU,EAAE,CAAC,sCAAW,EAAE,qBAAa,EAAE,iCAAM,CAAC;IAChD,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEH,IAAA,oCAAY,EAAC,uBAAuB,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE;IACvD,6EAA6E;IAC7E,MAAM,WAAW,GAAG,IAAA,8CAAmB,GAAE,CAAC;IAC1C,MAAM,YAAY,GAAG,IAAA,wCAAa,EAAC,cAAc,EAAE,cAAc,CAAC,UAAU,CAAC,CAAC;IAC9E,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,SAAS,EAAE,SAAS,EAAE,EAAE;QAC3D,IAAA,iDAAuB,EAAC,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,EAAE,EAAE;YACvF,EAAE,CAAC,mBAAmB,OAAO,IAAI,MAAM,IAAI,gBAAgB,EAAE,EAAE,KAAK,IAAI,EAAE;gBACzE,MAAM,MAAM,GAAG,IAAA,kCAAU,EAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC;gBAEvE,MAAM,OAAO,GAAiB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CACrD,GAAG,EAAE,CACJ,IAAI,uBAAU,CAAC;oBACd,WAAW,EAAE;wBACZ,KAAK,EAAE,IAAI;wBACX,aAAa,EACZ,IAAA,8EAA0D,EACzD,aAAa,CACb;qBACF;iBACD,CAAC,CACH,CAAC;gBACF,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAExE,MAAM,wBAAwB,GAAG,CAAC,MAAkB,EAAE,GAAW,EAAE,EAAE;oBACpE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;oBAC7D,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;wBAC/D,OAAO,SAAS,CAAC;qBACjB;oBACD,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;oBAChC,IAAI,QAAoE,CAAC;oBACzE,MAAM,MAAM,GAGR;wBACH,IAAI,EAAE,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC;qBACrC,CAAC;oBACF,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,YAAY,EAAE;wBAC5C,CAAC,QAAQ,KAAR,QAAQ,GAAK,EAAE,EAAC,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;wBAChE,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC;qBAC3B;oBACD,OAAO,QAAQ,CAAC;gBACjB,CAAC,CAAC;gBAEF,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAE,QAAoB,EAAE,EAAE;oBACnE,MAAM,WAAW,GAAG,mCAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;oBACvD,QAAQ,EAAE,CAAC;oBACX,MAAM,YAAY,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CACtE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CACjD,CAAC;oBACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,EAAE;4BAChD,MAAM,YAAY,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;4BACrC,MAAM,YAAY,GAAG,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;4BAC7D,IAAI,YAAY,KAAK,YAAY,EAAE;gCAClC,eAAM,CAAC,SAAS,CACf,YAAY,EACZ,YAAY,EACZ,GAAG,MAAM,MAAM,WAAW,KAAK,mCAAgB,CAAC,QAAQ,CAAC;oCACxD,OAAO,CAAC,CAAC,CAAC;oCACV,OAAO,CAAC,CAAC,CAAC;iCACV,CAAC,EAAE,CACJ,CAAC;6BACF;yBACD;qBACD;gBACF,CAAC,CAAC;gBAEF,IAAI,GAAG,GAAG,CAAC,CAAC;gBAEZ,kBAAkB,CAAC,YAAY,EAAE,GAAG,EAAE;oBACrC,GAAG,GAAG,IAAA,sDAA2B,EAChC,MAAM,EACN,GAAG,EACH,OAAO,EACP,OAAO,EACP,cAAc,CACd,CAAC;gBACH,CAAC,CAAC,CAAC;gBAEH,kBAAkB,CAAC,oBAAoB,EAAE,GAAG,EAAE;oBAC7C,sDAAsD;oBACtD,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE;wBAChE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC1C;gBACF,CAAC,CAAC,CAAC;gBAEH,kBAAkB,CAAC,gBAAgB,EAAE,GAAG,EAAE;oBACzC,GAAG,GAAG,IAAA,sDAA2B,EAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,cAAc,CAAC,CAAC;gBACjF,CAAC,CAAC,CAAC;gBAEH,kBAAkB,CAAC,qBAAqB,EAAE,GAAG,EAAE;oBAC9C,sDAAsD;oBACtD,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,eAAe,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,EAAE;wBAChE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC1C;gBACF,CAAC,CAAC,CAAC;YACJ,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;KACH;AACF,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 { generatePairwiseOptions } from \"@fluid-private/test-pairwise-generator\";\nimport { describeFuzz, makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { AttributionKey } from \"@fluidframework/runtime-definitions\";\nimport { createPropertyTrackingAndInsertionAttributionPolicyFactory } from \"../attributionPolicy\";\nimport {\n\tIMergeTreeOperationRunnerConfig,\n\tremoveRange,\n\trunMergeTreeOperationRunner,\n\tgenerateClientNames,\n\tIConfigRange,\n\tTestOperation,\n\tresolveRanges,\n\tinsert,\n} from \"./mergeTreeOperationRunner\";\nimport { TestClient } from \"./testClient\";\nimport { TestClientLogger } from \"./testClientLogger\";\n\nexport const annotateRange: TestOperation = (client: TestClient, opStart: number, opEnd: number) =>\n\tclient.annotateRangeLocal(opStart, opEnd, { trackedProp: client.longClientId });\n\nconst defaultOptions: Record<\"initLen\" | \"modLen\", IConfigRange> & IMergeTreeOperationRunnerConfig =\n\t{\n\t\tinitLen: { min: 2, max: 4 },\n\t\tmodLen: { min: 1, max: 8 },\n\t\topsPerRoundRange: { min: 10, max: 40 },\n\t\trounds: 10,\n\t\toperations: [removeRange, annotateRange, insert],\n\t\tgrowthFunc: (input: number) => input * 2,\n\t};\n\ndescribeFuzz(\"MergeTree.Attribution\", ({ testCount }) => {\n\t// Generate a list of single character client names, support up to 69 clients\n\tconst clientNames = generateClientNames();\n\tconst rangeOptions = resolveRanges(defaultOptions, defaultOptions.growthFunc);\n\tfor (let extraSeed = 0; extraSeed < testCount; extraSeed++) {\n\t\tgeneratePairwiseOptions(rangeOptions).forEach(({ initLen, modLen, opsPerRoundRange }) => {\n\t\t\tit(`AttributionFarm_${initLen}_${modLen}_${opsPerRoundRange}`, async () => {\n\t\t\t\tconst random = makeRandom(0xdeadbeef, initLen, modLen, extraSeed ?? 0);\n\n\t\t\t\tconst clients: TestClient[] = new Array(3).fill(0).map(\n\t\t\t\t\t() =>\n\t\t\t\t\t\tnew TestClient({\n\t\t\t\t\t\t\tattribution: {\n\t\t\t\t\t\t\t\ttrack: true,\n\t\t\t\t\t\t\t\tpolicyFactory:\n\t\t\t\t\t\t\t\t\tcreatePropertyTrackingAndInsertionAttributionPolicyFactory(\n\t\t\t\t\t\t\t\t\t\t\"trackedProp\",\n\t\t\t\t\t\t\t\t\t),\n\t\t\t\t\t\t\t},\n\t\t\t\t\t\t}),\n\t\t\t\t);\n\t\t\t\tclients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));\n\n\t\t\t\tconst getAttributionAtPosition = (client: TestClient, pos: number) => {\n\t\t\t\t\tconst { segment, offset } = client.getContainingSegment(pos);\n\t\t\t\t\tif (segment?.attribution === undefined || offset === undefined) {\n\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t}\n\t\t\t\t\tconst { attribution } = segment;\n\t\t\t\t\tlet channels: { [name: string]: AttributionKey | undefined } | undefined;\n\t\t\t\t\tconst result: {\n\t\t\t\t\t\troot: AttributionKey | undefined;\n\t\t\t\t\t\tchannels?: { [name: string]: AttributionKey | undefined };\n\t\t\t\t\t} = {\n\t\t\t\t\t\troot: attribution.getAtOffset(offset),\n\t\t\t\t\t};\n\t\t\t\t\tfor (const name of attribution.channelNames) {\n\t\t\t\t\t\t(channels ??= {})[name] = attribution.getAtOffset(offset, name);\n\t\t\t\t\t\tresult.channels = channels;\n\t\t\t\t\t}\n\t\t\t\t\treturn channels;\n\t\t\t\t};\n\n\t\t\t\tconst validateAnnotation = (reason: string, workload: () => void) => {\n\t\t\t\t\tconst preWorkload = TestClientLogger.toString(clients);\n\t\t\t\t\tworkload();\n\t\t\t\t\tconst attributions = Array.from({ length: clients[0].getLength() }).map(\n\t\t\t\t\t\t(_, i) => getAttributionAtPosition(clients[0], i),\n\t\t\t\t\t);\n\t\t\t\t\tfor (let c = 1; c < clients.length; c++) {\n\t\t\t\t\t\tfor (let i = 0; i < clients[c].getLength(); i++) {\n\t\t\t\t\t\t\tconst attribution0 = attributions[i];\n\t\t\t\t\t\t\tconst attributionC = getAttributionAtPosition(clients[c], i);\n\t\t\t\t\t\t\tif (attribution0 !== attributionC) {\n\t\t\t\t\t\t\t\tassert.deepEqual(\n\t\t\t\t\t\t\t\t\tattribution0,\n\t\t\t\t\t\t\t\t\tattributionC,\n\t\t\t\t\t\t\t\t\t`${reason}:\\n${preWorkload}\\n${TestClientLogger.toString([\n\t\t\t\t\t\t\t\t\t\tclients[0],\n\t\t\t\t\t\t\t\t\t\tclients[c],\n\t\t\t\t\t\t\t\t\t])}`,\n\t\t\t\t\t\t\t\t);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t};\n\n\t\t\t\tlet seq = 0;\n\n\t\t\t\tvalidateAnnotation(\"Initialize\", () => {\n\t\t\t\t\tseq = runMergeTreeOperationRunner(\n\t\t\t\t\t\trandom,\n\t\t\t\t\t\tseq,\n\t\t\t\t\t\tclients,\n\t\t\t\t\t\tinitLen,\n\t\t\t\t\t\tdefaultOptions,\n\t\t\t\t\t);\n\t\t\t\t});\n\n\t\t\t\tvalidateAnnotation(\"After Init Zamboni\", () => {\n\t\t\t\t\t// trigger zamboni multiple times as it is incremental\n\t\t\t\t\tfor (let i = clients[0].getCollabWindow().minSeq; i <= seq; i++) {\n\t\t\t\t\t\tclients.forEach((c) => c.updateMinSeq(i));\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tvalidateAnnotation(\"After More Ops\", () => {\n\t\t\t\t\tseq = runMergeTreeOperationRunner(random, seq, clients, modLen, defaultOptions);\n\t\t\t\t});\n\n\t\t\t\tvalidateAnnotation(\"After Final Zamboni\", () => {\n\t\t\t\t\t// trigger zamboni multiple times as it is incremental\n\t\t\t\t\tfor (let i = clients[0].getCollabWindow().minSeq; i <= seq; i++) {\n\t\t\t\t\t\tclients.forEach((c) => c.updateMinSeq(i));\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t});\n\t\t});\n\t}\n});\n"]}

package/dist/test/client.conflictFarm.spec.d.ts

@@ -0,0 +1,15 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { IConfigRange, IMergeTreeOperationRunnerConfig } from "./mergeTreeOperationRunner";
+interface IConflictFarmConfig extends IMergeTreeOperationRunnerConfig {
+    minLength: IConfigRange;
+    clients: IConfigRange;
+}
+export declare const debugOptions: IConflictFarmConfig;
+export declare const defaultOptions: IConflictFarmConfig;
+export declare const longOptions: IConflictFarmConfig;
+export declare const stressOptions: IConflictFarmConfig;
+export {};
+//# sourceMappingURL=client.conflictFarm.spec.d.ts.map

package/dist/test/client.conflictFarm.spec.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.conflictFarm.spec.d.ts","sourceRoot":"","sources":["../../src/test/client.conflictFarm.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAGN,YAAY,EACZ,+BAA+B,EAM/B,MAAM,4BAA4B,CAAC;AAGpC,UAAU,mBAAoB,SAAQ,+BAA+B;IACpE,SAAS,EAAE,YAAY,CAAC;IACxB,OAAO,EAAE,YAAY,CAAC;CACtB;AAID,eAAO,MAAM,YAAY,EAAE,mBAQ1B,CAAC;AAEF,eAAO,MAAM,cAAc,EAAE,mBAO5B,CAAC;AAEF,eAAO,MAAM,WAAW,EAAE,mBAOzB,CAAC;AAEF,eAAO,MAAM,aAAa,EAAE,mBAO3B,CAAC"}

package/dist/test/client.conflictFarm.spec.js

@@ -0,0 +1,88 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.stressOptions = exports.longOptions = exports.defaultOptions = exports.debugOptions = void 0;
+const stochastic_test_utils_1 = require("@fluid-private/stochastic-test-utils");
+const mergeTreeOperationRunner_1 = require("./mergeTreeOperationRunner");
+const testClient_1 = require("./testClient");
+const allOperations = [mergeTreeOperationRunner_1.removeRange, mergeTreeOperationRunner_1.annotateRange, mergeTreeOperationRunner_1.insertAtRefPos];
+exports.debugOptions = {
+    minLength: { min: 1, max: 1 },
+    clients: { min: 3, max: 3 },
+    opsPerRoundRange: { min: 1, max: 100 },
+    rounds: 1000,
+    operations: allOperations,
+    incrementalLog: true,
+    growthFunc: (input) => input + 1,
+};
+exports.defaultOptions = {
+    minLength: { min: 1, max: 512 },
+    clients: { min: 1, max: 8 },
+    opsPerRoundRange: { min: 1, max: 128 },
+    rounds: 8,
+    operations: allOperations,
+    growthFunc: (input) => input * 2,
+};
+exports.longOptions = {
+    minLength: { min: 1, max: 512 },
+    clients: { min: 1, max: 32 },
+    opsPerRoundRange: { min: 1, max: 512 },
+    rounds: 32,
+    operations: allOperations,
+    growthFunc: (input) => input * 2,
+};
+exports.stressOptions = {
+    minLength: { min: 1, max: 512 },
+    clients: { min: 1, max: 32 },
+    opsPerRoundRange: { min: 1, max: 128 },
+    rounds: 32,
+    operations: allOperations,
+    growthFunc: (input) => input * 2,
+};
+// Generate a list of single character client names, support up to 69 clients
+const clientNames = (0, mergeTreeOperationRunner_1.generateClientNames)();
+function runConflictFarmTests(opts, extraSeed) {
+    (0, mergeTreeOperationRunner_1.doOverRange)(opts.minLength, opts.growthFunc, (minLength) => {
+        it(`ConflictFarm_${minLength}`, async () => {
+            const random = (0, stochastic_test_utils_1.makeRandom)(0xdeadbeef, 0xfeedbed, minLength, extraSeed ?? 0);
+            const testOpts = { ...opts };
+            if (extraSeed) {
+                testOpts.resultsFilePostfix ?? (testOpts.resultsFilePostfix = "");
+                testOpts.resultsFilePostfix += extraSeed;
+            }
+            const clients = [new testClient_1.TestClient()];
+            clients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));
+            let seq = 0;
+            while (clients.length < opts.clients.max) {
+                clients.forEach((c) => c.updateMinSeq(seq));
+                // Add double the number of clients each iteration
+                const targetClients = Math.max(opts.clients.min, opts.growthFunc(clients.length));
+                for (let cc = clients.length; cc < targetClients; cc++) {
+                    const newClient = await testClient_1.TestClient.createFromClientSnapshot(clients[0], clientNames[cc]);
+                    clients.push(newClient);
+                }
+                seq = (0, mergeTreeOperationRunner_1.runMergeTreeOperationRunner)(random, seq, clients, minLength, opts);
+            }
+        }).timeout(30 * 10000);
+    });
+}
+(0, stochastic_test_utils_1.describeFuzz)("MergeTree.Client", ({ testCount, isStress }) => {
+    const opts = isStress ? exports.stressOptions : exports.defaultOptions;
+    // defaultOptions;
+    // debugOptions;
+    // longOptions;
+    if (testCount > 1) {
+        (0, mergeTreeOperationRunner_1.doOverRange)({ min: 0, max: testCount - 1 }, (x) => x + 1, (seed) => {
+            describe(`with seed ${seed}`, () => {
+                runConflictFarmTests(opts, seed);
+            });
+        });
+    }
+    else {
+        runConflictFarmTests(opts);
+    }
+});
+//# sourceMappingURL=client.conflictFarm.spec.js.map

package/dist/test/client.conflictFarm.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.conflictFarm.spec.js","sourceRoot":"","sources":["../../src/test/client.conflictFarm.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,gFAAgF;AAChF,yEAUoC;AACpC,6CAA0C;AAO1C,MAAM,aAAa,GAAoB,CAAC,sCAAW,EAAE,wCAAa,EAAE,yCAAc,CAAC,CAAC;AAEvE,QAAA,YAAY,GAAwB;IAChD,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC7B,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC3B,gBAAgB,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IACtC,MAAM,EAAE,IAAI;IACZ,UAAU,EAAE,aAAa;IACzB,cAAc,EAAE,IAAI;IACpB,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEW,QAAA,cAAc,GAAwB;IAClD,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IAC/B,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;IAC3B,gBAAgB,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IACtC,MAAM,EAAE,CAAC;IACT,UAAU,EAAE,aAAa;IACzB,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEW,QAAA,WAAW,GAAwB;IAC/C,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IAC/B,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;IAC5B,gBAAgB,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IACtC,MAAM,EAAE,EAAE;IACV,UAAU,EAAE,aAAa;IACzB,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEW,QAAA,aAAa,GAAwB;IACjD,SAAS,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IAC/B,OAAO,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;IAC5B,gBAAgB,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE;IACtC,MAAM,EAAE,EAAE;IACV,UAAU,EAAE,aAAa;IACzB,UAAU,EAAE,CAAC,KAAa,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC;CACxC,CAAC;AAEF,6EAA6E;AAC7E,MAAM,WAAW,GAAG,IAAA,8CAAmB,GAAE,CAAC;AAE1C,SAAS,oBAAoB,CAAC,IAAyB,EAAE,SAAkB;IAC1E,IAAA,sCAAW,EAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,EAAE;QAC1D,EAAE,CAAC,gBAAgB,SAAS,EAAE,EAAE,KAAK,IAAI,EAAE;YAC1C,MAAM,MAAM,GAAG,IAAA,kCAAU,EAAC,UAAU,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,IAAI,CAAC,CAAC,CAAC;YAC5E,MAAM,QAAQ,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;YAC7B,IAAI,SAAS,EAAE;gBACd,QAAQ,CAAC,kBAAkB,KAA3B,QAAQ,CAAC,kBAAkB,GAAK,EAAE,EAAC;gBACnC,QAAQ,CAAC,kBAAkB,IAAI,SAAS,CAAC;aACzC;YAED,MAAM,OAAO,GAAiB,CAAC,IAAI,uBAAU,EAAE,CAAC,CAAC;YACjD,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAExE,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,OAAO,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE;gBACzC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;gBAE5C,kDAAkD;gBAClD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;gBAClF,KAAK,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,GAAG,aAAa,EAAE,EAAE,EAAE,EAAE;oBACvD,MAAM,SAAS,GAAG,MAAM,uBAAU,CAAC,wBAAwB,CAC1D,OAAO,CAAC,CAAC,CAAC,EACV,WAAW,CAAC,EAAE,CAAC,CACf,CAAC;oBACF,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;iBACxB;gBAED,GAAG,GAAG,IAAA,sDAA2B,EAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;aACzE;QACF,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,IAAA,oCAAY,EAAC,kBAAkB,EAAE,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,EAAE,EAAE;IAC5D,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,qBAAa,CAAC,CAAC,CAAC,sBAAc,CAAC;IACvD,kBAAkB;IAClB,gBAAgB;IAChB,eAAe;IAEf,IAAI,SAAS,GAAG,CAAC,EAAE;QAClB,IAAA,sCAAW,EACV,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,SAAS,GAAG,CAAC,EAAE,EAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EACZ,CAAC,IAAI,EAAE,EAAE;YACR,QAAQ,CAAC,aAAa,IAAI,EAAE,EAAE,GAAG,EAAE;gBAClC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;QACJ,CAAC,CACD,CAAC;KACF;SAAM;QACN,oBAAoB,CAAC,IAAI,CAAC,CAAC;KAC3B;AACF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { describeFuzz, makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport {\n\tannotateRange,\n\tdoOverRange,\n\tIConfigRange,\n\tIMergeTreeOperationRunnerConfig,\n\tinsertAtRefPos,\n\tremoveRange,\n\trunMergeTreeOperationRunner,\n\tTestOperation,\n\tgenerateClientNames,\n} from \"./mergeTreeOperationRunner\";\nimport { TestClient } from \"./testClient\";\n\ninterface IConflictFarmConfig extends IMergeTreeOperationRunnerConfig {\n\tminLength: IConfigRange;\n\tclients: IConfigRange;\n}\n\nconst allOperations: TestOperation[] = [removeRange, annotateRange, insertAtRefPos];\n\nexport const debugOptions: IConflictFarmConfig = {\n\tminLength: { min: 1, max: 1 },\n\tclients: { min: 3, max: 3 },\n\topsPerRoundRange: { min: 1, max: 100 },\n\trounds: 1000,\n\toperations: allOperations,\n\tincrementalLog: true,\n\tgrowthFunc: (input: number) => input + 1,\n};\n\nexport const defaultOptions: IConflictFarmConfig = {\n\tminLength: { min: 1, max: 512 },\n\tclients: { min: 1, max: 8 },\n\topsPerRoundRange: { min: 1, max: 128 },\n\trounds: 8,\n\toperations: allOperations,\n\tgrowthFunc: (input: number) => input * 2,\n};\n\nexport const longOptions: IConflictFarmConfig = {\n\tminLength: { min: 1, max: 512 },\n\tclients: { min: 1, max: 32 },\n\topsPerRoundRange: { min: 1, max: 512 },\n\trounds: 32,\n\toperations: allOperations,\n\tgrowthFunc: (input: number) => input * 2,\n};\n\nexport const stressOptions: IConflictFarmConfig = {\n\tminLength: { min: 1, max: 512 },\n\tclients: { min: 1, max: 32 },\n\topsPerRoundRange: { min: 1, max: 128 },\n\trounds: 32,\n\toperations: allOperations,\n\tgrowthFunc: (input: number) => input * 2,\n};\n\n// Generate a list of single character client names, support up to 69 clients\nconst clientNames = generateClientNames();\n\nfunction runConflictFarmTests(opts: IConflictFarmConfig, extraSeed?: number): void {\n\tdoOverRange(opts.minLength, opts.growthFunc, (minLength) => {\n\t\tit(`ConflictFarm_${minLength}`, async () => {\n\t\t\tconst random = makeRandom(0xdeadbeef, 0xfeedbed, minLength, extraSeed ?? 0);\n\t\t\tconst testOpts = { ...opts };\n\t\t\tif (extraSeed) {\n\t\t\t\ttestOpts.resultsFilePostfix ??= \"\";\n\t\t\t\ttestOpts.resultsFilePostfix += extraSeed;\n\t\t\t}\n\n\t\t\tconst clients: TestClient[] = [new TestClient()];\n\t\t\tclients.forEach((c, i) => c.startOrUpdateCollaboration(clientNames[i]));\n\n\t\t\tlet seq = 0;\n\t\t\twhile (clients.length < opts.clients.max) {\n\t\t\t\tclients.forEach((c) => c.updateMinSeq(seq));\n\n\t\t\t\t// Add double the number of clients each iteration\n\t\t\t\tconst targetClients = Math.max(opts.clients.min, opts.growthFunc(clients.length));\n\t\t\t\tfor (let cc = clients.length; cc < targetClients; cc++) {\n\t\t\t\t\tconst newClient = await TestClient.createFromClientSnapshot(\n\t\t\t\t\t\tclients[0],\n\t\t\t\t\t\tclientNames[cc],\n\t\t\t\t\t);\n\t\t\t\t\tclients.push(newClient);\n\t\t\t\t}\n\n\t\t\t\tseq = runMergeTreeOperationRunner(random, seq, clients, minLength, opts);\n\t\t\t}\n\t\t}).timeout(30 * 10000);\n\t});\n}\n\ndescribeFuzz(\"MergeTree.Client\", ({ testCount, isStress }) => {\n\tconst opts = isStress ? stressOptions : defaultOptions;\n\t// defaultOptions;\n\t// debugOptions;\n\t// longOptions;\n\n\tif (testCount > 1) {\n\t\tdoOverRange(\n\t\t\t{ min: 0, max: testCount - 1 },\n\t\t\t(x) => x + 1,\n\t\t\t(seed) => {\n\t\t\t\tdescribe(`with seed ${seed}`, () => {\n\t\t\t\t\trunConflictFarmTests(opts, seed);\n\t\t\t\t});\n\t\t\t},\n\t\t);\n\t} else {\n\t\trunConflictFarmTests(opts);\n\t}\n});\n"]}

package/dist/test/client.getPosition.spec.d.ts

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

package/dist/test/client.getPosition.spec.d.ts.map

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

package/dist/test/client.getPosition.spec.js

@@ -0,0 +1,54 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/* eslint-disable @typescript-eslint/no-non-null-assertion */
+Object.defineProperty(exports, "__esModule", { value: true });
+const assert_1 = require("assert");
+const textSegment_1 = require("../textSegment");
+const testClient_1 = require("./testClient");
+describe("client.getPosition", () => {
+    const localUserLongId = "localUser";
+    let client;
+    let segment;
+    const segPos = 4;
+    beforeEach(() => {
+        client = new testClient_1.TestClient();
+        for (const c of "hello world") {
+            client.insertTextLocal(client.getLength(), c);
+        }
+        client.startOrUpdateCollaboration(localUserLongId);
+        const segOff = client.getContainingSegment(segPos);
+        (0, assert_1.strict)(textSegment_1.TextSegment.is(segOff.segment));
+        assert_1.strict.strictEqual(segOff.offset, 0);
+        assert_1.strict.strictEqual(segOff.segment.text, "o");
+        segment = segOff.segment;
+    });
+    it("Existing Segment", () => {
+        const pos = client.getPosition(segment);
+        assert_1.strict.strictEqual(pos, segPos);
+    });
+    it("Deleted Segment", () => {
+        client.removeRangeLocal(segPos, segPos + 1);
+        assert_1.strict.notStrictEqual(segment.removedSeq, undefined);
+        const pos = client.getPosition(segment);
+        assert_1.strict.strictEqual(pos, segPos);
+    });
+    it("Detached Segment", () => {
+        client.applyMsg(client.makeOpMessage(client.removeRangeLocal(segPos, segPos + 1), 1));
+        // do some work and move the client's min seq forward, so zamboni runs
+        for (const c of "hello world") {
+            client.applyMsg(client.makeOpMessage(client.insertTextLocal(client.getLength(), c), client.getCurrentSeq() + 1, client.getCurrentSeq(), undefined, client.getCurrentSeq()));
+        }
+        assert_1.strict.notStrictEqual(segment.removedSeq, undefined);
+        const pos = client.getPosition(segment);
+        assert_1.strict.strictEqual(pos, -1);
+    });
+    it("Moved Segment", () => {
+        client.removeRangeLocal(segPos - 1, segPos);
+        const pos = client.getPosition(segment);
+        assert_1.strict.strictEqual(pos, segPos - 1);
+    });
+});
+//# sourceMappingURL=client.getPosition.spec.js.map

package/dist/test/client.getPosition.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.getPosition.spec.js","sourceRoot":"","sources":["../../src/test/client.getPosition.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;AACH,6DAA6D;;AAE7D,mCAA0C;AAC1C,gDAA6C;AAC7C,6CAA0C;AAE1C,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IACnC,MAAM,eAAe,GAAG,WAAW,CAAC;IACpC,IAAI,MAAkB,CAAC;IACvB,IAAI,OAAoB,CAAC;IACzB,MAAM,MAAM,GAAG,CAAC,CAAC;IACjB,UAAU,CAAC,GAAG,EAAE;QACf,MAAM,GAAG,IAAI,uBAAU,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE;YAC9B,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;SAC9C;QACD,MAAM,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;QAEnD,MAAM,MAAM,GAAG,MAAM,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,yBAAW,CAAC,EAAE,CAAC,MAAM,CAAC,OAAQ,CAAC,CAAC,CAAC;QACxC,eAAM,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACrC,eAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC3B,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACxC,eAAM,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5C,eAAM,CAAC,cAAc,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACrD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACxC,eAAM,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC3B,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACtF,sEAAsE;QACtE,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE;YAC9B,MAAM,CAAC,QAAQ,CACd,MAAM,CAAC,aAAa,CACnB,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EAC7C,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,EAC1B,MAAM,CAAC,aAAa,EAAE,EACtB,SAAS,EACT,MAAM,CAAC,aAAa,EAAE,CACtB,CACD,CAAC;SACF;QACD,eAAM,CAAC,cAAc,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QAErD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACxC,eAAM,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACxB,MAAM,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACxC,eAAM,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IACrC,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/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\nimport { strict as assert } from \"assert\";\nimport { TextSegment } from \"../textSegment\";\nimport { TestClient } from \"./testClient\";\n\ndescribe(\"client.getPosition\", () => {\n\tconst localUserLongId = \"localUser\";\n\tlet client: TestClient;\n\tlet segment: TextSegment;\n\tconst segPos = 4;\n\tbeforeEach(() => {\n\t\tclient = new TestClient();\n\t\tfor (const c of \"hello world\") {\n\t\t\tclient.insertTextLocal(client.getLength(), c);\n\t\t}\n\t\tclient.startOrUpdateCollaboration(localUserLongId);\n\n\t\tconst segOff = client.getContainingSegment(segPos);\n\t\tassert(TextSegment.is(segOff.segment!));\n\t\tassert.strictEqual(segOff.offset, 0);\n\t\tassert.strictEqual(segOff.segment.text, \"o\");\n\t\tsegment = segOff.segment;\n\t});\n\n\tit(\"Existing Segment\", () => {\n\t\tconst pos = client.getPosition(segment);\n\t\tassert.strictEqual(pos, segPos);\n\t});\n\n\tit(\"Deleted Segment\", () => {\n\t\tclient.removeRangeLocal(segPos, segPos + 1);\n\t\tassert.notStrictEqual(segment.removedSeq, undefined);\n\t\tconst pos = client.getPosition(segment);\n\t\tassert.strictEqual(pos, segPos);\n\t});\n\n\tit(\"Detached Segment\", () => {\n\t\tclient.applyMsg(client.makeOpMessage(client.removeRangeLocal(segPos, segPos + 1), 1));\n\t\t// do some work and move the client's min seq forward, so zamboni runs\n\t\tfor (const c of \"hello world\") {\n\t\t\tclient.applyMsg(\n\t\t\t\tclient.makeOpMessage(\n\t\t\t\t\tclient.insertTextLocal(client.getLength(), c),\n\t\t\t\t\tclient.getCurrentSeq() + 1,\n\t\t\t\t\tclient.getCurrentSeq(),\n\t\t\t\t\tundefined,\n\t\t\t\t\tclient.getCurrentSeq(),\n\t\t\t\t),\n\t\t\t);\n\t\t}\n\t\tassert.notStrictEqual(segment.removedSeq, undefined);\n\n\t\tconst pos = client.getPosition(segment);\n\t\tassert.strictEqual(pos, -1);\n\t});\n\n\tit(\"Moved Segment\", () => {\n\t\tclient.removeRangeLocal(segPos - 1, segPos);\n\t\tconst pos = client.getPosition(segment);\n\t\tassert.strictEqual(pos, segPos - 1);\n\t});\n});\n"]}

package/dist/test/client.localReference.spec.d.ts

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

package/dist/test/client.localReference.spec.d.ts.map

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