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

package/dist/test/mergeTreeOperationRunner.js

@@ -0,0 +1,245 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || function (mod) {
+    if (mod && mod.__esModule) return mod;
+    var result = {};
+    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
+    __setModuleDefault(result, mod);
+    return result;
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.applyMessages = exports.generateClientNames = exports.generateOperationMessagesForClients = exports.runMergeTreeOperationRunner = exports.replayResultsPath = exports.doOverRanges = exports.resolveRanges = exports.resolveRange = exports.doOverRange = exports.insert = exports.insertAtRefPos = exports.annotateRange = exports.obliterateRange = exports.removeRange = void 0;
+/* eslint-disable @typescript-eslint/no-non-null-assertion */
+const assert_1 = require("assert");
+const fs = __importStar(require("fs"));
+const ops_1 = require("../ops");
+const textSegment_1 = require("../textSegment");
+const mergeTreeNodes_1 = require("../mergeTreeNodes");
+const mergeTreeNodeWalk_1 = require("../mergeTreeNodeWalk");
+const testClientLogger_1 = require("./testClientLogger");
+const removeRange = (client, opStart, opEnd) => client.removeRangeLocal(opStart, opEnd);
+exports.removeRange = removeRange;
+const obliterateRange = (client, opStart, opEnd) => client.obliterateRangeLocal(opStart, opEnd);
+exports.obliterateRange = obliterateRange;
+const annotateRange = (client, opStart, opEnd) => client.annotateRangeLocal(opStart, opEnd, { client: client.longClientId });
+exports.annotateRange = annotateRange;
+const insertAtRefPos = (client, opStart, opEnd, random) => {
+    const segs = [];
+    // gather all the segments at the pos, including removed segments
+    (0, mergeTreeNodeWalk_1.walkAllChildSegments)(client.mergeTree.root, (seg) => {
+        const pos = client.getPosition(seg);
+        if (pos >= opStart) {
+            if (pos <= opStart) {
+                segs.push(seg);
+                return true;
+            }
+            return false;
+        }
+        return true;
+    });
+    if (segs.length > 0) {
+        const text = client.longClientId.repeat(random.integer(1, 3));
+        const seg = random.pick(segs);
+        const lref = client.createLocalReferencePosition(seg, (0, mergeTreeNodes_1.toRemovalInfo)(seg) ? 0 : random.integer(0, seg.cachedLength - 1), (0, mergeTreeNodes_1.toRemovalInfo)(seg)
+            ? ops_1.ReferenceType.SlideOnRemove
+            : random.pick([
+                ops_1.ReferenceType.Simple,
+                ops_1.ReferenceType.SlideOnRemove,
+                ops_1.ReferenceType.Transient,
+            ]), undefined);
+        return client.insertAtReferencePositionLocal(lref, textSegment_1.TextSegment.make(text));
+    }
+};
+exports.insertAtRefPos = insertAtRefPos;
+const insert = (client, _start, _end, random) => {
+    // Note: the _start param is generated using exclusive range. This provides more coverage by allowing
+    // insertion at the end.
+    const start = random.integer(0, client.getLength());
+    const text = client.longClientId.repeat(random.integer(1, 3));
+    return client.insertTextLocal(start, text);
+};
+exports.insert = insert;
+function doOverRange(range, defaultGrowthFunc, doAction) {
+    let lastCurrent = Number.NaN;
+    for (let current = range.min; current <= range.max; current = (range.growthFunc ?? defaultGrowthFunc)(current)) {
+        // let growth funcs be simple
+        // especially around 0 and 1
+        // if the value didn't change,
+        // just increment it
+        if (current === lastCurrent) {
+            current++;
+        }
+        if (current <= range.max) {
+            lastCurrent = current;
+            doAction(current);
+        }
+    }
+}
+exports.doOverRange = doOverRange;
+function resolveRange(range, defaultGrowthFunc) {
+    const results = [];
+    doOverRange(range, range.growthFunc ?? defaultGrowthFunc, (num) => {
+        results.push(num);
+    });
+    return results;
+}
+exports.resolveRange = resolveRange;
+function resolveRanges(ranges, defaultGrowthFunc) {
+    return Object.entries(ranges)
+        .filter(([_, value]) => isConfigRange(value))
+        .map(([key, value]) => [key, resolveRange(value, defaultGrowthFunc)])
+        .reduce((prev, [key, resolvedRange]) => {
+        prev[key] = resolvedRange;
+        return prev;
+    }, {});
+}
+exports.resolveRanges = resolveRanges;
+function isConfigRange(t) {
+    return typeof t === "object" && typeof t.min === "number" && typeof t.max === "number";
+}
+function doOverRanges(ranges, doAction) {
+    const rangeEntries = Object.entries(ranges).filter(([_, value]) => isConfigRange(value));
+    const doOverRangesHelper = (selections) => {
+        if (selections.length === rangeEntries.length) {
+            const selectionsObj = {};
+            for (const [key, value] of selections) {
+                selectionsObj[key] = value;
+            }
+            const description = selections.map(([key, value]) => `${key}:${value}`).join("_");
+            doAction(selectionsObj, description);
+        }
+        else {
+            const [key, value] = rangeEntries[selections.length];
+            doOverRange(value, value.growthFunc ?? ranges.growthFunc, (selection) => {
+                selections.push([key, selection]);
+                doOverRangesHelper(selections);
+                selections.pop();
+            });
+        }
+    };
+    doOverRangesHelper([]);
+}
+exports.doOverRanges = doOverRanges;
+exports.replayResultsPath = `${__dirname}/../../src/test/results`;
+function runMergeTreeOperationRunner(random, startingSeq, clients, minLength, config, apply = applyMessages) {
+    let seq = startingSeq;
+    const results = [];
+    doOverRange(config.opsPerRoundRange, config.growthFunc, (opsPerRound) => {
+        if (config.incrementalLog) {
+            console.log(`MinLength: ${minLength} Clients: ${clients.length} Ops: ${opsPerRound} Seq: ${seq}`);
+        }
+        for (let round = 0; round < config.rounds; round++) {
+            const initialText = clients[0].getText();
+            const logger = new testClientLogger_1.TestClientLogger(clients, `Clients: ${clients.length} Ops: ${opsPerRound} Round: ${round}`);
+            const messageData = generateOperationMessagesForClients(random, seq, clients, logger, opsPerRound, minLength, config.operations);
+            const msgs = messageData.map((md) => md[0]);
+            seq = apply(seq, messageData, clients, logger, random);
+            const resultText = logger.validate();
+            results.push({
+                initialText,
+                resultText,
+                msgs,
+                seq,
+            });
+            logger.dispose();
+        }
+    });
+    if (config.resultsFilePostfix !== undefined) {
+        const resultsFilePath = `${exports.replayResultsPath}/len_${minLength}-clients_${clients.length}-${config.resultsFilePostfix}`;
+        fs.writeFileSync(resultsFilePath, JSON.stringify(results, undefined, 4));
+    }
+    return seq;
+}
+exports.runMergeTreeOperationRunner = runMergeTreeOperationRunner;
+function generateOperationMessagesForClients(random, startingSeq, clients, logger, opsPerRound, minLength, operations) {
+    const minimumSequenceNumber = startingSeq;
+    let tempSeq = startingSeq * -1;
+    const messages = [];
+    for (let i = 0; i < opsPerRound; i++) {
+        // pick a client greater than 0, client 0 only applies remote ops
+        // and is our baseline
+        const client = clients[random.integer(1, clients.length - 1)];
+        const len = client.getLength();
+        const sg = client.peekPendingSegmentGroups();
+        let op;
+        if (len === 0 || len < minLength) {
+            const text = client.longClientId.repeat(random.integer(1, 3));
+            op = client.insertTextLocal(random.integer(0, len), text);
+        }
+        else {
+            let opIndex = random.integer(0, operations.length - 1);
+            const start = random.integer(0, len - 1);
+            const end = random.integer(start + 1, len);
+            for (let y = 0; y < operations.length && op === undefined; y++) {
+                op = operations[opIndex](client, start, end, random);
+                opIndex++;
+                opIndex %= operations.length;
+            }
+        }
+        if (op !== undefined) {
+            // Pre-check to avoid logger.toString() in the string template
+            if (sg === client.peekPendingSegmentGroups()) {
+                assert_1.strict.notEqual(sg, client.peekPendingSegmentGroups(), `op created but segment group not enqueued.${logger}`);
+            }
+            const message = client.makeOpMessage(op, --tempSeq);
+            message.minimumSequenceNumber = minimumSequenceNumber;
+            messages.push([
+                message,
+                client.peekPendingSegmentGroups(op.type === ops_1.MergeTreeDeltaType.GROUP ? op.ops.length : 1),
+            ]);
+        }
+    }
+    return messages;
+}
+exports.generateOperationMessagesForClients = generateOperationMessagesForClients;
+function generateClientNames() {
+    const clientNames = [];
+    function addClientNames(startChar, count) {
+        const startCode = startChar.charCodeAt(0);
+        for (let i = 0; i < count; i++) {
+            clientNames.push(String.fromCharCode(startCode + i));
+        }
+    }
+    addClientNames("A", 26);
+    addClientNames("a", 26);
+    addClientNames("0", 17);
+    return clientNames;
+}
+exports.generateClientNames = generateClientNames;
+function applyMessages(startingSeq, messageData, clients, logger) {
+    let seq = startingSeq;
+    try {
+        // log and apply all the ops created in the round
+        // eslint-disable-next-line @typescript-eslint/prefer-for-of
+        for (let i = 0; i < messageData.length; i++) {
+            const [message] = messageData[i];
+            message.sequenceNumber = ++seq;
+            clients.forEach((c) => c.applyMsg(message));
+        }
+    }
+    catch (e) {
+        throw logger.addLogsToError(e);
+    }
+    return seq;
+}
+exports.applyMessages = applyMessages;
+//# sourceMappingURL=mergeTreeOperationRunner.js.map

package/dist/test/mergeTreeOperationRunner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeTreeOperationRunner.js","sourceRoot":"","sources":["../../src/test/mergeTreeOperationRunner.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,6DAA6D;AAE7D,mCAA0C;AAC1C,uCAAyB;AAGzB,gCAAyE;AACzE,gDAA6C;AAC7C,sDAA0E;AAC1E,4DAA4D;AAE5D,yDAAsD;AAS/C,MAAM,WAAW,GAAkB,CAAC,MAAkB,EAAE,OAAe,EAAE,KAAa,EAAE,EAAE,CAChG,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AAD5B,QAAA,WAAW,eACiB;AAElC,MAAM,eAAe,GAAkB,CAC7C,MAAkB,EAClB,OAAe,EACf,KAAa,EACZ,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;AAJpC,QAAA,eAAe,mBAIqB;AAE1C,MAAM,aAAa,GAAkB,CAAC,MAAkB,EAAE,OAAe,EAAE,KAAa,EAAE,EAAE,CAClG,MAAM,CAAC,kBAAkB,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;AAD/D,QAAA,aAAa,iBACkD;AAErE,MAAM,cAAc,GAAkB,CAC5C,MAAkB,EAClB,OAAe,EACf,KAAa,EACb,MAAe,EACd,EAAE;IACH,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,iEAAiE;IACjE,IAAA,wCAAoB,EAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE;QACnD,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,GAAG,IAAI,OAAO,EAAE;YACnB,IAAI,GAAG,IAAI,OAAO,EAAE;gBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,OAAO,IAAI,CAAC;aACZ;YACD,OAAO,KAAK,CAAC;SACb;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC,CAAC;IACH,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;QACpB,MAAM,IAAI,GAAG,MAAM,CAAC,YAAa,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,4BAA4B,CAC/C,GAAG,EACH,IAAA,8BAAa,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,EAChE,IAAA,8BAAa,EAAC,GAAG,CAAC;YACjB,CAAC,CAAC,mBAAa,CAAC,aAAa;YAC7B,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;gBACZ,mBAAa,CAAC,MAAM;gBACpB,mBAAa,CAAC,aAAa;gBAC3B,mBAAa,CAAC,SAAS;aACtB,CAAC,EACL,SAAS,CACT,CAAC;QAEF,OAAO,MAAM,CAAC,8BAA8B,CAAC,IAAI,EAAE,yBAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;KAC3E;AACF,CAAC,CAAC;AArCW,QAAA,cAAc,kBAqCzB;AAEK,MAAM,MAAM,GAAkB,CACpC,MAAkB,EAClB,MAAc,EACd,IAAY,EACZ,MAAe,EACd,EAAE;IACH,qGAAqG;IACrG,wBAAwB;IACxB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,MAAM,CAAC,YAAa,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AAC5C,CAAC,CAAC;AAXW,QAAA,MAAM,UAWjB;AAQF,SAAgB,WAAW,CAC1B,KAAmB,EACnB,iBAA4C,EAC5C,QAAmC;IAEnC,IAAI,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC;IAC7B,KACC,IAAI,OAAO,GAAG,KAAK,CAAC,GAAG,EACvB,OAAO,IAAI,KAAK,CAAC,GAAG,EACpB,OAAO,GAAG,CAAC,KAAK,CAAC,UAAU,IAAI,iBAAiB,CAAC,CAAC,OAAO,CAAC,EACzD;QACD,6BAA6B;QAC7B,4BAA4B;QAC5B,8BAA8B;QAC9B,oBAAoB;QACpB,IAAI,OAAO,KAAK,WAAW,EAAE;YAC5B,OAAO,EAAE,CAAC;SACV;QACD,IAAI,OAAO,IAAI,KAAK,CAAC,GAAG,EAAE;YACzB,WAAW,GAAG,OAAO,CAAC;YACtB,QAAQ,CAAC,OAAO,CAAC,CAAC;SAClB;KACD;AACF,CAAC;AAvBD,kCAuBC;AAED,SAAgB,YAAY,CAC3B,KAAmB,EACnB,iBAA4C;IAE5C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,IAAI,iBAAiB,EAAE,CAAC,GAAG,EAAE,EAAE;QACjE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC;AAChB,CAAC;AATD,oCASC;AAED,SAAgB,aAAa,CAC5B,MAAS,EACT,iBAA4C;IAE5C,OAAO,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;SAC3B,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC5C,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,YAAY,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAU,CAAC;SAC7E,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,aAAa,CAAC,EAAE,EAAE;QACtC,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC;QAC1B,OAAO,IAAI,CAAC;IACb,CAAC,EAAE,EAAE,CAAsB,CAAC;AAC9B,CAAC;AAXD,sCAWC;AAED,SAAS,aAAa,CAAC,CAAM;IAC5B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,IAAI,OAAO,CAAC,CAAC,GAAG,KAAK,QAAQ,CAAC;AACxF,CAAC;AAkBD,SAAgB,YAAY,CAC3B,MAAS,EACT,QAAqE;IAErE,MAAM,YAAY,GAA6B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAC3F,aAAa,CAAC,KAAK,CAAC,CACpB,CAAC;IAEF,MAAM,kBAAkB,GAAG,CAAC,UAA8B,EAAE,EAAE;QAC7D,IAAI,UAAU,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM,EAAE;YAC9C,MAAM,aAAa,GAAG,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE;gBACtC,aAAa,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;aAC3B;YACD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClF,QAAQ,CAAC,aAAkC,EAAE,WAAW,CAAC,CAAC;SAC1D;aAAM;YACN,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,YAAY,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YACrD,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,EAAE;gBACvE,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC;gBAClC,kBAAkB,CAAC,UAAU,CAAC,CAAC;gBAC/B,UAAU,CAAC,GAAG,EAAE,CAAC;YAClB,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC;IAEF,kBAAkB,CAAC,EAAE,CAAC,CAAC;AACxB,CAAC;AA3BD,oCA2BC;AAkBY,QAAA,iBAAiB,GAAG,GAAG,SAAS,yBAAyB,CAAC;AAEvE,SAAgB,2BAA2B,CAC1C,MAAe,EACf,WAAmB,EACnB,OAA8B,EAC9B,SAAiB,EACjB,MAAuC,EACvC,QAAyB,aAAa;IAEtC,IAAI,GAAG,GAAG,WAAW,CAAC;IACtB,MAAM,OAAO,GAAkB,EAAE,CAAC;IAElC,WAAW,CAAC,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,WAAW,EAAE,EAAE;QACvE,IAAI,MAAM,CAAC,cAAc,EAAE;YAC1B,OAAO,CAAC,GAAG,CACV,cAAc,SAAS,aAAa,OAAO,CAAC,MAAM,SAAS,WAAW,SAAS,GAAG,EAAE,CACpF,CAAC;SACF;QACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;YACnD,MAAM,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,IAAI,mCAAgB,CAClC,OAAO,EACP,YAAY,OAAO,CAAC,MAAM,SAAS,WAAW,WAAW,KAAK,EAAE,CAChE,CAAC;YACF,MAAM,WAAW,GAAG,mCAAmC,CACtD,MAAM,EACN,GAAG,EACH,OAAO,EACP,MAAM,EACN,WAAW,EACX,SAAS,EACT,MAAM,CAAC,UAAU,CACjB,CAAC;YACF,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,WAAW,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvD,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YACrC,OAAO,CAAC,IAAI,CAAC;gBACZ,WAAW;gBACX,UAAU;gBACV,IAAI;gBACJ,GAAG;aACH,CAAC,CAAC;YACH,MAAM,CAAC,OAAO,EAAE,CAAC;SACjB;IACF,CAAC,CAAC,CAAC;IAEH,IAAI,MAAM,CAAC,kBAAkB,KAAK,SAAS,EAAE;QAC5C,MAAM,eAAe,GAAG,GAAG,yBAAiB,QAAQ,SAAS,YAAY,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC,kBAAkB,EAAE,CAAC;QACvH,EAAE,CAAC,aAAa,CAAC,eAAe,EAAE,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;KACzE;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAnDD,kEAmDC;AAED,SAAgB,mCAAmC,CAClD,MAAe,EACf,WAAmB,EACnB,OAA8B,EAC9B,MAAwB,EACxB,WAAmB,EACnB,SAAiB,EACjB,UAAoC;IAEpC,MAAM,qBAAqB,GAAG,WAAW,CAAC;IAC1C,IAAI,OAAO,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAiE,EAAE,CAAC;IAElF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE;QACrC,iEAAiE;QACjE,sBAAsB;QACtB,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,GAAG,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,MAAM,CAAC,wBAAwB,EAAE,CAAC;QAC7C,IAAI,EAA4B,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,GAAG,SAAS,EAAE;YACjC,MAAM,IAAI,GAAG,MAAM,CAAC,YAAa,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/D,EAAE,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;SAC1D;aAAM;YACN,IAAI,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC,EAAE,EAAE;gBAC/D,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;gBACrD,OAAO,EAAE,CAAC;gBACV,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC;aAC7B;SACD;QACD,IAAI,EAAE,KAAK,SAAS,EAAE;YACrB,8DAA8D;YAC9D,IAAI,EAAE,KAAK,MAAM,CAAC,wBAAwB,EAAE,EAAE;gBAC7C,eAAM,CAAC,QAAQ,CACd,EAAE,EACF,MAAM,CAAC,wBAAwB,EAAE,EACjC,6CAA6C,MAAM,EAAE,CACrD,CAAC;aACF;YACD,MAAM,OAAO,GAAG,MAAM,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;YACpD,OAAO,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;YACtD,QAAQ,CAAC,IAAI,CAAC;gBACb,OAAO;gBACP,MAAM,CAAC,wBAAwB,CAC9B,EAAE,CAAC,IAAI,KAAK,wBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACvD;aACF,CAAC,CAAC;SACH;KACD;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAtDD,kFAsDC;AAED,SAAgB,mBAAmB;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,SAAS,cAAc,CAAC,SAAiB,EAAE,KAAa;QACvD,MAAM,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAC/B,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;SACrD;IACF,CAAC;IAED,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxB,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACxB,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAExB,OAAO,WAAW,CAAC;AACpB,CAAC;AAdD,kDAcC;AAUD,SAAgB,aAAa,CAC5B,WAAmB,EACnB,WAAyE,EACzE,OAA8B,EAC9B,MAAwB;IAExB,IAAI,GAAG,GAAG,WAAW,CAAC;IACtB,IAAI;QACH,iDAAiD;QACjD,4DAA4D;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,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;SAC5C;KACD;IAAC,OAAO,CAAC,EAAE;QACX,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;KAC/B;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAnBD,sCAmBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\nimport { strict as assert } from \"assert\";\nimport * as fs from \"fs\";\nimport { ISequencedDocumentMessage } from \"@fluidframework/protocol-definitions\";\nimport { IRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { IMergeTreeOp, MergeTreeDeltaType, ReferenceType } from \"../ops\";\nimport { TextSegment } from \"../textSegment\";\nimport { ISegment, SegmentGroup, toRemovalInfo } from \"../mergeTreeNodes\";\nimport { walkAllChildSegments } from \"../mergeTreeNodeWalk\";\nimport { TestClient } from \"./testClient\";\nimport { TestClientLogger } from \"./testClientLogger\";\n\nexport type TestOperation = (\n\tclient: TestClient,\n\topStart: number,\n\topEnd: number,\n\trandom: IRandom,\n) => IMergeTreeOp | undefined;\n\nexport const removeRange: TestOperation = (client: TestClient, opStart: number, opEnd: number) =>\n\tclient.removeRangeLocal(opStart, opEnd);\n\nexport const obliterateRange: TestOperation = (\n\tclient: TestClient,\n\topStart: number,\n\topEnd: number,\n) => client.obliterateRangeLocal(opStart, opEnd);\n\nexport const annotateRange: TestOperation = (client: TestClient, opStart: number, opEnd: number) =>\n\tclient.annotateRangeLocal(opStart, opEnd, { client: client.longClientId });\n\nexport const insertAtRefPos: TestOperation = (\n\tclient: TestClient,\n\topStart: number,\n\topEnd: number,\n\trandom: IRandom,\n) => {\n\tconst segs: ISegment[] = [];\n\t// gather all the segments at the pos, including removed segments\n\twalkAllChildSegments(client.mergeTree.root, (seg) => {\n\t\tconst pos = client.getPosition(seg);\n\t\tif (pos >= opStart) {\n\t\t\tif (pos <= opStart) {\n\t\t\t\tsegs.push(seg);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t});\n\tif (segs.length > 0) {\n\t\tconst text = client.longClientId!.repeat(random.integer(1, 3));\n\t\tconst seg = random.pick(segs);\n\t\tconst lref = client.createLocalReferencePosition(\n\t\t\tseg,\n\t\t\ttoRemovalInfo(seg) ? 0 : random.integer(0, seg.cachedLength - 1),\n\t\t\ttoRemovalInfo(seg)\n\t\t\t\t? ReferenceType.SlideOnRemove\n\t\t\t\t: random.pick([\n\t\t\t\t\t\tReferenceType.Simple,\n\t\t\t\t\t\tReferenceType.SlideOnRemove,\n\t\t\t\t\t\tReferenceType.Transient,\n\t\t\t\t  ]),\n\t\t\tundefined,\n\t\t);\n\n\t\treturn client.insertAtReferencePositionLocal(lref, TextSegment.make(text));\n\t}\n};\n\nexport const insert: TestOperation = (\n\tclient: TestClient,\n\t_start: number,\n\t_end: number,\n\trandom: IRandom,\n) => {\n\t// Note: the _start param is generated using exclusive range. This provides more coverage by allowing\n\t// insertion at the end.\n\tconst start = random.integer(0, client.getLength());\n\tconst text = client.longClientId!.repeat(random.integer(1, 3));\n\treturn client.insertTextLocal(start, text);\n};\n\nexport interface IConfigRange {\n\tmin: number;\n\tmax: number;\n\tgrowthFunc?: (input: number) => number;\n}\n\nexport function doOverRange(\n\trange: IConfigRange,\n\tdefaultGrowthFunc: (input: number) => number,\n\tdoAction: (current: number) => void,\n) {\n\tlet lastCurrent = Number.NaN;\n\tfor (\n\t\tlet current = range.min;\n\t\tcurrent <= range.max;\n\t\tcurrent = (range.growthFunc ?? defaultGrowthFunc)(current)\n\t) {\n\t\t// let growth funcs be simple\n\t\t// especially around 0 and 1\n\t\t// if the value didn't change,\n\t\t// just increment it\n\t\tif (current === lastCurrent) {\n\t\t\tcurrent++;\n\t\t}\n\t\tif (current <= range.max) {\n\t\t\tlastCurrent = current;\n\t\t\tdoAction(current);\n\t\t}\n\t}\n}\n\nexport function resolveRange(\n\trange: IConfigRange,\n\tdefaultGrowthFunc: (input: number) => number,\n): number[] {\n\tconst results: number[] = [];\n\tdoOverRange(range, range.growthFunc ?? defaultGrowthFunc, (num) => {\n\t\tresults.push(num);\n\t});\n\treturn results;\n}\n\nexport function resolveRanges<T extends object>(\n\tranges: T,\n\tdefaultGrowthFunc: (input: number) => number,\n): ResolvedRanges<T> {\n\treturn Object.entries(ranges)\n\t\t.filter(([_, value]) => isConfigRange(value))\n\t\t.map(([key, value]) => [key, resolveRange(value, defaultGrowthFunc)] as const)\n\t\t.reduce((prev, [key, resolvedRange]) => {\n\t\t\tprev[key] = resolvedRange;\n\t\t\treturn prev;\n\t\t}, {}) as ResolvedRanges<T>;\n}\n\nfunction isConfigRange(t: any): t is IConfigRange {\n\treturn typeof t === \"object\" && typeof t.min === \"number\" && typeof t.max === \"number\";\n}\n\ntype ReplaceRangeWith<T, TReplace> = T extends { min: number; max: number } ? TReplace : never;\n\ntype RangePropertyNames<T> = { [K in keyof T]-?: T[K] extends IConfigRange ? K : never }[keyof T];\n\ntype PickFromRanges<T> = {\n\t[K in RangePropertyNames<T>]: ReplaceRangeWith<T[K], number>;\n};\n\ntype ResolvedRanges<T> = {\n\t[K in RangePropertyNames<T>]: ReplaceRangeWith<T[K], number[]>;\n};\n\ninterface ProvidesGrowthFunc {\n\tgrowthFunc: (input: number) => number;\n}\n\nexport function doOverRanges<T extends ProvidesGrowthFunc>(\n\tranges: T,\n\tdoAction: (selection: PickFromRanges<T>, description: string) => void,\n) {\n\tconst rangeEntries: [string, IConfigRange][] = Object.entries(ranges).filter(([_, value]) =>\n\t\tisConfigRange(value),\n\t);\n\n\tconst doOverRangesHelper = (selections: [string, number][]) => {\n\t\tif (selections.length === rangeEntries.length) {\n\t\t\tconst selectionsObj = {};\n\t\t\tfor (const [key, value] of selections) {\n\t\t\t\tselectionsObj[key] = value;\n\t\t\t}\n\t\t\tconst description = selections.map(([key, value]) => `${key}:${value}`).join(\"_\");\n\t\t\tdoAction(selectionsObj as PickFromRanges<T>, description);\n\t\t} else {\n\t\t\tconst [key, value] = rangeEntries[selections.length];\n\t\t\tdoOverRange(value, value.growthFunc ?? ranges.growthFunc, (selection) => {\n\t\t\t\tselections.push([key, selection]);\n\t\t\t\tdoOverRangesHelper(selections);\n\t\t\t\tselections.pop();\n\t\t\t});\n\t\t}\n\t};\n\n\tdoOverRangesHelper([]);\n}\n\nexport interface IMergeTreeOperationRunnerConfig {\n\treadonly rounds: number;\n\treadonly opsPerRoundRange: IConfigRange;\n\treadonly incrementalLog?: boolean;\n\treadonly operations: readonly TestOperation[];\n\tgrowthFunc(input: number): number;\n\tresultsFilePostfix?: string;\n}\n\nexport interface ReplayGroup {\n\tmsgs: ISequencedDocumentMessage[];\n\tinitialText: string;\n\tresultText: string;\n\tseq: number;\n}\n\nexport const replayResultsPath = `${__dirname}/../../src/test/results`;\n\nexport function runMergeTreeOperationRunner(\n\trandom: IRandom,\n\tstartingSeq: number,\n\tclients: readonly TestClient[],\n\tminLength: number,\n\tconfig: IMergeTreeOperationRunnerConfig,\n\tapply: ApplyMessagesFn = applyMessages,\n) {\n\tlet seq = startingSeq;\n\tconst results: ReplayGroup[] = [];\n\n\tdoOverRange(config.opsPerRoundRange, config.growthFunc, (opsPerRound) => {\n\t\tif (config.incrementalLog) {\n\t\t\tconsole.log(\n\t\t\t\t`MinLength: ${minLength} Clients: ${clients.length} Ops: ${opsPerRound} Seq: ${seq}`,\n\t\t\t);\n\t\t}\n\t\tfor (let round = 0; round < config.rounds; round++) {\n\t\t\tconst initialText = clients[0].getText();\n\t\t\tconst logger = new TestClientLogger(\n\t\t\t\tclients,\n\t\t\t\t`Clients: ${clients.length} Ops: ${opsPerRound} Round: ${round}`,\n\t\t\t);\n\t\t\tconst messageData = generateOperationMessagesForClients(\n\t\t\t\trandom,\n\t\t\t\tseq,\n\t\t\t\tclients,\n\t\t\t\tlogger,\n\t\t\t\topsPerRound,\n\t\t\t\tminLength,\n\t\t\t\tconfig.operations,\n\t\t\t);\n\t\t\tconst msgs = messageData.map((md) => md[0]);\n\t\t\tseq = apply(seq, messageData, clients, logger, random);\n\t\t\tconst resultText = logger.validate();\n\t\t\tresults.push({\n\t\t\t\tinitialText,\n\t\t\t\tresultText,\n\t\t\t\tmsgs,\n\t\t\t\tseq,\n\t\t\t});\n\t\t\tlogger.dispose();\n\t\t}\n\t});\n\n\tif (config.resultsFilePostfix !== undefined) {\n\t\tconst resultsFilePath = `${replayResultsPath}/len_${minLength}-clients_${clients.length}-${config.resultsFilePostfix}`;\n\t\tfs.writeFileSync(resultsFilePath, JSON.stringify(results, undefined, 4));\n\t}\n\n\treturn seq;\n}\n\nexport function generateOperationMessagesForClients(\n\trandom: IRandom,\n\tstartingSeq: number,\n\tclients: readonly TestClient[],\n\tlogger: TestClientLogger,\n\topsPerRound: number,\n\tminLength: number,\n\toperations: readonly TestOperation[],\n) {\n\tconst minimumSequenceNumber = startingSeq;\n\tlet tempSeq = startingSeq * -1;\n\tconst messages: [ISequencedDocumentMessage, SegmentGroup | SegmentGroup[]][] = [];\n\n\tfor (let i = 0; i < opsPerRound; i++) {\n\t\t// pick a client greater than 0, client 0 only applies remote ops\n\t\t// and is our baseline\n\t\tconst client = clients[random.integer(1, clients.length - 1)];\n\t\tconst len = client.getLength();\n\t\tconst sg = client.peekPendingSegmentGroups();\n\t\tlet op: IMergeTreeOp | undefined;\n\t\tif (len === 0 || len < minLength) {\n\t\t\tconst text = client.longClientId!.repeat(random.integer(1, 3));\n\t\t\top = client.insertTextLocal(random.integer(0, len), text);\n\t\t} else {\n\t\t\tlet opIndex = random.integer(0, operations.length - 1);\n\t\t\tconst start = random.integer(0, len - 1);\n\t\t\tconst end = random.integer(start + 1, len);\n\n\t\t\tfor (let y = 0; y < operations.length && op === undefined; y++) {\n\t\t\t\top = operations[opIndex](client, start, end, random);\n\t\t\t\topIndex++;\n\t\t\t\topIndex %= operations.length;\n\t\t\t}\n\t\t}\n\t\tif (op !== undefined) {\n\t\t\t// Pre-check to avoid logger.toString() in the string template\n\t\t\tif (sg === client.peekPendingSegmentGroups()) {\n\t\t\t\tassert.notEqual(\n\t\t\t\t\tsg,\n\t\t\t\t\tclient.peekPendingSegmentGroups(),\n\t\t\t\t\t`op created but segment group not enqueued.${logger}`,\n\t\t\t\t);\n\t\t\t}\n\t\t\tconst message = client.makeOpMessage(op, --tempSeq);\n\t\t\tmessage.minimumSequenceNumber = minimumSequenceNumber;\n\t\t\tmessages.push([\n\t\t\t\tmessage,\n\t\t\t\tclient.peekPendingSegmentGroups(\n\t\t\t\t\top.type === MergeTreeDeltaType.GROUP ? op.ops.length : 1,\n\t\t\t\t)!,\n\t\t\t]);\n\t\t}\n\t}\n\treturn messages;\n}\n\nexport function generateClientNames(): string[] {\n\tconst clientNames: string[] = [];\n\tfunction addClientNames(startChar: string, count: number) {\n\t\tconst startCode = startChar.charCodeAt(0);\n\t\tfor (let i = 0; i < count; i++) {\n\t\t\tclientNames.push(String.fromCharCode(startCode + i));\n\t\t}\n\t}\n\n\taddClientNames(\"A\", 26);\n\taddClientNames(\"a\", 26);\n\taddClientNames(\"0\", 17);\n\n\treturn clientNames;\n}\n\ntype ApplyMessagesFn = (\n\tstartingSeq: number,\n\tmessageData: [ISequencedDocumentMessage, SegmentGroup | SegmentGroup[]][],\n\tclients: readonly TestClient[],\n\tlogger: TestClientLogger,\n\trandom: IRandom,\n) => number;\n\nexport function applyMessages(\n\tstartingSeq: number,\n\tmessageData: [ISequencedDocumentMessage, SegmentGroup | SegmentGroup[]][],\n\tclients: readonly TestClient[],\n\tlogger: TestClientLogger,\n) {\n\tlet seq = startingSeq;\n\ttry {\n\t\t// log and apply all the ops created in the round\n\t\t// eslint-disable-next-line @typescript-eslint/prefer-for-of\n\t\tfor (let i = 0; i < messageData.length; i++) {\n\t\t\tconst [message] = messageData[i];\n\t\t\tmessage.sequenceNumber = ++seq;\n\t\t\tclients.forEach((c) => c.applyMsg(message));\n\t\t}\n\t} catch (e) {\n\t\tthrow logger.addLogsToError(e);\n\t}\n\treturn seq;\n}\n"]}

package/dist/test/mergeTreeOperationRunner.spec.d.ts

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

package/dist/test/mergeTreeOperationRunner.spec.d.ts.map

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

package/dist/test/mergeTreeOperationRunner.spec.js

@@ -0,0 +1,156 @@
+"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 mergeTreeOperationRunner_1 = require("./mergeTreeOperationRunner");
+describe("MergeTreeOperationRunner combinatorial utils", () => {
+    const constant = (i) => i;
+    const plusOne = (i) => i + 1;
+    const plusTwo = (i) => i + 2;
+    const timesTwo = (i) => i * 2;
+    const oneRangeTestCases = [
+        {
+            // worth testing this as baking the policy into doOverRange helps avoid
+            // bugs with less obvious cases like growthFunc: i => i * 2 and a value of 0.
+            name: "with constant growthFunc",
+            range: {
+                min: 1,
+                max: 5,
+            },
+            defaultGrowthFunc: constant,
+            expected: [1, 2, 3, 4, 5],
+        },
+        {
+            name: "with single element",
+            range: {
+                min: 1,
+                max: 1,
+            },
+            defaultGrowthFunc: plusOne,
+            expected: [1],
+        },
+        {
+            name: "over negative numbers",
+            range: {
+                min: -2,
+                max: 2,
+            },
+            defaultGrowthFunc: plusTwo,
+            expected: [-2, 0, 2],
+        },
+        {
+            name: "with simple growthFunc",
+            range: {
+                min: 0,
+                max: 8,
+            },
+            defaultGrowthFunc: timesTwo,
+            expected: [0, 1, 2, 4, 8],
+        },
+        {
+            name: "overrides defaultGrowthFunc with config range's growthFunc",
+            range: {
+                min: 1,
+                max: 4,
+                growthFunc: timesTwo,
+            },
+            defaultGrowthFunc: plusOne,
+            expected: [1, 2, 4],
+        },
+    ];
+    describe("doOverRange", () => {
+        for (const { name, range, defaultGrowthFunc, expected } of oneRangeTestCases) {
+            it(name, () => {
+                const actual = [];
+                (0, mergeTreeOperationRunner_1.doOverRange)(range, defaultGrowthFunc, (i) => actual.push(i));
+                assert_1.strict.deepEqual(actual, expected);
+            });
+        }
+    });
+    describe("resolveRange", () => {
+        for (const { name, range, defaultGrowthFunc, expected } of oneRangeTestCases) {
+            it(name, () => {
+                assert_1.strict.deepEqual((0, mergeTreeOperationRunner_1.resolveRange)(range, defaultGrowthFunc), expected);
+            });
+        }
+    });
+    describe("doOverRanges", () => {
+        const doOverRangesCases = [
+            {
+                name: "with no ranges",
+                ranges: { a: 1, growthFunc: constant },
+                expected: [{}],
+            },
+            {
+                name: "with single property range",
+                ranges: { a: { min: 1, max: 2 }, growthFunc: plusOne },
+                expected: [{ a: 1 }, { a: 2 }],
+            },
+            {
+                name: "with single property range and a property without a range",
+                ranges: { a: { min: 1, max: 2 }, b: 3, growthFunc: plusOne },
+                expected: [{ a: 1 }, { a: 2 }],
+            },
+            {
+                name: "with multiple property ranges",
+                ranges: {
+                    a: { min: 1, max: 5, growthFunc: timesTwo },
+                    b: { min: 3, max: 4 },
+                    growthFunc: plusOne,
+                },
+                expected: [
+                    { a: 1, b: 3 },
+                    { a: 1, b: 4 },
+                    { a: 2, b: 3 },
+                    { a: 2, b: 4 },
+                    { a: 4, b: 3 },
+                    { a: 4, b: 4 },
+                ],
+            },
+        ];
+        for (const { name, ranges, expected } of doOverRangesCases) {
+            it(name, () => {
+                const actual = [];
+                (0, mergeTreeOperationRunner_1.doOverRanges)(ranges, (i) => actual.push(i));
+                assert_1.strict.deepEqual(actual, expected);
+            });
+        }
+    });
+    describe("resolveRanges", () => {
+        const resolveRangesCases = [
+            {
+                name: "with no ranges",
+                ranges: { a: 1, growthFunc: constant },
+                expected: {},
+            },
+            {
+                name: "with single property range",
+                ranges: { a: { min: 1, max: 2 }, growthFunc: plusOne },
+                expected: { a: [1, 2] },
+            },
+            {
+                name: "with single property range and a property without a range",
+                ranges: { a: { min: 1, max: 2 }, b: 3, growthFunc: plusOne },
+                expected: { a: [1, 2] },
+            },
+            {
+                name: "with multiple property ranges",
+                ranges: {
+                    a: { min: 1, max: 5, growthFunc: timesTwo },
+                    b: { min: 3, max: 4 },
+                    growthFunc: plusOne,
+                },
+                expected: { a: [1, 2, 4], b: [3, 4] },
+            },
+        ];
+        for (const { name, ranges, expected } of resolveRangesCases) {
+            it(name, () => {
+                assert_1.strict.deepEqual((0, mergeTreeOperationRunner_1.resolveRanges)(ranges, ranges.growthFunc), expected);
+            });
+        }
+    });
+});
+//# sourceMappingURL=mergeTreeOperationRunner.spec.js.map

package/dist/test/mergeTreeOperationRunner.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeTreeOperationRunner.spec.js","sourceRoot":"","sources":["../../src/test/mergeTreeOperationRunner.spec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;AAEH,mCAA0C;AAC1C,yEAMoC;AAEpC,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC7D,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACrC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAEtC,MAAM,iBAAiB,GAKjB;QACL;YACC,uEAAuE;YACvE,6EAA6E;YAC7E,IAAI,EAAE,0BAA0B;YAChC,KAAK,EAAE;gBACN,GAAG,EAAE,CAAC;gBACN,GAAG,EAAE,CAAC;aACN;YACD,iBAAiB,EAAE,QAAQ;YAC3B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB;QACD;YACC,IAAI,EAAE,qBAAqB;YAC3B,KAAK,EAAE;gBACN,GAAG,EAAE,CAAC;gBACN,GAAG,EAAE,CAAC;aACN;YACD,iBAAiB,EAAE,OAAO;YAC1B,QAAQ,EAAE,CAAC,CAAC,CAAC;SACb;QACD;YACC,IAAI,EAAE,uBAAuB;YAC7B,KAAK,EAAE;gBACN,GAAG,EAAE,CAAC,CAAC;gBACP,GAAG,EAAE,CAAC;aACN;YACD,iBAAiB,EAAE,OAAO;YAC1B,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACpB;QACD;YACC,IAAI,EAAE,wBAAwB;YAC9B,KAAK,EAAE;gBACN,GAAG,EAAE,CAAC;gBACN,GAAG,EAAE,CAAC;aACN;YACD,iBAAiB,EAAE,QAAQ;YAC3B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACzB;QACD;YACC,IAAI,EAAE,4DAA4D;YAClE,KAAK,EAAE;gBACN,GAAG,EAAE,CAAC;gBACN,GAAG,EAAE,CAAC;gBACN,UAAU,EAAE,QAAQ;aACpB;YACD,iBAAiB,EAAE,OAAO;YAC1B,QAAQ,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;SACnB;KACD,CAAC;IAEF,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,QAAQ,EAAE,IAAI,iBAAiB,EAAE;YAC7E,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,MAAM,GAAa,EAAE,CAAC;gBAC5B,IAAA,sCAAW,EAAC,KAAK,EAAE,iBAAiB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC7D,eAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,iBAAiB,EAAE,QAAQ,EAAE,IAAI,iBAAiB,EAAE;YAC7E,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,eAAM,CAAC,SAAS,CAAC,IAAA,uCAAY,EAAC,KAAK,EAAE,iBAAiB,CAAC,EAAE,QAAQ,CAAC,CAAC;YACpE,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC7B,MAAM,iBAAiB,GAAqD;YAC3E;gBACC,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;gBACtC,QAAQ,EAAE,CAAC,EAAE,CAAC;aACd;YACD;gBACC,IAAI,EAAE,4BAA4B;gBAClC,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE;gBACtD,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;aAC9B;YACD;gBACC,IAAI,EAAE,2DAA2D;gBACjE,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE;gBAC5D,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;aAC9B;YACD;gBACC,IAAI,EAAE,+BAA+B;gBACrC,MAAM,EAAE;oBACP,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;oBAC3C,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBACrB,UAAU,EAAE,OAAO;iBACnB;gBACD,QAAQ,EAAE;oBACT,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBACd,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;iBACd;aACD;SACD,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,iBAAiB,EAAE;YAC3D,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,MAAM,GAAU,EAAE,CAAC;gBACzB,IAAA,uCAAY,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5C,eAAM,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YACpC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,MAAM,kBAAkB,GAAmD;YAC1E;gBACC,IAAI,EAAE,gBAAgB;gBACtB,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;gBACtC,QAAQ,EAAE,EAAE;aACZ;YACD;gBACC,IAAI,EAAE,4BAA4B;gBAClC,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,UAAU,EAAE,OAAO,EAAE;gBACtD,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aACvB;YACD;gBACC,IAAI,EAAE,2DAA2D;gBACjE,MAAM,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,EAAE,OAAO,EAAE;gBAC5D,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aACvB;YACD;gBACC,IAAI,EAAE,+BAA+B;gBACrC,MAAM,EAAE;oBACP,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE;oBAC3C,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBACrB,UAAU,EAAE,OAAO;iBACnB;gBACD,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;aACrC;SACD,CAAC;QAEF,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,kBAAkB,EAAE;YAC5D,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,eAAM,CAAC,SAAS,CAAC,IAAA,wCAAa,EAAC,MAAM,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC;YACtE,CAAC,CAAC,CAAC;SACH;IACF,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 {\n\tIConfigRange,\n\tdoOverRange,\n\tdoOverRanges,\n\tresolveRange,\n\tresolveRanges,\n} from \"./mergeTreeOperationRunner\";\n\ndescribe(\"MergeTreeOperationRunner combinatorial utils\", () => {\n\tconst constant = (i: number) => i;\n\tconst plusOne = (i: number) => i + 1;\n\tconst plusTwo = (i: number) => i + 2;\n\tconst timesTwo = (i: number) => i * 2;\n\n\tconst oneRangeTestCases: {\n\t\tname: string;\n\t\trange: IConfigRange;\n\t\tdefaultGrowthFunc: (i: number) => number;\n\t\texpected: number[];\n\t}[] = [\n\t\t{\n\t\t\t// worth testing this as baking the policy into doOverRange helps avoid\n\t\t\t// bugs with less obvious cases like growthFunc: i => i * 2 and a value of 0.\n\t\t\tname: \"with constant growthFunc\",\n\t\t\trange: {\n\t\t\t\tmin: 1,\n\t\t\t\tmax: 5,\n\t\t\t},\n\t\t\tdefaultGrowthFunc: constant,\n\t\t\texpected: [1, 2, 3, 4, 5],\n\t\t},\n\t\t{\n\t\t\tname: \"with single element\",\n\t\t\trange: {\n\t\t\t\tmin: 1,\n\t\t\t\tmax: 1,\n\t\t\t},\n\t\t\tdefaultGrowthFunc: plusOne,\n\t\t\texpected: [1],\n\t\t},\n\t\t{\n\t\t\tname: \"over negative numbers\",\n\t\t\trange: {\n\t\t\t\tmin: -2,\n\t\t\t\tmax: 2,\n\t\t\t},\n\t\t\tdefaultGrowthFunc: plusTwo,\n\t\t\texpected: [-2, 0, 2],\n\t\t},\n\t\t{\n\t\t\tname: \"with simple growthFunc\",\n\t\t\trange: {\n\t\t\t\tmin: 0,\n\t\t\t\tmax: 8,\n\t\t\t},\n\t\t\tdefaultGrowthFunc: timesTwo,\n\t\t\texpected: [0, 1, 2, 4, 8],\n\t\t},\n\t\t{\n\t\t\tname: \"overrides defaultGrowthFunc with config range's growthFunc\",\n\t\t\trange: {\n\t\t\t\tmin: 1,\n\t\t\t\tmax: 4,\n\t\t\t\tgrowthFunc: timesTwo,\n\t\t\t},\n\t\t\tdefaultGrowthFunc: plusOne,\n\t\t\texpected: [1, 2, 4],\n\t\t},\n\t];\n\n\tdescribe(\"doOverRange\", () => {\n\t\tfor (const { name, range, defaultGrowthFunc, expected } of oneRangeTestCases) {\n\t\t\tit(name, () => {\n\t\t\t\tconst actual: number[] = [];\n\t\t\t\tdoOverRange(range, defaultGrowthFunc, (i) => actual.push(i));\n\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"resolveRange\", () => {\n\t\tfor (const { name, range, defaultGrowthFunc, expected } of oneRangeTestCases) {\n\t\t\tit(name, () => {\n\t\t\t\tassert.deepEqual(resolveRange(range, defaultGrowthFunc), expected);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"doOverRanges\", () => {\n\t\tconst doOverRangesCases: { name: string; ranges: any; expected: any[] }[] = [\n\t\t\t{\n\t\t\t\tname: \"with no ranges\",\n\t\t\t\tranges: { a: 1, growthFunc: constant },\n\t\t\t\texpected: [{}],\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with single property range\",\n\t\t\t\tranges: { a: { min: 1, max: 2 }, growthFunc: plusOne },\n\t\t\t\texpected: [{ a: 1 }, { a: 2 }],\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with single property range and a property without a range\",\n\t\t\t\tranges: { a: { min: 1, max: 2 }, b: 3, growthFunc: plusOne },\n\t\t\t\texpected: [{ a: 1 }, { a: 2 }],\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with multiple property ranges\",\n\t\t\t\tranges: {\n\t\t\t\t\ta: { min: 1, max: 5, growthFunc: timesTwo },\n\t\t\t\t\tb: { min: 3, max: 4 },\n\t\t\t\t\tgrowthFunc: plusOne,\n\t\t\t\t},\n\t\t\t\texpected: [\n\t\t\t\t\t{ a: 1, b: 3 },\n\t\t\t\t\t{ a: 1, b: 4 },\n\t\t\t\t\t{ a: 2, b: 3 },\n\t\t\t\t\t{ a: 2, b: 4 },\n\t\t\t\t\t{ a: 4, b: 3 },\n\t\t\t\t\t{ a: 4, b: 4 },\n\t\t\t\t],\n\t\t\t},\n\t\t];\n\n\t\tfor (const { name, ranges, expected } of doOverRangesCases) {\n\t\t\tit(name, () => {\n\t\t\t\tconst actual: any[] = [];\n\t\t\t\tdoOverRanges(ranges, (i) => actual.push(i));\n\t\t\t\tassert.deepEqual(actual, expected);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"resolveRanges\", () => {\n\t\tconst resolveRangesCases: { name: string; ranges: any; expected: any }[] = [\n\t\t\t{\n\t\t\t\tname: \"with no ranges\",\n\t\t\t\tranges: { a: 1, growthFunc: constant },\n\t\t\t\texpected: {},\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with single property range\",\n\t\t\t\tranges: { a: { min: 1, max: 2 }, growthFunc: plusOne },\n\t\t\t\texpected: { a: [1, 2] },\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with single property range and a property without a range\",\n\t\t\t\tranges: { a: { min: 1, max: 2 }, b: 3, growthFunc: plusOne },\n\t\t\t\texpected: { a: [1, 2] },\n\t\t\t},\n\t\t\t{\n\t\t\t\tname: \"with multiple property ranges\",\n\t\t\t\tranges: {\n\t\t\t\t\ta: { min: 1, max: 5, growthFunc: timesTwo },\n\t\t\t\t\tb: { min: 3, max: 4 },\n\t\t\t\t\tgrowthFunc: plusOne,\n\t\t\t\t},\n\t\t\t\texpected: { a: [1, 2, 4], b: [3, 4] },\n\t\t\t},\n\t\t];\n\n\t\tfor (const { name, ranges, expected } of resolveRangesCases) {\n\t\t\tit(name, () => {\n\t\t\t\tassert.deepEqual(resolveRanges(ranges, ranges.growthFunc), expected);\n\t\t\t});\n\t\t}\n\t});\n});\n"]}

package/dist/test/obliterate.concurrent.spec.d.ts

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

package/dist/test/obliterate.concurrent.spec.d.ts.map

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