@fluid-experimental/tree 0.58.2002 → 0.59.1000

package/lib/test/utilities/IdCompressorTestUtilities.js

@@ -0,0 +1,528 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/* eslint-disable no-bitwise */
+import { v5 } from 'uuid';
+import Prando from 'prando';
+import { expect } from 'chai';
+import { assert, assertNotUndefined, fail, getOrCreate } from '../../Common';
+import { IdCompressor, isLocalId } from '../../id-compressor/IdCompressor';
+import { assertIsStableId, createSessionId, ensureSessionUuid, numericUuidFromStableId, stableIdFromNumericUuid, } from '../../id-compressor/NumericUuid';
+import { getIds } from '../../id-compressor/IdRange';
+/** Identifies a compressor in a network */
+export var Client;
+(function (Client) {
+    Client["Client1"] = "Client1";
+    Client["Client2"] = "Client2";
+    Client["Client3"] = "Client3";
+})(Client || (Client = {}));
+/** Identifies a compressor with respect to a specific operation */
+export var SemanticClient;
+(function (SemanticClient) {
+    SemanticClient["LocalClient"] = "LocalClient";
+})(SemanticClient || (SemanticClient = {}));
+/** Identifies categories of compressors */
+export var MetaClient;
+(function (MetaClient) {
+    MetaClient["All"] = "All";
+})(MetaClient || (MetaClient = {}));
+export const OriginatingClient = Object.assign(Object.assign({}, Client), SemanticClient);
+export const DestinationClient = Object.assign(Object.assign({}, Client), MetaClient);
+/**
+ * Creates a new compressor with the supplied cluster capacity.
+ */
+export function createCompressor(client, clusterCapacity = 5, attributionInfo) {
+    const compressor = new IdCompressor(sessionIds.get(client), 1024, attributionInfo);
+    compressor.clusterCapacity = clusterCapacity;
+    return compressor;
+}
+function makeSessionIds() {
+    const stableIds = new Map();
+    const clients = Object.values(Client);
+    for (let i = 0; i < clients.length; i++) {
+        // Place session uuids roughly in the middle of uuid space to increase odds of encountering interesting
+        // orderings in sorted collections
+        const sessionId = ensureSessionUuid(assertIsStableId(`88888888-8888-4888-b${i}88-888888888888`));
+        stableIds.set(clients[i], sessionId);
+    }
+    return stableIds;
+}
+/**
+ * An array of session ID strings corresponding to all non-local `Client` entries.
+ */
+export const sessionIds = makeSessionIds();
+/**
+ * An array of session uuids corresponding to all non-local `Client` entries.
+ */
+export const sessionNumericUuids = new Map([...sessionIds.entries()].map(([client, sessionId]) => {
+    return [client, numericUuidFromStableId(sessionId)];
+}));
+/**
+ * Simulates a network of ID compressors.
+ * Not suitable for performance testing.
+ */
+export class IdCompressorTestNetwork {
+    constructor(initialClusterSize = 5, onIdReceived) {
+        this.initialClusterSize = initialClusterSize;
+        this.onIdReceived = onIdReceived;
+        /** The log of operations seen by the server so far. Append-only. */
+        this.serverOperations = [];
+        const compressors = new Map();
+        const clientProgress = new Map();
+        const clientIds = new Map();
+        const clientSequencedIds = new Map();
+        for (const client of Object.values(Client)) {
+            const compressor = createCompressor(client, initialClusterSize, client);
+            compressors.set(client, compressor);
+            clientProgress.set(client, 0);
+            clientIds.set(client, []);
+            clientSequencedIds.set(client, []);
+        }
+        this.compressors = compressors;
+        this.clientProgress = clientProgress;
+        this.idLogs = clientIds;
+        this.sequencedIdLogs = clientSequencedIds;
+    }
+    /**
+     * Returns an immutable handle to a compressor in the network.
+     */
+    getCompressor(client) {
+        const compressors = this.compressors;
+        const handler = {
+            get(_, property) {
+                const compressor = compressors.get(client);
+                return compressor[property];
+            },
+            set(_, property, value) {
+                const compressor = compressors.get(client);
+                compressor[property] = value;
+                return true;
+            },
+        };
+        return new Proxy({}, handler);
+    }
+    /**
+     * Returns a mutable handle to a compressor in the network. Use of mutation methods will break the network invariants and
+     * should only be used if the network will not be used again.
+     */
+    getCompressorUnsafe(client) {
+        return this.getCompressor(client);
+    }
+    /**
+     * Returns data for all IDs created and received by this client, including ack's of their own (i.e. their own IDs will appear twice)
+     */
+    getIdLog(client) {
+        return this.idLogs.get(client);
+    }
+    /**
+     * Returns data for all IDs received by this client, including ack's of their own (i.e. their own IDs will appear twice)
+     */
+    getSequencedIdLog(client) {
+        return this.sequencedIdLogs.get(client);
+    }
+    /**
+     * Get all compressors for the given destination
+     */
+    getTargetCompressors(clientTo) {
+        return clientTo === MetaClient.All
+            ? [...this.compressors.entries()]
+            : [[clientTo, this.getCompressor(clientTo)]];
+    }
+    /**
+     * Submit a capacity change operation to the network. It will not take effect immediately but will be processed in sequence order.
+     */
+    enqueueCapacityChange(newClusterCapacity) {
+        this.serverOperations.push(newClusterCapacity);
+    }
+    addNewId(client, id, expectedOverride, originatingClient, isSequenced) {
+        var _a;
+        const idData = {
+            id,
+            originatingClient,
+            sessionId: sessionIds.get(originatingClient),
+            sessionNumericUuid: sessionNumericUuids.get(originatingClient),
+            expectedOverride,
+            isSequenced,
+        };
+        const clientIds = this.idLogs.get(client);
+        clientIds.push(idData);
+        if (isSequenced) {
+            const sequencedIds = this.sequencedIdLogs.get(client);
+            sequencedIds.push(idData);
+        }
+        (_a = this.onIdReceived) === null || _a === void 0 ? void 0 : _a.call(this, this, client, clientIds);
+    }
+    allocateAndSendIds(client, numIds, overrides = {}) {
+        assert(numIds > 0, 'Must allocate a non-zero number of IDs');
+        const compressor = this.compressors.get(client);
+        let nextIdIndex = 0;
+        for (const [overrideIndex, uuid] of Object.entries(overrides)
+            .map(([id, uuid]) => [Number.parseInt(id, 10), uuid])
+            .sort(([a], [b]) => a - b)) {
+            while (nextIdIndex < overrideIndex) {
+                this.addNewId(client, compressor.generateCompressedId(), undefined, client, false);
+                nextIdIndex += 1;
+            }
+            this.addNewId(client, compressor.generateCompressedId(uuid), uuid, client, false);
+            nextIdIndex += 1;
+        }
+        const numTrailingIds = numIds - nextIdIndex;
+        let range;
+        if (numTrailingIds > 0) {
+            range = compressor.generateCompressedIdRange(numTrailingIds);
+            const ids = compressor.getIdsFromRange(range, compressor.localSessionId);
+            for (let i = 0; i < numTrailingIds; i++) {
+                this.addNewId(client, ids.get(i), undefined, client, false);
+            }
+        }
+        const creationRange = compressor.takeNextCreationRange();
+        this.serverOperations.push([creationRange, client]);
+        return nextIdIndex === 0 ? { range: range !== null && range !== void 0 ? range : fail(), sessionId: compressor.localSessionId } : creationRange;
+    }
+    /**
+     * Delivers all undelivered ID ranges and cluster capacity changes from the server to the target clients.
+     */
+    deliverOperations(clientTakingDelivery) {
+        var _a;
+        for (const [clientTo, compressorTo] of this.getTargetCompressors(clientTakingDelivery)) {
+            for (let i = this.clientProgress.get(clientTo); i < this.serverOperations.length; i++) {
+                const operation = this.serverOperations[i];
+                if (typeof operation === 'number') {
+                    compressorTo.clusterCapacity = operation;
+                }
+                else {
+                    const [range, clientFrom] = operation;
+                    compressorTo.finalizeCreationRange(range);
+                    const ids = getIds(range);
+                    if (ids !== undefined) {
+                        let overrideIndex = 0;
+                        const overrides = ids.overrides;
+                        for (let id = ids.first; id >= ids.last; id--) {
+                            let override;
+                            if (overrides !== undefined &&
+                                overrideIndex < overrides.length &&
+                                id === overrides[overrideIndex][0]) {
+                                override = overrides[overrideIndex][1];
+                                overrideIndex++;
+                            }
+                            const sessionSpaceId = compressorTo.normalizeToSessionSpace(id, range.sessionId);
+                            this.addNewId(clientTo, sessionSpaceId, override, clientFrom, true);
+                        }
+                        assert(overrideIndex === ((_a = overrides === null || overrides === void 0 ? void 0 : overrides.length) !== null && _a !== void 0 ? _a : 0));
+                    }
+                }
+            }
+            this.clientProgress.set(clientTo, this.serverOperations.length);
+        }
+    }
+    /**
+     * Simulate a client disconnecting (and serializing), then reconnecting (and deserializing)
+     */
+    goOfflineThenResume(client) {
+        const compressor = this.compressors.get(client);
+        const [_, resumedCompressor] = roundtrip(compressor, true);
+        this.compressors.set(client, resumedCompressor);
+    }
+    /**
+     * Ensure general validity of the network state. Useful for calling periodically or at the end of test scenarios.
+     */
+    assertNetworkState() {
+        const sequencedLogs = Object.values(Client).map((client) => [this.compressors.get(client), this.getSequencedIdLog(client)]);
+        const maxLogLength = sequencedLogs.map(([_, data]) => data.length).reduce((p, n) => Math.max(p, n));
+        function getNextLogWithEntryAt(logsIndex, entryIndex) {
+            for (let i = logsIndex; i < sequencedLogs.length; i++) {
+                const log = sequencedLogs[i];
+                if (log[1].length > entryIndex) {
+                    return i;
+                }
+            }
+            return undefined;
+        }
+        const uuids = new Set();
+        const finalIds = new Set();
+        const idIndicesAggregator = new Map();
+        function* getLogIndices(columnIndex) {
+            let current = getNextLogWithEntryAt(0, columnIndex);
+            while (current !== undefined) {
+                const next = getNextLogWithEntryAt(current + 1, columnIndex);
+                const [compressor, log] = sequencedLogs[current];
+                if (next === undefined) {
+                    yield [[compressor, log[columnIndex]]];
+                }
+                else {
+                    const [compressorNext, logNext] = sequencedLogs[next];
+                    yield [
+                        [compressor, log[columnIndex]],
+                        [compressorNext, logNext[columnIndex]],
+                    ];
+                }
+                current = next;
+            }
+        }
+        for (let i = 0; i < maxLogLength; i++) {
+            const creator = [];
+            let originatingClient;
+            let localCount = 0;
+            let rowCount = 0;
+            for (const [current, next] of getLogIndices(i)) {
+                const [compressorA, idDataA] = current;
+                const sessionSpaceIdA = idDataA.id;
+                if (isLocalId(sessionSpaceIdA)) {
+                    localCount += 1;
+                }
+                const idIndex = getOrCreate(idIndicesAggregator, idDataA.originatingClient, () => 0);
+                originatingClient !== null && originatingClient !== void 0 ? originatingClient : (originatingClient = idDataA.originatingClient);
+                assert(idDataA.originatingClient === originatingClient, 'Test infra gave wrong originating client to TestIdData');
+                // Only one client should have this ID as local in its session space, as only one client could have created this ID
+                if (isLocalId(sessionSpaceIdA)) {
+                    localCount++;
+                    expect(idDataA.sessionId).to.equal(this.compressors.get(originatingClient).localSessionId);
+                    expect(creator.length === 0 || creator[creator.length - 1][1] === idDataA.expectedOverride).to.be
+                        .true;
+                    creator.push([originatingClient, idDataA.expectedOverride]);
+                }
+                const uuidASessionSpace = compressorA.decompress(sessionSpaceIdA);
+                if (idDataA.expectedOverride !== undefined) {
+                    expect(uuidASessionSpace).to.equal(idDataA.expectedOverride);
+                }
+                else {
+                    expect(uuidASessionSpace).to.equal(stableIdFromNumericUuid(idDataA.sessionNumericUuid, idIndex));
+                }
+                expect(compressorA.recompress(uuidASessionSpace)).to.equal(sessionSpaceIdA);
+                uuids.add(uuidASessionSpace);
+                const opSpaceIdA = compressorA.normalizeToOpSpace(sessionSpaceIdA);
+                if (isLocalId(opSpaceIdA)) {
+                    expect.fail('IDs should have been finalized.');
+                }
+                // TODO: This cast can be removed on typescript 4.6
+                finalIds.add(opSpaceIdA);
+                const uuidAOpSpace = compressorA.decompress(opSpaceIdA);
+                expect(uuidASessionSpace).to.equal(uuidAOpSpace);
+                if (next !== undefined) {
+                    const [compressorB, idDataB] = next;
+                    const sessionSpaceIdB = idDataB.id;
+                    const uuidBSessionSpace = compressorB.decompress(sessionSpaceIdB);
+                    expect(uuidASessionSpace).to.equal(uuidBSessionSpace);
+                    const opSpaceIdB = compressorB.normalizeToOpSpace(sessionSpaceIdB);
+                    if (opSpaceIdA !== opSpaceIdB) {
+                        compressorB.normalizeToOpSpace(sessionSpaceIdB);
+                        compressorA.normalizeToOpSpace(sessionSpaceIdA);
+                    }
+                    expect(opSpaceIdA).to.equal(opSpaceIdB);
+                    if (isLocalId(opSpaceIdB)) {
+                        fail('IDs should have been finalized.');
+                    }
+                    const uuidBOpSpace = compressorB.decompress(opSpaceIdB);
+                    expect(uuidAOpSpace).to.equal(uuidBOpSpace);
+                }
+                rowCount += 1;
+            }
+            // A local count > 1 indicates that this ID was unified, as more than one client has a local ID for it
+            // in their session space.
+            if (rowCount === this.sequencedIdLogs.size && localCount <= 1) {
+                expect(localCount).to.equal(1);
+                for (const [[compressor, { id, originatingClient }]] of getLogIndices(i)) {
+                    expect(compressor.attributeId(id)).to.equal(originatingClient);
+                }
+            }
+            expect(uuids.size).to.equal(finalIds.size);
+            assert(originatingClient !== undefined);
+            idIndicesAggregator.set(originatingClient, assertNotUndefined(idIndicesAggregator.get(originatingClient)) + 1);
+        }
+        for (const [compressor] of sequencedLogs) {
+            expectSerializes(compressor);
+        }
+    }
+}
+export function roundtrip(compressor, withSession) {
+    if (withSession) {
+        const serialized = compressor.serialize(withSession);
+        return [serialized, IdCompressor.deserialize(serialized)];
+    }
+    const nonLocalSerialized = compressor.serialize(withSession);
+    return [nonLocalSerialized, IdCompressor.deserialize(nonLocalSerialized, createSessionId())];
+}
+/**
+ * Asserts that the supplied compressor correctly roundtrips through serialization/deserialization.
+ */
+export function expectSerializes(compressor) {
+    function expectSerializes(withSession) {
+        let serialized;
+        let deserialized;
+        if (withSession) {
+            [serialized, deserialized] = roundtrip(compressor, true);
+        }
+        else {
+            [serialized, deserialized] = roundtrip(compressor, false);
+        }
+        const chainCount = [];
+        for (let i = 0; i < serialized.sessions.length; i++) {
+            chainCount[i] = 0;
+        }
+        const chainProcessed = [...chainCount];
+        for (const cluster of serialized.clusters) {
+            const [sessionIndex] = cluster;
+            expect(sessionIndex < serialized.sessions.length);
+            chainCount[sessionIndex]++;
+        }
+        for (const cluster of serialized.clusters) {
+            const [sessionIndex, capacity, maybeSize] = cluster;
+            const chainIndex = chainProcessed[sessionIndex];
+            if (chainIndex < chainCount[sessionIndex] - 1) {
+                expect(maybeSize === undefined);
+            }
+            else {
+                expect(maybeSize === undefined || typeof maybeSize !== 'number' || maybeSize < capacity);
+            }
+            chainProcessed[sessionIndex]++;
+        }
+        expect(compressor.equals(deserialized, withSession)).to.be.true;
+        return serialized;
+    }
+    return [
+        expectSerializes(false),
+        expectSerializes(true),
+    ];
+}
+/**
+ * Merges 'from' into 'to', and returns 'to'.
+ */
+export function mergeArrayMaps(to, from) {
+    for (const [key, value] of from.entries()) {
+        const entry = to.get(key);
+        if (entry !== undefined) {
+            entry.push(...value);
+        }
+        else {
+            to.set(key, [...value]);
+        }
+    }
+    return to;
+}
+var Operation;
+(function (Operation) {
+    Operation[Operation["AllocateIds"] = 0] = "AllocateIds";
+    Operation[Operation["DeliverOperations"] = 1] = "DeliverOperations";
+    Operation[Operation["ChangeCapacity"] = 2] = "ChangeCapacity";
+    Operation[Operation["GenerateUnifyingIds"] = 3] = "GenerateUnifyingIds";
+    Operation[Operation["GoOfflineThenResume"] = 4] = "GoOfflineThenResume";
+})(Operation || (Operation = {}));
+/**
+ * Performs random actions on a test network.
+ * @param network the test network to test
+ * @param seed the seed for the random generation of the fuzz actions
+ * @param includeOverrides whether or not the fuzz actions will generate override UUIDs
+ * @param observerClient if provided, this client will never generate local ids
+ * @param synchronizeAtEnd if provided, all client will have all operations delivered from the server at the end of the test
+ * @param numUsages if provided, the number of operations to perform as part of this test. Defaults to 1000.
+ * @param validator if provided, this callback will be invoked periodically during the fuzz test.
+ */
+export function performFuzzActions(network, seed, includeOverrides, observerClient, synchronizeAtEnd = true, numUsages = 1000, maxClusterSize = 25, validator) {
+    const rand = new Prando(seed);
+    const selectableClients = network.getTargetCompressors(MetaClient.All).map(([client]) => client);
+    const activeClients = selectableClients.filter((c) => c !== observerClient);
+    // Ensure that the same UUIDs are generated for the same seed across different calls
+    let uuidNum = 0;
+    const uuidNamespace = 'ece2be2e-f374-4ca8-b034-a0bac2da69da';
+    let clusterSize = network.initialClusterSize;
+    if (clusterSize > maxClusterSize) {
+        network.enqueueCapacityChange(maxClusterSize);
+        clusterSize = maxClusterSize;
+    }
+    const opWeights = [
+        [Operation.ChangeCapacity, 1],
+        [Operation.AllocateIds, 8],
+        [Operation.DeliverOperations, 4],
+        [Operation.GenerateUnifyingIds, 1],
+        [Operation.GoOfflineThenResume, 1],
+    ];
+    const opSums = [];
+    let prevWeight = 0;
+    for (const opWeight of opWeights) {
+        const weight = prevWeight + opWeight[1];
+        opSums.push([opWeight[0], weight]);
+        prevWeight = weight;
+    }
+    for (let i = 0; i < numUsages; i++) {
+        const weightSelected = rand.nextInt(1, prevWeight);
+        let opIndex = 0;
+        while (weightSelected > opSums[opIndex][1]) {
+            opIndex++;
+        }
+        const operation = opWeights[opIndex][0];
+        switch (operation) {
+            case Operation.ChangeCapacity: {
+                clusterSize = Math.min(Math.floor(rand.next(0, 1) ** 2 * maxClusterSize) + 1, maxClusterSize);
+                network.enqueueCapacityChange(clusterSize);
+                break;
+            }
+            case Operation.AllocateIds: {
+                const client = rand.nextArrayItem(activeClients);
+                const maxIdsPerUsage = clusterSize * 2;
+                const numIds = Math.floor(rand.next(0, 1) ** 2 * maxIdsPerUsage) + 1;
+                const overrides = {};
+                if (includeOverrides && /* 25% chance: */ rand.nextInt(0, 3) === 0) {
+                    for (let j = 0; j < numIds; j++) {
+                        if ( /* 33% chance: */rand.nextInt(0, 2) === 0) {
+                            overrides[j] = v5((uuidNum++).toString(), uuidNamespace);
+                        }
+                    }
+                }
+                network.allocateAndSendIds(client, numIds, overrides);
+                break;
+            }
+            case Operation.DeliverOperations: {
+                const client = rand.nextArrayItem([...selectableClients, MetaClient.All]);
+                network.deliverOperations(client);
+                break;
+            }
+            case Operation.GenerateUnifyingIds: {
+                const clientA = rand.nextArrayItem(activeClients);
+                const clientB = rand.nextArrayItem(activeClients.filter((c) => c !== clientA));
+                const uuid = v5((uuidNum++).toString(), uuidNamespace);
+                network.allocateAndSendIds(clientA, 1, { 0: uuid });
+                network.allocateAndSendIds(clientB, 1, { 0: uuid });
+                break;
+            }
+            case Operation.GoOfflineThenResume: {
+                const client = rand.nextArrayItem(activeClients);
+                network.goOfflineThenResume(client);
+                break;
+            }
+            default:
+                throw new Error('Unknown operation.');
+        }
+        if (i !== 0 && i % Math.round(numUsages / 5) === 0) {
+            validator === null || validator === void 0 ? void 0 : validator(network);
+        }
+    }
+    if (synchronizeAtEnd) {
+        network.deliverOperations(DestinationClient.All);
+        validator === null || validator === void 0 ? void 0 : validator(network);
+    }
+}
+/**
+ * Converts the supplied integer to a uuid.
+ */
+export function integerToStableId(num) {
+    const bigintNum = BigInt(num);
+    const upper = bigintNum >> BigInt(74);
+    const middle = (bigintNum & (BigInt(0xfff) << BigInt(62))) >> BigInt(62);
+    const lower = bigintNum & BigInt('0x3fffffffffffffff');
+    const upperString = padToLength(upper.toString(16), '0', 12);
+    const middleString = `4${padToLength(middle.toString(16), '0', 3)}`;
+    const lowerString = padToLength((BigInt('0x8000000000000000') | BigInt(lower)).toString(16), '0', 16);
+    const uuid = upperString + middleString + lowerString;
+    return assertIsStableId(`${uuid.substr(0, 8)}-${uuid.substr(8, 4)}-${uuid.substr(12, 4)}-${uuid.substr(16, 4)}-${uuid.substr(20)}`);
+}
+/**
+ * Pads the strings to a length of 32 with zeroes.
+ */
+export function padToUuidLength(str) {
+    return padToLength(str, '0', 32);
+}
+function padToLength(str, char, length) {
+    return char.repeat(length - str.length) + str;
+}
+//# sourceMappingURL=IdCompressorTestUtilities.js.map

package/lib/test/utilities/IdCompressorTestUtilities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"IdCompressorTestUtilities.js","sourceRoot":"","sources":["../../../src/test/utilities/IdCompressorTestUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAC1B,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAa,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AACxF,OAAO,EAAE,YAAY,EAAqB,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAC9F,OAAO,EACN,gBAAgB,EAChB,eAAe,EACf,iBAAiB,EAEjB,uBAAuB,EACvB,uBAAuB,GACvB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,MAAM,EAAE,MAAM,6BAA6B,CAAC;AAOrD,2CAA2C;AAC3C,MAAM,CAAN,IAAY,MAIX;AAJD,WAAY,MAAM;IACjB,6BAAmB,CAAA;IACnB,6BAAmB,CAAA;IACnB,6BAAmB,CAAA;AACpB,CAAC,EAJW,MAAM,KAAN,MAAM,QAIjB;AAED,mEAAmE;AACnE,MAAM,CAAN,IAAY,cAEX;AAFD,WAAY,cAAc;IACzB,6CAA2B,CAAA;AAC5B,CAAC,EAFW,cAAc,KAAd,cAAc,QAEzB;AAED,2CAA2C;AAC3C,MAAM,CAAN,IAAY,UAEX;AAFD,WAAY,UAAU;IACrB,yBAAW,CAAA;AACZ,CAAC,EAFW,UAAU,KAAV,UAAU,QAErB;AAOD,MAAM,CAAC,MAAM,iBAAiB,mCAAQ,MAAM,GAAK,cAAc,CAAE,CAAC;AAIlE,MAAM,CAAC,MAAM,iBAAiB,mCAAQ,MAAM,GAAK,UAAU,CAAE,CAAC;AAE9D;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC/B,MAAc,EACd,eAAe,GAAG,CAAC,EACnB,eAAiC;IAEjC,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;IACnF,UAAU,CAAC,eAAe,GAAG,eAAe,CAAC;IAC7C,OAAO,UAAU,CAAC;AACnB,CAAC;AAOD,SAAS,cAAc;IACtB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,uGAAuG;QACvG,kCAAkC;QAClC,MAAM,SAAS,GAAG,iBAAiB,CAAC,gBAAgB,CAAC,uBAAuB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QACjG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;KACrC;IACD,OAAO,SAAiC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,EAAE,CAAC;AAE3C;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CACzC,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE;IACrD,OAAO,CAAC,MAAM,EAAE,uBAAuB,CAAC,SAAS,CAAC,CAAC,CAAC;AACrD,CAAC,CAAC,CACwB,CAAC;AAqB5B;;;GAGG;AACH,MAAM,OAAO,uBAAuB;IAYnC,YACiB,qBAAqB,CAAC,EACrB,YAA8F;QAD/F,uBAAkB,GAAlB,kBAAkB,CAAI;QACrB,iBAAY,GAAZ,YAAY,CAAkF;QAXhH,oEAAoE;QACnD,qBAAgB,GAA8D,EAAE,CAAC;QAYjG,MAAM,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;QACpD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;QACjD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAwB,CAAC;QAClD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC3D,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YAC3C,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,EAAE,kBAAkB,EAAE,MAAM,CAAC,CAAC;YACxE,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;YACpC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAC1B,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;SACnC;QACD,IAAI,CAAC,WAAW,GAAG,WAAsC,CAAC;QAC1D,IAAI,CAAC,cAAc,GAAG,cAAmC,CAAC;QAC1D,IAAI,CAAC,MAAM,GAAG,SAAoC,CAAC;QACnD,IAAI,CAAC,eAAe,GAAG,kBAA6C,CAAC;IACtE,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,MAAc;QAClC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACrC,MAAM,OAAO,GAAG;YACf,GAAG,CAAC,CAAC,EAAE,QAAQ;gBACd,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3C,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC;YAC7B,CAAC;YACD,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK;gBACrB,MAAM,UAAU,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC3C,UAAU,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;gBAC7B,OAAO,IAAI,CAAC;YACb,CAAC;SACD,CAAC;QACF,OAAO,IAAI,KAAK,CAAe,EAA6B,EAAE,OAAO,CAAC,CAAC;IACxE,CAAC;IAED;;;OAGG;IACI,mBAAmB,CAAC,MAAc;QACxC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAiB,CAAC;IACnD,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACI,iBAAiB,CAAC,MAAc;QACtC,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACI,oBAAoB,CAAC,QAA2B;QACtD,OAAO,QAAQ,KAAK,UAAU,CAAC,GAAG;YACjC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC;YACjC,CAAC,CAAE,CAAC,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC,CAA8B,CAAC;IAC7E,CAAC;IAED;;OAEG;IACI,qBAAqB,CAAC,kBAA0B;QACtD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;IAChD,CAAC;IAEO,QAAQ,CACf,MAAc,EACd,EAA4B,EAC5B,gBAAoC,EACpC,iBAAyB,EACzB,WAAoB;;QAEpB,MAAM,MAAM,GAAG;YACd,EAAE;YACF,iBAAiB;YACjB,SAAS,EAAE,UAAU,CAAC,GAAG,CAAC,iBAAiB,CAAC;YAC5C,kBAAkB,EAAE,mBAAmB,CAAC,GAAG,CAAC,iBAAiB,CAAC;YAC9D,gBAAgB;YAChB,WAAW;SACX,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC1C,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,IAAI,WAAW,EAAE;YAChB,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtD,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SAC1B;QACD,MAAA,IAAI,CAAC,YAAY,+CAAjB,IAAI,EAAgB,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE;IAC9C,CAAC;IAiBM,kBAAkB,CACxB,MAAc,EACd,MAAc,EACd,YAAyC,EAAE;QAE3C,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,wCAAwC,CAAC,CAAC;QAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC;aAC3D,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,CAAqB,CAAC;aACxE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;YAC5B,OAAO,WAAW,GAAG,aAAa,EAAE;gBACnC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,oBAAoB,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;gBACnF,WAAW,IAAI,CAAC,CAAC;aACjB;YACD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;YAClF,WAAW,IAAI,CAAC,CAAC;SACjB;QACD,MAAM,cAAc,GAAG,MAAM,GAAG,WAAW,CAAC;QAC5C,IAAI,KAA8D,CAAC;QACnE,IAAI,cAAc,GAAG,CAAC,EAAE;YACvB,KAAK,GAAG,UAAU,CAAC,yBAAyB,CAAC,cAAc,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,UAAU,CAAC,cAAc,CAAC,CAAC;YACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;gBACxC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC;aAC5D;SACD;QACD,MAAM,aAAa,GAAG,UAAU,CAAC,qBAAqB,EAAE,CAAC;QACzD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC;QACpD,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,aAAL,KAAK,cAAL,KAAK,GAAI,IAAI,EAAE,EAAE,SAAS,EAAE,UAAU,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC;IAC7G,CAAC;IAED;;OAEG;IACI,iBAAiB,CAAC,oBAAuC;;QAC/D,KAAK,MAAM,CAAC,QAAQ,EAAE,YAAY,CAAC,IAAI,IAAI,CAAC,oBAAoB,CAAC,oBAAoB,CAAC,EAAE;YACvF,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtF,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAC3C,IAAI,OAAO,SAAS,KAAK,QAAQ,EAAE;oBAClC,YAAY,CAAC,eAAe,GAAG,SAAS,CAAC;iBACzC;qBAAM;oBACN,MAAM,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,SAAS,CAAC;oBACtC,YAAY,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;oBAE1C,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC1B,IAAI,GAAG,KAAK,SAAS,EAAE;wBACtB,IAAI,aAAa,GAAG,CAAC,CAAC;wBACtB,MAAM,SAAS,GAAG,GAAG,CAAC,SAAS,CAAC;wBAChC,KAAK,IAAI,EAAE,GAAG,GAAG,CAAC,KAAK,EAAE,EAAE,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE;4BAC9C,IAAI,QAA4B,CAAC;4BACjC,IACC,SAAS,KAAK,SAAS;gCACvB,aAAa,GAAG,SAAS,CAAC,MAAM;gCAChC,EAAE,KAAK,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EACjC;gCACD,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;gCACvC,aAAa,EAAE,CAAC;6BAChB;4BACD,MAAM,cAAc,GAAG,YAAY,CAAC,uBAAuB,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;4BACjF,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;yBACpE;wBACD,MAAM,CAAC,aAAa,KAAK,OAAC,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAE,MAAM,mCAAI,CAAC,CAAC,CAAC,CAAC;qBACnD;iBACD;aACD;YAED,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;SAChE;IACF,CAAC;IAED;;OAEG;IACI,mBAAmB,CAAC,MAAc;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,CAAC,CAAC,EAAE,iBAAiB,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC3D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IACjD,CAAC;IAED;;OAEG;IACI,kBAAkB;QACxB,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAC9C,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAiC,CAC1G,CAAC;QAEF,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAEpG,SAAS,qBAAqB,CAAC,SAAiB,EAAE,UAAkB;YACnE,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtD,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,UAAU,EAAE;oBAC/B,OAAO,CAAC,CAAC;iBACT;aACD;YACD,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC9C,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAkB,CAAC;QAEtD,QAAQ,CAAC,CAAC,aAAa,CACtB,WAAmB;YAOnB,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YACpD,OAAO,OAAO,KAAK,SAAS,EAAE;gBAC7B,MAAM,IAAI,GAAG,qBAAqB,CAAC,OAAO,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;gBAC7D,MAAM,CAAC,UAAU,EAAE,GAAG,CAAC,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,IAAI,KAAK,SAAS,EAAE;oBACvB,MAAM,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;iBACvC;qBAAM;oBACN,MAAM,CAAC,cAAc,EAAE,OAAO,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;oBACtD,MAAM;wBACL,CAAC,UAAU,EAAE,GAAG,CAAC,WAAW,CAAC,CAAC;wBAC9B,CAAC,cAAc,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC;qBACtC,CAAC;iBACF;gBACD,OAAO,GAAG,IAAI,CAAC;aACf;QACF,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,OAAO,GAA2C,EAAE,CAAC;YAC3D,IAAI,iBAAqC,CAAC;YAC1C,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE;gBAC/C,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC;gBACvC,MAAM,eAAe,GAAG,OAAO,CAAC,EAAE,CAAC;gBACnC,IAAI,SAAS,CAAC,eAAe,CAAC,EAAE;oBAC/B,UAAU,IAAI,CAAC,CAAC;iBAChB;gBACD,MAAM,OAAO,GAAG,WAAW,CAAC,mBAAmB,EAAE,OAAO,CAAC,iBAAiB,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrF,iBAAiB,aAAjB,iBAAiB,cAAjB,iBAAiB,IAAjB,iBAAiB,GAAK,OAAO,CAAC,iBAAiB,EAAC;gBAChD,MAAM,CACL,OAAO,CAAC,iBAAiB,KAAK,iBAAiB,EAC/C,wDAAwD,CACxD,CAAC;gBAEF,mHAAmH;gBACnH,IAAI,SAAS,CAAC,eAAe,CAAC,EAAE;oBAC/B,UAAU,EAAE,CAAC;oBACb,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,cAAc,CAAC,CAAC;oBAC3F,MAAM,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE;yBAC/F,IAAI,CAAC;oBACP,OAAO,CAAC,IAAI,CAAC,CAAC,iBAAiB,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC;iBAC5D;gBAED,MAAM,iBAAiB,GAAG,WAAW,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;gBAClE,IAAI,OAAO,CAAC,gBAAgB,KAAK,SAAS,EAAE;oBAC3C,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;iBAC7D;qBAAM;oBACN,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,uBAAuB,CAAC,OAAO,CAAC,kBAAkB,EAAE,OAAO,CAAC,CAAC,CAAC;iBACjG;gBACD,MAAM,CAAC,WAAW,CAAC,UAAU,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;gBAC5E,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;gBAC7B,MAAM,UAAU,GAAG,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;gBACnE,IAAI,SAAS,CAAC,UAAU,CAAC,EAAE;oBAC1B,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;iBAC/C;gBACD,mDAAmD;gBACnD,QAAQ,CAAC,GAAG,CAAC,UAA+B,CAAC,CAAC;gBAC9C,MAAM,YAAY,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBAExD,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;gBAEjD,IAAI,IAAI,KAAK,SAAS,EAAE;oBACvB,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;oBACpC,MAAM,eAAe,GAAG,OAAO,CAAC,EAAE,CAAC;oBAEnC,MAAM,iBAAiB,GAAG,WAAW,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;oBAClE,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;oBACtD,MAAM,UAAU,GAAG,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;oBACnE,IAAI,UAAU,KAAK,UAAU,EAAE;wBAC9B,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;wBAChD,WAAW,CAAC,kBAAkB,CAAC,eAAe,CAAC,CAAC;qBAChD;oBACD,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;oBACxC,IAAI,SAAS,CAAC,UAAU,CAAC,EAAE;wBAC1B,IAAI,CAAC,iCAAiC,CAAC,CAAC;qBACxC;oBACD,MAAM,YAAY,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACxD,MAAM,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;iBAC5C;gBAED,QAAQ,IAAI,CAAC,CAAC;aACd;YAED,sGAAsG;YACtG,0BAA0B;YAC1B,IAAI,QAAQ,KAAK,IAAI,CAAC,eAAe,CAAC,IAAI,IAAI,UAAU,IAAI,CAAC,EAAE;gBAC9D,MAAM,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC/B,KAAK,MAAM,CAAC,CAAC,UAAU,EAAE,EAAE,EAAE,EAAE,iBAAiB,EAAE,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE;oBACzE,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;iBAC/D;aACD;YAED,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC;YACxC,mBAAmB,CAAC,GAAG,CACtB,iBAAiB,EACjB,kBAAkB,CAAC,mBAAmB,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAClE,CAAC;SACF;QAED,KAAK,MAAM,CAAC,UAAU,CAAC,IAAI,aAAa,EAAE;YACzC,gBAAgB,CAAC,UAAU,CAAC,CAAC;SAC7B;IACF,CAAC;CACD;AAkBD,MAAM,UAAU,SAAS,CACxB,UAAgC,EAChC,WAAoB;IAEpB,IAAI,WAAW,EAAE;QAChB,MAAM,UAAU,GAAG,UAAU,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACrD,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC;KAC1D;IAED,MAAM,kBAAkB,GAAG,UAAU,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAC7D,OAAO,CAAC,kBAAkB,EAAE,YAAY,CAAC,WAAW,CAAC,kBAAkB,EAAE,eAAe,EAAE,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC/B,UAAgC;IAEhC,SAAS,gBAAgB,CACxB,WAAoB;QAEpB,IAAI,UAA0F,CAAC;QAC/F,IAAI,YAA0B,CAAC;QAC/B,IAAI,WAAW,EAAE;YAChB,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;SACzD;aAAM;YACN,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,SAAS,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;SAC1D;QACD,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpD,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SAClB;QACD,MAAM,cAAc,GAAa,CAAC,GAAG,UAAU,CAAC,CAAC;QAEjD,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,QAAQ,EAAE;YAC1C,MAAM,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC;YAC/B,MAAM,CAAC,YAAY,GAAG,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YAClD,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;SAC3B;QAED,KAAK,MAAM,OAAO,IAAI,UAAU,CAAC,QAAQ,EAAE;YAC1C,MAAM,CAAC,YAAY,EAAE,QAAQ,EAAE,SAAS,CAAC,GAAG,OAAO,CAAC;YACpD,MAAM,UAAU,GAAG,cAAc,CAAC,YAAY,CAAC,CAAC;YAChD,IAAI,UAAU,GAAG,UAAU,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE;gBAC9C,MAAM,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;aAChC;iBAAM;gBACN,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC;aACzF;YACD,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC;SAC/B;QAED,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QAChE,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,OAAO;QACN,gBAAgB,CAAC,KAAK,CAAwC;QAC9D,gBAAgB,CAAC,IAAI,CAA6C;KAClE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC7B,EAAoC,EACpC,IAAyB;IAEzB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;SACrB;aAAM;YACN,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;SACxB;KACD;IACD,OAAO,EAAE,CAAC;AACX,CAAC;AAED,IAAK,SAMJ;AAND,WAAK,SAAS;IACb,uDAAW,CAAA;IACX,mEAAiB,CAAA;IACjB,6DAAc,CAAA;IACd,uEAAmB,CAAA;IACnB,uEAAmB,CAAA;AACpB,CAAC,EANI,SAAS,KAAT,SAAS,QAMb;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,kBAAkB,CACjC,OAAgC,EAChC,IAAY,EACZ,gBAAyB,EACzB,cAAuB,EACvB,mBAA4B,IAAI,EAChC,SAAS,GAAG,IAAI,EAChB,cAAc,GAAG,EAAE,EACnB,SAAsD;IAEtD,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,iBAAiB,GAAa,OAAO,CAAC,oBAAoB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAC3G,MAAM,aAAa,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC;IAC5E,oFAAoF;IACpF,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,aAAa,GAAG,sCAAsC,CAAC;IAC7D,IAAI,WAAW,GAAW,OAAO,CAAC,kBAAkB,CAAC;IACrD,IAAI,WAAW,GAAG,cAAc,EAAE;QACjC,OAAO,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;QAC9C,WAAW,GAAG,cAAc,CAAC;KAC7B;IAED,MAAM,SAAS,GAA0B;QACxC,CAAC,SAAS,CAAC,cAAc,EAAE,CAAC,CAAC;QAC7B,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;QAC1B,CAAC,SAAS,CAAC,iBAAiB,EAAE,CAAC,CAAC;QAChC,CAAC,SAAS,CAAC,mBAAmB,EAAE,CAAC,CAAC;QAClC,CAAC,SAAS,CAAC,mBAAmB,EAAE,CAAC,CAAC;KAClC,CAAC;IAEF,MAAM,MAAM,GAA0B,EAAE,CAAC;IACzC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;QACjC,MAAM,MAAM,GAAG,UAAU,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;QACnC,UAAU,GAAG,MAAM,CAAC;KACpB;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;QACnC,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QACnD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,cAAc,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;YAC3C,OAAO,EAAE,CAAC;SACV;QACD,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,QAAQ,SAAS,EAAE;YAClB,KAAK,SAAS,CAAC,cAAc,CAAC,CAAC;gBAC9B,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC;gBAC9F,OAAO,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC;gBAC3C,MAAM;aACN;YACD,KAAK,SAAS,CAAC,WAAW,CAAC,CAAC;gBAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;gBACjD,MAAM,cAAc,GAAG,WAAW,GAAG,CAAC,CAAC;gBACvC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;gBACrE,MAAM,SAAS,GAAgC,EAAE,CAAC;gBAClD,IAAI,gBAAgB,IAAI,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;oBACnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;wBAChC,KAAI,iBAAkB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;4BAC/C,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,aAAa,CAAC,CAAC;yBACzD;qBACD;iBACD;gBACD,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;gBACtD,MAAM;aACN;YACD,KAAK,SAAS,CAAC,iBAAiB,CAAC,CAAC;gBACjC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,iBAAiB,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1E,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;gBAClC,MAAM;aACN;YACD,KAAK,SAAS,CAAC,mBAAmB,CAAC,CAAC;gBACnC,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;gBAClD,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC;gBAC/E,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,aAAa,CAAC,CAAC;gBACvD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;gBACpD,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;gBACpD,MAAM;aACN;YACD,KAAK,SAAS,CAAC,mBAAmB,CAAC,CAAC;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;gBACjD,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;gBACpC,MAAM;aACN;YACD;gBACC,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;SACvC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE;YACnD,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,OAAO,EAAE;SACrB;KACD;IAED,IAAI,gBAAgB,EAAE;QACrB,OAAO,CAAC,iBAAiB,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACjD,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,OAAO,EAAE;KACrB;AACF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAoB;IACrD,MAAM,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAG,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,CAAC,SAAS,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;IACzE,MAAM,KAAK,GAAG,SAAS,GAAG,MAAM,CAAC,oBAAoB,CAAC,CAAC;IACvD,MAAM,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,IAAI,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;IACpE,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,MAAM,CAAC,oBAAoB,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;IACtG,MAAM,IAAI,GAAG,WAAW,GAAG,YAAY,GAAG,WAAW,CAAC;IACtD,OAAO,gBAAgB,CACtB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAC1G,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW;IAC1C,OAAO,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,WAAW,CAAC,GAAW,EAAE,IAAY,EAAE,MAAc;IAC7D,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC;AAC/C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { v5 } from 'uuid';\nimport Prando from 'prando';\nimport { expect } from 'chai';\nimport { Serializable } from '@fluidframework/datastore-definitions';\nimport { assert, assertNotUndefined, ClosedMap, fail, getOrCreate } from '../../Common';\nimport { IdCompressor, IdRangeDescriptor, isLocalId } from '../../id-compressor/IdCompressor';\nimport {\n\tassertIsStableId,\n\tcreateSessionId,\n\tensureSessionUuid,\n\tNumericUuid,\n\tnumericUuidFromStableId,\n\tstableIdFromNumericUuid,\n} from '../../id-compressor/NumericUuid';\nimport { FinalCompressedId, SessionId, StableId, SessionSpaceCompressedId } from '../../Identifiers';\nimport { getIds } from '../../id-compressor/IdRange';\nimport type {\n\tIdCreationRange,\n\tSerializedIdCompressorWithOngoingSession,\n\tSerializedIdCompressorWithNoSession,\n} from '../../id-compressor';\n\n/** Identifies a compressor in a network */\nexport enum Client {\n\tClient1 = 'Client1',\n\tClient2 = 'Client2',\n\tClient3 = 'Client3',\n}\n\n/** Identifies a compressor with respect to a specific operation */\nexport enum SemanticClient {\n\tLocalClient = 'LocalClient',\n}\n\n/** Identifies categories of compressors */\nexport enum MetaClient {\n\tAll = 'All',\n}\n\n/**\n * Used to attribute actions to clients in a distributed collaboration session.\n * `Local` implies a local and unsequenced operation. All others imply sequenced operations.\n */\nexport type OriginatingClient = Client | SemanticClient;\nexport const OriginatingClient = { ...Client, ...SemanticClient };\n\n/** Identifies a compressor to which to send an operation */\nexport type DestinationClient = Client | MetaClient;\nexport const DestinationClient = { ...Client, ...MetaClient };\n\n/**\n * Creates a new compressor with the supplied cluster capacity.\n */\nexport function createCompressor<T>(\n\tclient: Client,\n\tclusterCapacity = 5,\n\tattributionInfo?: Serializable<T>\n): IdCompressor {\n\tconst compressor = new IdCompressor(sessionIds.get(client), 1024, attributionInfo);\n\tcompressor.clusterCapacity = clusterCapacity;\n\treturn compressor;\n}\n\n/**\n * A closed map from NamedClient to T.\n */\nexport type ClientMap<T> = ClosedMap<Client, T>;\n\nfunction makeSessionIds(): ClientMap<SessionId> {\n\tconst stableIds = new Map<Client, SessionId>();\n\tconst clients = Object.values(Client);\n\tfor (let i = 0; i < clients.length; i++) {\n\t\t// Place session uuids roughly in the middle of uuid space to increase odds of encountering interesting\n\t\t// orderings in sorted collections\n\t\tconst sessionId = ensureSessionUuid(assertIsStableId(`88888888-8888-4888-b${i}88-888888888888`));\n\t\tstableIds.set(clients[i], sessionId);\n\t}\n\treturn stableIds as ClientMap<SessionId>;\n}\n\n/**\n * An array of session ID strings corresponding to all non-local `Client` entries.\n */\nexport const sessionIds = makeSessionIds();\n\n/**\n * An array of session uuids corresponding to all non-local `Client` entries.\n */\nexport const sessionNumericUuids = new Map(\n\t[...sessionIds.entries()].map(([client, sessionId]) => {\n\t\treturn [client, numericUuidFromStableId(sessionId)];\n\t})\n) as ClientMap<NumericUuid>;\n\n/** An immutable view of an `IdCompressor` */\nexport interface ReadonlyIdCompressor\n\textends Omit<\n\t\tIdCompressor,\n\t\t'generateCompressedId' | 'generateCompressedIdRange' | 'takeNextCreationRange' | 'finalizeCreationRange'\n\t> {\n\treadonly clusterCapacity: number;\n}\n\n/** Information about a generated ID in a network to be validated by tests */\nexport interface TestIdData {\n\treadonly id: SessionSpaceCompressedId;\n\treadonly originatingClient: Client;\n\treadonly sessionId: SessionId;\n\treadonly sessionNumericUuid: NumericUuid;\n\treadonly expectedOverride: string | undefined;\n\treadonly isSequenced: boolean;\n}\n\n/**\n * Simulates a network of ID compressors.\n * Not suitable for performance testing.\n */\nexport class IdCompressorTestNetwork {\n\t/** The compressors used in this network */\n\tprivate readonly compressors: ClientMap<IdCompressor>;\n\t/** The log of operations seen by the server so far. Append-only. */\n\tprivate readonly serverOperations: ([range: IdCreationRange, clientFrom: Client] | number)[] = [];\n\t/** An index into `serverOperations` for each client which represents how many operations have been delivered to that client */\n\tprivate readonly clientProgress: ClientMap<number>;\n\t/** All ids (local and sequenced) that a client has created or received, in order. */\n\tprivate readonly idLogs: ClientMap<TestIdData[]>;\n\t/** All ids that a client has received from the server, in order. */\n\tprivate readonly sequencedIdLogs: ClientMap<TestIdData[]>;\n\n\tpublic constructor(\n\t\tpublic readonly initialClusterSize = 5,\n\t\tprivate readonly onIdReceived?: (network: IdCompressorTestNetwork, clientTo: Client, ids: TestIdData[]) => void\n\t) {\n\t\tconst compressors = new Map<Client, IdCompressor>();\n\t\tconst clientProgress = new Map<Client, number>();\n\t\tconst clientIds = new Map<Client, TestIdData[]>();\n\t\tconst clientSequencedIds = new Map<Client, TestIdData[]>();\n\t\tfor (const client of Object.values(Client)) {\n\t\t\tconst compressor = createCompressor(client, initialClusterSize, client);\n\t\t\tcompressors.set(client, compressor);\n\t\t\tclientProgress.set(client, 0);\n\t\t\tclientIds.set(client, []);\n\t\t\tclientSequencedIds.set(client, []);\n\t\t}\n\t\tthis.compressors = compressors as ClientMap<IdCompressor>;\n\t\tthis.clientProgress = clientProgress as ClientMap<number>;\n\t\tthis.idLogs = clientIds as ClientMap<TestIdData[]>;\n\t\tthis.sequencedIdLogs = clientSequencedIds as ClientMap<TestIdData[]>;\n\t}\n\n\t/**\n\t * Returns an immutable handle to a compressor in the network.\n\t */\n\tpublic getCompressor(client: Client): ReadonlyIdCompressor {\n\t\tconst compressors = this.compressors;\n\t\tconst handler = {\n\t\t\tget(_, property) {\n\t\t\t\tconst compressor = compressors.get(client);\n\t\t\t\treturn compressor[property];\n\t\t\t},\n\t\t\tset(_, property, value): boolean {\n\t\t\t\tconst compressor = compressors.get(client);\n\t\t\t\tcompressor[property] = value;\n\t\t\t\treturn true;\n\t\t\t},\n\t\t};\n\t\treturn new Proxy<IdCompressor>({} as unknown as IdCompressor, handler);\n\t}\n\n\t/**\n\t * Returns a mutable handle to a compressor in the network. Use of mutation methods will break the network invariants and\n\t * should only be used if the network will not be used again.\n\t */\n\tpublic getCompressorUnsafe(client: Client): IdCompressor {\n\t\treturn this.getCompressor(client) as IdCompressor;\n\t}\n\n\t/**\n\t * Returns data for all IDs created and received by this client, including ack's of their own (i.e. their own IDs will appear twice)\n\t */\n\tpublic getIdLog(client: Client): readonly TestIdData[] {\n\t\treturn this.idLogs.get(client);\n\t}\n\n\t/**\n\t * Returns data for all IDs received by this client, including ack's of their own (i.e. their own IDs will appear twice)\n\t */\n\tpublic getSequencedIdLog(client: Client): readonly TestIdData[] {\n\t\treturn this.sequencedIdLogs.get(client);\n\t}\n\n\t/**\n\t * Get all compressors for the given destination\n\t */\n\tpublic getTargetCompressors(clientTo: DestinationClient): [Client, IdCompressor][] {\n\t\treturn clientTo === MetaClient.All\n\t\t\t? [...this.compressors.entries()]\n\t\t\t: ([[clientTo, this.getCompressor(clientTo)]] as [Client, IdCompressor][]);\n\t}\n\n\t/**\n\t * Submit a capacity change operation to the network. It will not take effect immediately but will be processed in sequence order.\n\t */\n\tpublic enqueueCapacityChange(newClusterCapacity: number): void {\n\t\tthis.serverOperations.push(newClusterCapacity);\n\t}\n\n\tprivate addNewId(\n\t\tclient: Client,\n\t\tid: SessionSpaceCompressedId,\n\t\texpectedOverride: string | undefined,\n\t\toriginatingClient: Client,\n\t\tisSequenced: boolean\n\t): void {\n\t\tconst idData = {\n\t\t\tid,\n\t\t\toriginatingClient,\n\t\t\tsessionId: sessionIds.get(originatingClient),\n\t\t\tsessionNumericUuid: sessionNumericUuids.get(originatingClient),\n\t\t\texpectedOverride,\n\t\t\tisSequenced,\n\t\t};\n\t\tconst clientIds = this.idLogs.get(client);\n\t\tclientIds.push(idData);\n\t\tif (isSequenced) {\n\t\t\tconst sequencedIds = this.sequencedIdLogs.get(client);\n\t\t\tsequencedIds.push(idData);\n\t\t}\n\t\tthis.onIdReceived?.(this, client, clientIds);\n\t}\n\n\t/**\n\t * Allocates a new range of local IDs and enqueues them for future delivery via a `testIdDelivery` action.\n\t * Calls to this method determine the total order of delivery, regardless of when `deliverOperations` is called.\n\t */\n\tpublic allocateAndSendIds(\n\t\tclient: Client,\n\t\tnumIds: number\n\t): { range: IdRangeDescriptor<SessionSpaceCompressedId>; sessionId: SessionId };\n\n\t/**\n\t * Allocates a new range of local IDs and enqueues them for future delivery via a `testIdDelivery` action.\n\t * Calls to this method determine the total order of delivery, regardless of when `deliverOperations` is called.\n\t */\n\tpublic allocateAndSendIds(client: Client, numIds: number, overrides: { [index: number]: string }): IdCreationRange;\n\n\tpublic allocateAndSendIds(\n\t\tclient: Client,\n\t\tnumIds: number,\n\t\toverrides: { [index: number]: string } = {}\n\t): { range: IdRangeDescriptor<SessionSpaceCompressedId>; sessionId: SessionId } | IdCreationRange {\n\t\tassert(numIds > 0, 'Must allocate a non-zero number of IDs');\n\t\tconst compressor = this.compressors.get(client);\n\t\tlet nextIdIndex = 0;\n\t\tfor (const [overrideIndex, uuid] of Object.entries(overrides)\n\t\t\t.map(([id, uuid]) => [Number.parseInt(id, 10), uuid] as [number, string])\n\t\t\t.sort(([a], [b]) => a - b)) {\n\t\t\twhile (nextIdIndex < overrideIndex) {\n\t\t\t\tthis.addNewId(client, compressor.generateCompressedId(), undefined, client, false);\n\t\t\t\tnextIdIndex += 1;\n\t\t\t}\n\t\t\tthis.addNewId(client, compressor.generateCompressedId(uuid), uuid, client, false);\n\t\t\tnextIdIndex += 1;\n\t\t}\n\t\tconst numTrailingIds = numIds - nextIdIndex;\n\t\tlet range: IdRangeDescriptor<SessionSpaceCompressedId> | undefined;\n\t\tif (numTrailingIds > 0) {\n\t\t\trange = compressor.generateCompressedIdRange(numTrailingIds);\n\t\t\tconst ids = compressor.getIdsFromRange(range, compressor.localSessionId);\n\t\t\tfor (let i = 0; i < numTrailingIds; i++) {\n\t\t\t\tthis.addNewId(client, ids.get(i), undefined, client, false);\n\t\t\t}\n\t\t}\n\t\tconst creationRange = compressor.takeNextCreationRange();\n\t\tthis.serverOperations.push([creationRange, client]);\n\t\treturn nextIdIndex === 0 ? { range: range ?? fail(), sessionId: compressor.localSessionId } : creationRange;\n\t}\n\n\t/**\n\t * Delivers all undelivered ID ranges and cluster capacity changes from the server to the target clients.\n\t */\n\tpublic deliverOperations(clientTakingDelivery: DestinationClient) {\n\t\tfor (const [clientTo, compressorTo] of this.getTargetCompressors(clientTakingDelivery)) {\n\t\t\tfor (let i = this.clientProgress.get(clientTo); i < this.serverOperations.length; i++) {\n\t\t\t\tconst operation = this.serverOperations[i];\n\t\t\t\tif (typeof operation === 'number') {\n\t\t\t\t\tcompressorTo.clusterCapacity = operation;\n\t\t\t\t} else {\n\t\t\t\t\tconst [range, clientFrom] = operation;\n\t\t\t\t\tcompressorTo.finalizeCreationRange(range);\n\n\t\t\t\t\tconst ids = getIds(range);\n\t\t\t\t\tif (ids !== undefined) {\n\t\t\t\t\t\tlet overrideIndex = 0;\n\t\t\t\t\t\tconst overrides = ids.overrides;\n\t\t\t\t\t\tfor (let id = ids.first; id >= ids.last; id--) {\n\t\t\t\t\t\t\tlet override: string | undefined;\n\t\t\t\t\t\t\tif (\n\t\t\t\t\t\t\t\toverrides !== undefined &&\n\t\t\t\t\t\t\t\toverrideIndex < overrides.length &&\n\t\t\t\t\t\t\t\tid === overrides[overrideIndex][0]\n\t\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t\toverride = overrides[overrideIndex][1];\n\t\t\t\t\t\t\t\toverrideIndex++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tconst sessionSpaceId = compressorTo.normalizeToSessionSpace(id, range.sessionId);\n\t\t\t\t\t\t\tthis.addNewId(clientTo, sessionSpaceId, override, clientFrom, true);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tassert(overrideIndex === (overrides?.length ?? 0));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthis.clientProgress.set(clientTo, this.serverOperations.length);\n\t\t}\n\t}\n\n\t/**\n\t * Simulate a client disconnecting (and serializing), then reconnecting (and deserializing)\n\t */\n\tpublic goOfflineThenResume(client: Client): void {\n\t\tconst compressor = this.compressors.get(client);\n\t\tconst [_, resumedCompressor] = roundtrip(compressor, true);\n\t\tthis.compressors.set(client, resumedCompressor);\n\t}\n\n\t/**\n\t * Ensure general validity of the network state. Useful for calling periodically or at the end of test scenarios.\n\t */\n\tpublic assertNetworkState(): void {\n\t\tconst sequencedLogs = Object.values(Client).map(\n\t\t\t(client) => [this.compressors.get(client), this.getSequencedIdLog(client)] as [IdCompressor, TestIdData[]]\n\t\t);\n\n\t\tconst maxLogLength = sequencedLogs.map(([_, data]) => data.length).reduce((p, n) => Math.max(p, n));\n\n\t\tfunction getNextLogWithEntryAt(logsIndex: number, entryIndex: number): number | undefined {\n\t\t\tfor (let i = logsIndex; i < sequencedLogs.length; i++) {\n\t\t\t\tconst log = sequencedLogs[i];\n\t\t\t\tif (log[1].length > entryIndex) {\n\t\t\t\t\treturn i;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst uuids = new Set<string>();\n\t\tconst finalIds = new Set<FinalCompressedId>();\n\t\tconst idIndicesAggregator = new Map<Client, number>();\n\n\t\tfunction* getLogIndices(\n\t\t\tcolumnIndex: number\n\t\t): Iterable<\n\t\t\t[\n\t\t\t\tcurrent: [compressor: IdCompressor, idData: TestIdData],\n\t\t\t\tnext?: [compressor: IdCompressor, idData: TestIdData]\n\t\t\t]\n\t\t> {\n\t\t\tlet current = getNextLogWithEntryAt(0, columnIndex);\n\t\t\twhile (current !== undefined) {\n\t\t\t\tconst next = getNextLogWithEntryAt(current + 1, columnIndex);\n\t\t\t\tconst [compressor, log] = sequencedLogs[current];\n\t\t\t\tif (next === undefined) {\n\t\t\t\t\tyield [[compressor, log[columnIndex]]];\n\t\t\t\t} else {\n\t\t\t\t\tconst [compressorNext, logNext] = sequencedLogs[next];\n\t\t\t\t\tyield [\n\t\t\t\t\t\t[compressor, log[columnIndex]],\n\t\t\t\t\t\t[compressorNext, logNext[columnIndex]],\n\t\t\t\t\t];\n\t\t\t\t}\n\t\t\t\tcurrent = next;\n\t\t\t}\n\t\t}\n\n\t\tfor (let i = 0; i < maxLogLength; i++) {\n\t\t\tconst creator: [creator: Client, override?: string][] = [];\n\t\t\tlet originatingClient: Client | undefined;\n\t\t\tlet localCount = 0;\n\t\t\tlet rowCount = 0;\n\t\t\tfor (const [current, next] of getLogIndices(i)) {\n\t\t\t\tconst [compressorA, idDataA] = current;\n\t\t\t\tconst sessionSpaceIdA = idDataA.id;\n\t\t\t\tif (isLocalId(sessionSpaceIdA)) {\n\t\t\t\t\tlocalCount += 1;\n\t\t\t\t}\n\t\t\t\tconst idIndex = getOrCreate(idIndicesAggregator, idDataA.originatingClient, () => 0);\n\t\t\t\toriginatingClient ??= idDataA.originatingClient;\n\t\t\t\tassert(\n\t\t\t\t\tidDataA.originatingClient === originatingClient,\n\t\t\t\t\t'Test infra gave wrong originating client to TestIdData'\n\t\t\t\t);\n\n\t\t\t\t// Only one client should have this ID as local in its session space, as only one client could have created this ID\n\t\t\t\tif (isLocalId(sessionSpaceIdA)) {\n\t\t\t\t\tlocalCount++;\n\t\t\t\t\texpect(idDataA.sessionId).to.equal(this.compressors.get(originatingClient).localSessionId);\n\t\t\t\t\texpect(creator.length === 0 || creator[creator.length - 1][1] === idDataA.expectedOverride).to.be\n\t\t\t\t\t\t.true;\n\t\t\t\t\tcreator.push([originatingClient, idDataA.expectedOverride]);\n\t\t\t\t}\n\n\t\t\t\tconst uuidASessionSpace = compressorA.decompress(sessionSpaceIdA);\n\t\t\t\tif (idDataA.expectedOverride !== undefined) {\n\t\t\t\t\texpect(uuidASessionSpace).to.equal(idDataA.expectedOverride);\n\t\t\t\t} else {\n\t\t\t\t\texpect(uuidASessionSpace).to.equal(stableIdFromNumericUuid(idDataA.sessionNumericUuid, idIndex));\n\t\t\t\t}\n\t\t\t\texpect(compressorA.recompress(uuidASessionSpace)).to.equal(sessionSpaceIdA);\n\t\t\t\tuuids.add(uuidASessionSpace);\n\t\t\t\tconst opSpaceIdA = compressorA.normalizeToOpSpace(sessionSpaceIdA);\n\t\t\t\tif (isLocalId(opSpaceIdA)) {\n\t\t\t\t\texpect.fail('IDs should have been finalized.');\n\t\t\t\t}\n\t\t\t\t// TODO: This cast can be removed on typescript 4.6\n\t\t\t\tfinalIds.add(opSpaceIdA as FinalCompressedId);\n\t\t\t\tconst uuidAOpSpace = compressorA.decompress(opSpaceIdA);\n\n\t\t\t\texpect(uuidASessionSpace).to.equal(uuidAOpSpace);\n\n\t\t\t\tif (next !== undefined) {\n\t\t\t\t\tconst [compressorB, idDataB] = next;\n\t\t\t\t\tconst sessionSpaceIdB = idDataB.id;\n\n\t\t\t\t\tconst uuidBSessionSpace = compressorB.decompress(sessionSpaceIdB);\n\t\t\t\t\texpect(uuidASessionSpace).to.equal(uuidBSessionSpace);\n\t\t\t\t\tconst opSpaceIdB = compressorB.normalizeToOpSpace(sessionSpaceIdB);\n\t\t\t\t\tif (opSpaceIdA !== opSpaceIdB) {\n\t\t\t\t\t\tcompressorB.normalizeToOpSpace(sessionSpaceIdB);\n\t\t\t\t\t\tcompressorA.normalizeToOpSpace(sessionSpaceIdA);\n\t\t\t\t\t}\n\t\t\t\t\texpect(opSpaceIdA).to.equal(opSpaceIdB);\n\t\t\t\t\tif (isLocalId(opSpaceIdB)) {\n\t\t\t\t\t\tfail('IDs should have been finalized.');\n\t\t\t\t\t}\n\t\t\t\t\tconst uuidBOpSpace = compressorB.decompress(opSpaceIdB);\n\t\t\t\t\texpect(uuidAOpSpace).to.equal(uuidBOpSpace);\n\t\t\t\t}\n\n\t\t\t\trowCount += 1;\n\t\t\t}\n\n\t\t\t// A local count > 1 indicates that this ID was unified, as more than one client has a local ID for it\n\t\t\t// in their session space.\n\t\t\tif (rowCount === this.sequencedIdLogs.size && localCount <= 1) {\n\t\t\t\texpect(localCount).to.equal(1);\n\t\t\t\tfor (const [[compressor, { id, originatingClient }]] of getLogIndices(i)) {\n\t\t\t\t\texpect(compressor.attributeId(id)).to.equal(originatingClient);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\texpect(uuids.size).to.equal(finalIds.size);\n\t\t\tassert(originatingClient !== undefined);\n\t\t\tidIndicesAggregator.set(\n\t\t\t\toriginatingClient,\n\t\t\t\tassertNotUndefined(idIndicesAggregator.get(originatingClient)) + 1\n\t\t\t);\n\t\t}\n\n\t\tfor (const [compressor] of sequencedLogs) {\n\t\t\texpectSerializes(compressor);\n\t\t}\n\t}\n}\n\n/**\n * Roundtrips the supplied compressor through serialization and deserialization.\n */\nexport function roundtrip(\n\tcompressor: ReadonlyIdCompressor,\n\twithSession: true\n): [SerializedIdCompressorWithOngoingSession, IdCompressor];\n\n/**\n * Roundtrips the supplied compressor through serialization and deserialization.\n */\nexport function roundtrip(\n\tcompressor: ReadonlyIdCompressor,\n\twithSession: false\n): [SerializedIdCompressorWithNoSession, IdCompressor];\n\nexport function roundtrip(\n\tcompressor: ReadonlyIdCompressor,\n\twithSession: boolean\n): [SerializedIdCompressorWithOngoingSession | SerializedIdCompressorWithNoSession, IdCompressor] {\n\tif (withSession) {\n\t\tconst serialized = compressor.serialize(withSession);\n\t\treturn [serialized, IdCompressor.deserialize(serialized)];\n\t}\n\n\tconst nonLocalSerialized = compressor.serialize(withSession);\n\treturn [nonLocalSerialized, IdCompressor.deserialize(nonLocalSerialized, createSessionId())];\n}\n\n/**\n * Asserts that the supplied compressor correctly roundtrips through serialization/deserialization.\n */\nexport function expectSerializes(\n\tcompressor: ReadonlyIdCompressor\n): [SerializedIdCompressorWithNoSession, SerializedIdCompressorWithOngoingSession] {\n\tfunction expectSerializes(\n\t\twithSession: boolean\n\t): SerializedIdCompressorWithOngoingSession | SerializedIdCompressorWithNoSession {\n\t\tlet serialized: SerializedIdCompressorWithOngoingSession | SerializedIdCompressorWithNoSession;\n\t\tlet deserialized: IdCompressor;\n\t\tif (withSession) {\n\t\t\t[serialized, deserialized] = roundtrip(compressor, true);\n\t\t} else {\n\t\t\t[serialized, deserialized] = roundtrip(compressor, false);\n\t\t}\n\t\tconst chainCount: number[] = [];\n\t\tfor (let i = 0; i < serialized.sessions.length; i++) {\n\t\t\tchainCount[i] = 0;\n\t\t}\n\t\tconst chainProcessed: number[] = [...chainCount];\n\n\t\tfor (const cluster of serialized.clusters) {\n\t\t\tconst [sessionIndex] = cluster;\n\t\t\texpect(sessionIndex < serialized.sessions.length);\n\t\t\tchainCount[sessionIndex]++;\n\t\t}\n\n\t\tfor (const cluster of serialized.clusters) {\n\t\t\tconst [sessionIndex, capacity, maybeSize] = cluster;\n\t\t\tconst chainIndex = chainProcessed[sessionIndex];\n\t\t\tif (chainIndex < chainCount[sessionIndex] - 1) {\n\t\t\t\texpect(maybeSize === undefined);\n\t\t\t} else {\n\t\t\t\texpect(maybeSize === undefined || typeof maybeSize !== 'number' || maybeSize < capacity);\n\t\t\t}\n\t\t\tchainProcessed[sessionIndex]++;\n\t\t}\n\n\t\texpect(compressor.equals(deserialized, withSession)).to.be.true;\n\t\treturn serialized;\n\t}\n\n\treturn [\n\t\texpectSerializes(false) as SerializedIdCompressorWithNoSession,\n\t\texpectSerializes(true) as SerializedIdCompressorWithOngoingSession,\n\t];\n}\n\n/**\n * Merges 'from' into 'to', and returns 'to'.\n */\nexport function mergeArrayMaps<K, V>(\n\tto: Pick<Map<K, V[]>, 'get' | 'set'>,\n\tfrom: ReadonlyMap<K, V[]>\n): Pick<Map<K, V[]>, 'get' | 'set'> {\n\tfor (const [key, value] of from.entries()) {\n\t\tconst entry = to.get(key);\n\t\tif (entry !== undefined) {\n\t\t\tentry.push(...value);\n\t\t} else {\n\t\t\tto.set(key, [...value]);\n\t\t}\n\t}\n\treturn to;\n}\n\nenum Operation {\n\tAllocateIds,\n\tDeliverOperations,\n\tChangeCapacity,\n\tGenerateUnifyingIds,\n\tGoOfflineThenResume,\n}\n\n/**\n * Performs random actions on a test network.\n * @param network the test network to test\n * @param seed the seed for the random generation of the fuzz actions\n * @param includeOverrides whether or not the fuzz actions will generate override UUIDs\n * @param observerClient if provided, this client will never generate local ids\n * @param synchronizeAtEnd if provided, all client will have all operations delivered from the server at the end of the test\n * @param numUsages if provided, the number of operations to perform as part of this test. Defaults to 1000.\n * @param validator if provided, this callback will be invoked periodically during the fuzz test.\n */\nexport function performFuzzActions(\n\tnetwork: IdCompressorTestNetwork,\n\tseed: number,\n\tincludeOverrides: boolean,\n\tobserverClient?: Client,\n\tsynchronizeAtEnd: boolean = true,\n\tnumUsages = 1000,\n\tmaxClusterSize = 25,\n\tvalidator?: (network: IdCompressorTestNetwork) => void\n): void {\n\tconst rand = new Prando(seed);\n\tconst selectableClients: Client[] = network.getTargetCompressors(MetaClient.All).map(([client]) => client);\n\tconst activeClients = selectableClients.filter((c) => c !== observerClient);\n\t// Ensure that the same UUIDs are generated for the same seed across different calls\n\tlet uuidNum = 0;\n\tconst uuidNamespace = 'ece2be2e-f374-4ca8-b034-a0bac2da69da';\n\tlet clusterSize: number = network.initialClusterSize;\n\tif (clusterSize > maxClusterSize) {\n\t\tnetwork.enqueueCapacityChange(maxClusterSize);\n\t\tclusterSize = maxClusterSize;\n\t}\n\n\tconst opWeights: [Operation, number][] = [\n\t\t[Operation.ChangeCapacity, 1],\n\t\t[Operation.AllocateIds, 8],\n\t\t[Operation.DeliverOperations, 4],\n\t\t[Operation.GenerateUnifyingIds, 1],\n\t\t[Operation.GoOfflineThenResume, 1],\n\t];\n\n\tconst opSums: [Operation, number][] = [];\n\tlet prevWeight = 0;\n\tfor (const opWeight of opWeights) {\n\t\tconst weight = prevWeight + opWeight[1];\n\t\topSums.push([opWeight[0], weight]);\n\t\tprevWeight = weight;\n\t}\n\n\tfor (let i = 0; i < numUsages; i++) {\n\t\tconst weightSelected = rand.nextInt(1, prevWeight);\n\t\tlet opIndex = 0;\n\t\twhile (weightSelected > opSums[opIndex][1]) {\n\t\t\topIndex++;\n\t\t}\n\t\tconst operation = opWeights[opIndex][0];\n\t\tswitch (operation) {\n\t\t\tcase Operation.ChangeCapacity: {\n\t\t\t\tclusterSize = Math.min(Math.floor(rand.next(0, 1) ** 2 * maxClusterSize) + 1, maxClusterSize);\n\t\t\t\tnetwork.enqueueCapacityChange(clusterSize);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Operation.AllocateIds: {\n\t\t\t\tconst client = rand.nextArrayItem(activeClients);\n\t\t\t\tconst maxIdsPerUsage = clusterSize * 2;\n\t\t\t\tconst numIds = Math.floor(rand.next(0, 1) ** 2 * maxIdsPerUsage) + 1;\n\t\t\t\tconst overrides: { [index: number]: string } = {};\n\t\t\t\tif (includeOverrides && /* 25% chance: */ rand.nextInt(0, 3) === 0) {\n\t\t\t\t\tfor (let j = 0; j < numIds; j++) {\n\t\t\t\t\t\tif (/* 33% chance: */ rand.nextInt(0, 2) === 0) {\n\t\t\t\t\t\t\toverrides[j] = v5((uuidNum++).toString(), uuidNamespace);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnetwork.allocateAndSendIds(client, numIds, overrides);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Operation.DeliverOperations: {\n\t\t\t\tconst client = rand.nextArrayItem([...selectableClients, MetaClient.All]);\n\t\t\t\tnetwork.deliverOperations(client);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Operation.GenerateUnifyingIds: {\n\t\t\t\tconst clientA = rand.nextArrayItem(activeClients);\n\t\t\t\tconst clientB = rand.nextArrayItem(activeClients.filter((c) => c !== clientA));\n\t\t\t\tconst uuid = v5((uuidNum++).toString(), uuidNamespace);\n\t\t\t\tnetwork.allocateAndSendIds(clientA, 1, { 0: uuid });\n\t\t\t\tnetwork.allocateAndSendIds(clientB, 1, { 0: uuid });\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase Operation.GoOfflineThenResume: {\n\t\t\t\tconst client = rand.nextArrayItem(activeClients);\n\t\t\t\tnetwork.goOfflineThenResume(client);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tdefault:\n\t\t\t\tthrow new Error('Unknown operation.');\n\t\t}\n\t\tif (i !== 0 && i % Math.round(numUsages / 5) === 0) {\n\t\t\tvalidator?.(network);\n\t\t}\n\t}\n\n\tif (synchronizeAtEnd) {\n\t\tnetwork.deliverOperations(DestinationClient.All);\n\t\tvalidator?.(network);\n\t}\n}\n\n/**\n * Converts the supplied integer to a uuid.\n */\nexport function integerToStableId(num: number | bigint): StableId {\n\tconst bigintNum = BigInt(num);\n\tconst upper = bigintNum >> BigInt(74);\n\tconst middle = (bigintNum & (BigInt(0xfff) << BigInt(62))) >> BigInt(62);\n\tconst lower = bigintNum & BigInt('0x3fffffffffffffff');\n\tconst upperString = padToLength(upper.toString(16), '0', 12);\n\tconst middleString = `4${padToLength(middle.toString(16), '0', 3)}`;\n\tconst lowerString = padToLength((BigInt('0x8000000000000000') | BigInt(lower)).toString(16), '0', 16);\n\tconst uuid = upperString + middleString + lowerString;\n\treturn assertIsStableId(\n\t\t`${uuid.substr(0, 8)}-${uuid.substr(8, 4)}-${uuid.substr(12, 4)}-${uuid.substr(16, 4)}-${uuid.substr(20)}`\n\t);\n}\n\n/**\n * Pads the strings to a length of 32 with zeroes.\n */\nexport function padToUuidLength(str: string): string {\n\treturn padToLength(str, '0', 32);\n}\n\nfunction padToLength(str: string, char: string, length: number): string {\n\treturn char.repeat(length - str.length) + str;\n}\n"]}