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

package/dist/test/testClient.js

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

package/dist/test/testClient.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"testClient.js","sourceRoot":"","sources":["../../src/test/testClient.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,mCAA0C;AAC1C,gFAAkE;AAClE,qEAAoE;AACpE,+EAK8C;AAE9C,2EAAiE;AACjE,+DAAqD;AAErD,sCAAmC;AACnC,gDAAkD;AAClD,4CAAwD;AACxD,sDAA+F;AAC/F,4CAAiG;AACjG,gCAAmG;AAEnG,sDAAmD;AACnD,gDAA6C;AAC7C,4CAA2D;AAC3D,gEAA6D;AAE7D,4DAAiG;AACjG,8DAAmF;AAGnF,qDAAkD;AAClD,2CAAwD;AAExD,SAAgB,aAAa,CAAC,IAAkB;IAC/C,MAAM,SAAS,GAAG,yBAAW,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IACnD,IAAI,SAAS,EAAE;QACd,OAAO,SAAS,CAAC;KACjB;IAED,MAAM,WAAW,GAAG,uBAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAChD,IAAI,WAAW,EAAE;QAChB,OAAO,WAAW,CAAC;KACnB;IAED,MAAM,IAAI,KAAK,CAAC,oCAAoC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9E,CAAC;AAZD,sCAYC;AAED,MAAM,MAAM,GAAG,IAAA,kCAAU,EAAC,UAAU,EAAE,SAAS,CAAC,CAAC;AAEjD,MAAa,UAAW,SAAQ,eAAM;IAe9B,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAC3C,OAAmB,EACnB,eAAuB;QAEvB,MAAM,QAAQ,GAAG,IAAI,+BAAc,CAClC,OAAO,CAAC,SAAS,EACjB,IAAA,mCAAiB,EAAC,EAAE,SAAS,EAAE,gBAAgB,EAAE,CAAC,CAClD,CAAC;QACF,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvB,oEAAoE;QACpE,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,UAAU,EAAE,SAAU,CAAC,CAAC,OAAO,CAAC;QACjF,OAAO,UAAU,CAAC,iBAAiB,CAClC,WAAW,EACX,eAAe,EACf,OAAO,CAAC,aAAa,EACrB,OAAO,CAAC,SAAS,CAAC,OAAO,CACzB,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,KAAK,CAAC,kBAAkB,CACrC,YAAmB,EACnB,eAAuB,EACvB,SAA2C,EAC3C,OAAqB;QAErB,OAAO,UAAU,CAAC,iBAAiB,CAClC,IAAI,gCAAW,CAAC,YAAY,CAAC,EAC7B,eAAe,EACf,SAAS,EACT,OAAO,CACP,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,KAAK,CAAC,iBAAiB,CACpC,WAAyB,EACzB,eAAuB,EACvB,SAA2C,EAC3C,OAAqB;QAErB,OAAO,UAAU,CAAC,iBAAiB,CAClC,gCAAW,CAAC,iBAAiB,CAAC,WAAW,CAAC,EAC1C,eAAe,EACf,SAAS,EACT,OAAO,CACP,CAAC;IACH,CAAC;IAEM,MAAM,CAAC,KAAK,CAAC,iBAAiB,CACpC,OAAoB,EACpB,eAAuB,EACvB,SAA2C,EAC3C,OAAqB;QAErB,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM,EAAE,WAAW,EAAE,GAAG,MAAM,OAAO,CAAC,IAAI,CACzC;YACC,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,QAAQ,EAAE,eAAe;SACQ,EAClC,OAAO,EACP,UAAU,CAAC,UAAU,CACrB,CAAC;QACF,MAAM,WAAW,CAAC;QAClB,OAAO,OAAO,CAAC;IAChB,CAAC;IASD,YAAY,OAAyC,EAAE,SAAS,GAAG,aAAa;QAC/E,KAAK,CAAC,SAAS,EAAE,IAAA,mCAAiB,EAAC,EAAE,SAAS,EAAE,kBAAkB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;QAtF1E,eAAU,GAAG,KAAK,CAAC;QACnB,cAAS,GAAG,CAAC,CAAC;QACd,oBAAe,GAAG,CAAC,CAAC;QACpB,gBAAW,GAAG,CAAC,CAAC;QAChB,aAAQ,GAAG,CAAC,CAAC;QACb,kBAAa,GAAG,CAAC,CAAC;QA2ET,WAAM,GAA6B,IAAI,8BAAgB,EAAU,CAAC;QAC/D,MAAC,GACnB,IAAI,8BAAgB,EAA6B,CAAC;QAKlD,IAAI,CAAC,SAAS,GAAI,IAAwC,CAAC,UAAU,CAAC;QACtE,IAAI,CAAC,UAAU,GAAG,IAAI,yCAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAE1D,sBAAsB;QACtB,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzB,8CAA8C;YAC9C,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC7B,IAAI,CAAC,CAAC,SAAS,KAAK,wBAAkB,CAAC,MAAM,EAAE;oBAC9C,MAAM,GAAG,GAAe,CAAC,CAAC,OAAO,CAAC;oBAClC,eAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;iBACvC;YACF,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,EACtB,KAAK,EACL,GAAG,EACH,MAAM,EACN,QAAQ,EACR,GAAG,EACH,SAAS,GAAG,KAAK,EACjB,MAAM,GASN;QACA,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACtF,CAAC;IAEM,OAAO,CAAC,KAAc,EAAE,GAAY;QAC1C,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC1F,CAAC;IAEM,iBAAiB;QACvB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAClC,CAAC;IACM,eAAe;QACrB,OAAO,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,CAAC;IACM,UAAU,CAAC,GAA8B;QAC/C,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,UAAU;QAChB,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC;IAC7B,CAAC;IACM,aAAa,CAAC,QAAgB;QACpC,IAAI,YAAY,GAAG,QAAQ,CAAC;QAC5B,OAAO,YAAY,GAAG,CAAC,EAAE;YACxB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YAC9B,IAAI,GAAG,EAAE;gBACR,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aACnB;iBAAM;gBACN,MAAM;aACN;YACD,YAAY,EAAE,CAAC;SACf;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,eAAe,CAAC,GAAW,EAAE,IAAY,EAAE,KAAmB;QACpE,MAAM,OAAO,GAAG,IAAI,yBAAW,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,EAAE;YACV,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAEM,gBAAgB,CACtB,GAAW,EACX,IAAY,EACZ,KAA8B,EAC9B,GAAW,EACX,MAAc,EACd,YAAoB;QAEpB,MAAM,OAAO,GAAG,IAAI,yBAAW,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,KAAK,EAAE;YACV,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,IAAI,CAAC,QAAQ,CACZ,IAAI,CAAC,aAAa,CAAC,IAAA,iCAAqB,EAAC,GAAG,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,CAClF,CAAC;IACH,CAAC;IAEM,iBAAiB,CACvB,KAAa,EACb,GAAW,EACX,GAAW,EACX,MAAc,EACd,YAAoB;QAEpB,IAAI,CAAC,QAAQ,CACZ,IAAI,CAAC,aAAa,CAAC,IAAA,+BAAmB,EAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,CAC9E,CAAC;IACH,CAAC;IAEM,mBAAmB,CACzB,KAAa,EACb,GAAW,EACX,KAAkB,EAClB,GAAW,EACX,MAAc,EACd,YAAoB;QAEpB,IAAI,CAAC,QAAQ,CACZ,IAAI,CAAC,aAAa,CAAC,IAAA,iCAAqB,EAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,CACvF,CAAC;IACH,CAAC;IAEM,iBAAiB,CAAC,GAAW,EAAE,SAAwB,EAAE,KAAmB;QAClF,MAAM,OAAO,GAAG,IAAI,uBAAM,CAAC,SAAS,CAAC,CAAC;QACtC,IAAI,KAAK,EAAE;YACV,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAEM,kBAAkB,CACxB,GAAW,EACX,SAAqB,EACrB,KAAkB,EAClB,GAAW,EACX,MAAc,EACd,YAAoB;QAEpB,MAAM,OAAO,GAAG,IAAI,uBAAM,CAAC,SAAS,CAAC,OAAO,IAAI,mBAAa,CAAC,IAAI,CAAC,CAAC;QACpE,IAAI,KAAK,EAAE;YACV,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,IAAI,CAAC,QAAQ,CACZ,IAAI,CAAC,aAAa,CAAC,IAAA,iCAAqB,EAAC,GAAG,EAAE,OAAO,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,CAAC,CAClF,CAAC;IACH,CAAC;IAEM,OAAO,CAAC,QAAgB,EAAE,MAAc;QAC9C,OAAO,QAAQ,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,YAAY,MAAM,KAAK,IAAI,CAAC,UAAU,CAAC,OAAO,CAC1F,MAAM,EACN,QAAQ,CACR,EAAE,CAAC;IACL,CAAC;IAEM,aAAa,CACnB,EAA4B,EAC5B,MAAc,oCAAwB,EACtC,SAAiB,IAAI,CAAC,aAAa,EAAE,EACrC,YAAqB,EACrB,YAAY,GAAG,CAAC;QAEhB,IAAI,EAAE,KAAK,SAAS,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;SAC1C;QACD,MAAM,GAAG,GAA8B;YACtC,QAAQ,EAAE,YAAY,IAAI,IAAI,CAAC,YAAY,IAAI,EAAE;YACjD,oBAAoB,EAAE,CAAC;YACvB,QAAQ,EAAE,EAAE;YACZ,QAAQ,EAAE,SAAS;YACnB,qBAAqB,EAAE,YAAY;YACnC,uBAAuB,EAAE,MAAM;YAC/B,cAAc,EAAE,GAAG;YACnB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;YACrB,MAAM,EAAE,EAAE;YACV,IAAI,EAAE,kCAAW,CAAC,SAAS;SAC3B,CAAC;QACF,OAAO,GAAG,CAAC;IACZ,CAAC;IAEM,QAAQ;QACd,IAAA,eAAM,EAAC,IAAA,qCAAyB,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxD,CAAC;IAEM,aAAa,CAAC,GAAW,EAAE,MAAc;QAC/C,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,OAAO,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE;YAChC,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG,UAAU,CAAC,eAAe,CAAC,CAAC;YAEhE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,MAAM,EAAE,KAAK,EAAE;gBAClB,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;aACtD;YACD,KAAK,IAAI,UAAU,CAAC,eAAe,CAAC;SACpC;IACF,CAAC;IAEM,cAAc;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QACpD,OAAO,QAAQ,CAAC;IACjB,CAAC;IAEM,aAAa,CAAC,IAAe;QACnC,4DAA4D;QAC5D,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAA,wCAAoB,EAAC,IAAI,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,EAAE;YAC3C,MAAM,QAAQ,GAAoC,EAAE,CAAC;YACrD,QAAQ,CAAC,IAAI,CACZ,OAAO,CAAC,GAAG,KAAK,oCAAwB,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAC/E,CAAC;YACF,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,EAAE;gBACrC,QAAQ,CAAC,IAAI,CACZ,OAAO,CAAC,UAAU,KAAK,oCAAwB;oBAC9C,CAAC,CAAC,OAAO,CAAC,UAAU;oBACpB,CAAC,CAAC,IAAI,OAAO,CAAC,eAAe,EAAE,CAChC,CAAC;aACF;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAK,OAAe,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACI,cAAc,CAAC,GAAW,EAAE,aAAqB,EAAE,QAAgB;QACzE,IAAI,OAA6B,CAAC;QAClC,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,MAAM,gBAAgB,GAAG,CAAC,GAAa,EAAE,EAAE,CAC1C,CAAC,GAAG,CAAC,GAAG,KAAK,SAAS;YACrB,GAAG,CAAC,GAAG,KAAK,oCAAwB;YACpC,GAAG,CAAC,GAAG,IAAI,aAAa,CAAC;YAC1B,CAAC,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,IAAI,QAAQ,CAAC,CAAC;QAE1D,MAAM,iBAAiB,GAAG,CAAC,EAAE,UAAU,EAAE,eAAe,EAAY,EAAE,EAAE,CACvE,CAAC,UAAU,KAAK,SAAS;YACxB,UAAU,KAAK,oCAAwB;YACvC,UAAU,IAAI,aAAa,CAAC;YAC7B,CAAC,eAAe,KAAK,SAAS,IAAI,eAAe,IAAI,QAAQ,CAAC,CAAC;QAEhE,IAAA,wCAAoB,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE;YACjD,IAAA,eAAM,EACL,GAAG,CAAC,GAAG,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,EACnD,0CAA0C,CAC1C,CAAC;YACF,OAAO,GAAG,GAAG,CAAC;YAEd,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE;gBACrD,cAAc,IAAI,GAAG,CAAC,YAAY,CAAC;gBACnC,IAAI,MAAM,IAAI,GAAG,CAAC,YAAY,EAAE;oBAC/B,MAAM,IAAI,GAAG,CAAC,YAAY,CAAC;iBAC3B;aACD;YAED,0EAA0E;YAC1E,OAAO,cAAc,IAAI,GAAG,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,IAAA,eAAM,EAAC,OAAO,KAAK,SAAS,EAAE,kBAAkB,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAA,4BAAgB,EAAC,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,IAAI,OAAO,CAAC;QAChE,IAAI,MAAM,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE;YAChE,OAAO,8CAAyB,CAAC;SACjC;QAED,OAAO,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAChF,CAAC;IAEM,wBAAwB,CAAC,OAAiB,EAAE,QAAgB;QAClE,MAAM,sBAAsB,GAAG,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAEjF,IAAI,eAAe,GAAG,CAAC,CAAC;QACxB,MAAM,gBAAgB,GAAG,CAAC,GAAa,EAAE,EAAE,CAC1C,GAAG,CAAC,QAAQ,KAAK,SAAS,IAAI,GAAG,CAAC,QAAQ,IAAI,QAAQ,CAAC;QACxD,MAAM,iBAAiB,GAAG,CAAC,EAAE,UAAU,EAAE,eAAe,EAAY,EAAE,EAAE,CACvE,UAAU,KAAK,SAAS;YACxB,CAAC,UAAU,KAAK,oCAAwB;gBACvC,CAAC,eAAe,KAAK,SAAS,IAAI,eAAe,IAAI,QAAQ,CAAC,CAAC,CAAC;QAClE,MAAM,eAAe,GAAG,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAY,EAAE,EAAE,CACjE,QAAQ,KAAK,SAAS;YACtB,CAAC,QAAQ,KAAK,oCAAwB;gBACrC,CAAC,aAAa,KAAK,SAAS,IAAI,aAAa,IAAI,QAAQ,CAAC,CAAC,CAAC;QAC9D;;;;UAIQ;QACR,IAAA,wCAAoB,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,EAAE;YACjD,uFAAuF;YACvF,IAAI,GAAG,KAAK,OAAO,EAAE;gBACpB,OAAO,KAAK,CAAC;aACb;YAED,sFAAsF;YACtF,wCAAwC;YACxC,EAAE;YACF,qFAAqF;YACrF,6EAA6E;YAC7E,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE;gBAC9E,eAAe,IAAI,GAAG,CAAC,YAAY,CAAC;aACpC;YAED,OAAO,IAAI,CAAC;QACb,CAAC,CAAC,CAAC;QAEH,eAAM,CAAC,KAAK,CACX,sBAAsB,EACtB,eAAe,EACf,uEAAuE,CACvE,CAAC;QACF,OAAO,eAAe,CAAC;IACxB,CAAC;IAED;;;;;;OAMG;IACI,qBAAqB,CAAC,OAAgB;QAC5C,MAAM,IAAI,GAA4C,EAAE,CAAC;QACzD,IAAI,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE,EAAE;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,EAAE,EAAE;gBAC9C,MAAM,GAAG,GAAG,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;gBACzD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAC9C;YACD,OAAO,IAAI,CAAC;QACb,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,GAA8B,EAAE,QAAiB,KAAK;QACrE,IAAI,UAA6B,CAAC;QAClC,IAAI,IAAI,CAAC,UAAU,EAAE;YACpB,UAAU,GAAG,oBAAK,CAAC,KAAK,EAAE,CAAC;SAC3B;QAED,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAE3B,IAAI,UAAU,EAAE;YACf,IAAI,CAAC,SAAS,IAAI,mBAAmB,CAAC,UAAU,CAAC,CAAC;YAClD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,MAAM,CAAC;SACzE;IACF,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,MAAc;QAC1B,IAAI,KAAwB,CAAC;QAC7B,IAAI,IAAI,CAAC,UAAU,EAAE;YACpB,KAAK,GAAG,oBAAK,CAAC,KAAK,EAAE,CAAC;SACtB;QAED,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,KAAK,EAAE;YACV,MAAM,OAAO,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAI,CAAC,eAAe,IAAI,OAAO,CAAC;YAChC,IAAI,OAAO,GAAG,IAAI,CAAC,aAAa,EAAE;gBACjC,IAAI,CAAC,aAAa,GAAG,OAAO,CAAC;aAC7B;SACD;IACF,CAAC;IAED,mBAAmB,CAClB,QAAgB,EAChB,WAAmB,EACnB,QAAQ,GAAG,IAAI;QAEf,IAAI,WAA+B,CAAC;QAEpC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QACxD,MAAM,aAAa,GAAe,OAAqB,CAAC;QAExD,IAAI,uBAAM,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE;YAC7B,IAAI,IAAA,oCAAe,EAAC,aAAa,EAAE,WAAW,CAAC,EAAE;gBAChD,WAAW,GAAG,aAAa,CAAC;aAC5B;SACD;aAAM;YACN,IAAI,QAAQ,EAAE;gBACb,IAAA,oCAAgB,EAAC,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE;oBACvC,IAAI,uBAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;wBACnB,IAAI,IAAA,oCAAe,EAAC,GAAG,EAAE,WAAW,CAAC,EAAE;4BACtC,WAAW,GAAG,GAAG,CAAC;4BAClB,OAAO,KAAK,CAAC;yBACb;qBACD;gBACF,CAAC,CAAC,CAAC;aACH;iBAAM;gBACN,IAAA,qCAAiB,EAAC,aAAa,EAAE,CAAC,GAAG,EAAE,EAAE;oBACxC,IAAI,uBAAM,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;wBACnB,IAAI,IAAA,oCAAe,EAAC,GAAG,EAAE,WAAW,CAAC,EAAE;4BACtC,WAAW,GAAG,GAAG,CAAC;4BAClB,OAAO,KAAK,CAAC;yBACb;qBACD;gBACF,CAAC,CAAC,CAAC;aACH;SACD;QAED,OAAO,WAAW,CAAC;IACpB,CAAC;;AAjfF,gCAkfC;AAjfc,0BAAe,GAAG,GAAG,AAAN,CAAO;AACb,qBAAU,GAAG,IAAI,+BAAc,EAAE,AAAvB,CAAwB;AAQzD;;GAEG;AACW,oBAAS,GAAG,KAAK,AAAR,CAAS;AAuejC,SAAS,mBAAmB,CAAC,KAAY;IACxC,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC,QAAQ,GAAG,IAAI,CAAC;AACtC,CAAC;AAMM,MAAM,kBAAkB,GAAG,CAAC,MAAkB,EAA8B,EAAE;IACpF,OAAO;QACN,WAAW,CAAC,KAAa,EAAE,GAAW;YACrC,MAAM,EAAE,GAAG,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,aAAa,CAAC,KAAa,EAAE,GAAW,EAAE,KAAkB;YAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,kBAAkB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,cAAc,CAAC,GAAW,EAAE,IAAkB;YAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,kBAAkB,CAAC,GAAG,EAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;YACtE,IAAI,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;KACD,CAAC;AACH,CAAC,CAAC;AAfW,QAAA,kBAAkB,sBAe7B;AAeF,SAAgB,QAAQ,CAAC,IAAe;IACvC,MAAM,YAAY,GAAG,CAAC,KAAkB,EAAkB,EAAE;QAC3D,MAAM,KAAK,GAAmB;YAC7B,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,CAAC;YACZ,SAAS,EAAE,CAAC;YACZ,gBAAgB,EAAE,CAAC;YACnB,SAAS,EAAE,CAAC;YACZ,KAAK,EAAE,EAAE;SACT,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gCAAe,EAAE,CAAC,EAAE,EAAE;YACzC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACnB;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE;gBACpB,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;gBACvC,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC;gBAClC,KAAK,CAAC,SAAS,IAAI,UAAU,CAAC,SAAS,CAAC;gBACxC,KAAK,CAAC,SAAS,IAAI,UAAU,CAAC,SAAS,CAAC;gBACxC,KAAK,CAAC,gBAAgB,IAAI,UAAU,CAAC,gBAAgB,CAAC;gBACtD,KAAK,CAAC,SAAS,IAAI,UAAU,CAAC,SAAS,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gCAAe,EAAE,CAAC,EAAE,EAAE;oBACzC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;iBACtC;aACD;iBAAM;gBACN,KAAK,CAAC,SAAS,EAAE,CAAC;gBAClB,MAAM,OAAO,GAAG,KAAK,CAAC;gBACtB,IAAI,OAAO,CAAC,UAAU,KAAK,SAAS,EAAE;oBACrC,KAAK,CAAC,gBAAgB,EAAE,CAAC;iBACzB;aACD;YACD,IAAI,MAAM,GAAG,KAAK,CAAC,SAAS,EAAE;gBAC7B,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC;aACzB;SACD;QACD,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAChC,KAAK,CAAC,SAAS,EAAE,CAAC;QAClB,KAAK,CAAC,SAAS,IAAI,KAAK,CAAC,UAAU,CAAC;QACpC,OAAO,KAAK,CAAC;IACd,CAAC,CAAC;IACF,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,OAAO,SAAS,CAAC;AAClB,CAAC;AA5CD,4BA4CC","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 { makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { createChildLogger } from \"@fluidframework/telemetry-utils\";\nimport {\n\tISequencedDocumentMessage,\n\tISummaryTree,\n\tITree,\n\tMessageType,\n} from \"@fluidframework/protocol-definitions\";\nimport { IFluidDataStoreRuntime } from \"@fluidframework/datastore-definitions\";\nimport { MockStorage } from \"@fluidframework/test-runtime-utils\";\nimport { Trace } from \"@fluid-internal/client-utils\";\nimport { AttributionKey } from \"@fluidframework/runtime-definitions\";\nimport { Client } from \"../client\";\nimport { DoublyLinkedList } from \"../collections\";\nimport { UnassignedSequenceNumber } from \"../constants\";\nimport { IMergeBlock, IMergeLeaf, ISegment, Marker, MaxNodesInBlock } from \"../mergeTreeNodes\";\nimport { createAnnotateRangeOp, createInsertSegmentOp, createRemoveRangeOp } from \"../opBuilder\";\nimport { IJSONSegment, IMarkerDef, IMergeTreeOp, MergeTreeDeltaType, ReferenceType } from \"../ops\";\nimport { PropertySet } from \"../properties\";\nimport { SnapshotLegacy } from \"../snapshotlegacy\";\nimport { TextSegment } from \"../textSegment\";\nimport { getSlideToSegoff, MergeTree } from \"../mergeTree\";\nimport { MergeTreeTextHelper } from \"../MergeTreeTextHelper\";\nimport { IMergeTreeDeltaOpArgs } from \"../mergeTreeDeltaCallback\";\nimport { backwardExcursion, forwardExcursion, walkAllChildSegments } from \"../mergeTreeNodeWalk\";\nimport { DetachedReferencePosition, refHasTileLabel } from \"../referencePositions\";\nimport { MergeTreeRevertibleDriver } from \"../revertibles\";\nimport { IMergeTreeOptions, ReferencePosition } from \"..\";\nimport { TestSerializer } from \"./testSerializer\";\nimport { nodeOrdinalsHaveIntegrity } from \"./testUtils\";\n\nexport function specToSegment(spec: IJSONSegment): ISegment {\n\tconst maybeText = TextSegment.fromJSONObject(spec);\n\tif (maybeText) {\n\t\treturn maybeText;\n\t}\n\n\tconst maybeMarker = Marker.fromJSONObject(spec);\n\tif (maybeMarker) {\n\t\treturn maybeMarker;\n\t}\n\n\tthrow new Error(`Unrecognized IJSONSegment type: '${JSON.stringify(spec)}'`);\n}\n\nconst random = makeRandom(0xdeadbeef, 0xfeedbed);\n\nexport class TestClient extends Client {\n\tpublic static searchChunkSize = 256;\n\tpublic static readonly serializer = new TestSerializer();\n\tpublic measureOps = false;\n\tpublic accumTime = 0;\n\tpublic accumWindowTime = 0;\n\tpublic accumWindow = 0;\n\tpublic accumOps = 0;\n\tpublic maxWindowTime = 0;\n\n\t/**\n\t * Used for in-memory testing.  This will queue a reference string for each client message.\n\t */\n\tpublic static useCheckQ = false;\n\n\tpublic static async createFromClientSnapshot(\n\t\tclient1: TestClient,\n\t\tnewLongClientId: string,\n\t): Promise<TestClient> {\n\t\tconst snapshot = new SnapshotLegacy(\n\t\t\tclient1.mergeTree,\n\t\t\tcreateChildLogger({ namespace: \"fluid:snapshot\" }),\n\t\t);\n\t\tsnapshot.extractSync();\n\t\t// eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\t\tconst summaryTree = snapshot.emit([], TestClient.serializer, undefined!).summary;\n\t\treturn TestClient.createFromSummary(\n\t\t\tsummaryTree,\n\t\t\tnewLongClientId,\n\t\t\tclient1.specToSegment,\n\t\t\tclient1.mergeTree.options,\n\t\t);\n\t}\n\n\tpublic static async createFromSnapshot(\n\t\tsnapshotTree: ITree,\n\t\tnewLongClientId: string,\n\t\tspecToSeg: (spec: IJSONSegment) => ISegment,\n\t\toptions?: PropertySet,\n\t): Promise<TestClient> {\n\t\treturn TestClient.createFromStorage(\n\t\t\tnew MockStorage(snapshotTree),\n\t\t\tnewLongClientId,\n\t\t\tspecToSeg,\n\t\t\toptions,\n\t\t);\n\t}\n\n\tpublic static async createFromSummary(\n\t\tsummaryTree: ISummaryTree,\n\t\tnewLongClientId: string,\n\t\tspecToSeg: (spec: IJSONSegment) => ISegment,\n\t\toptions?: PropertySet,\n\t): Promise<TestClient> {\n\t\treturn TestClient.createFromStorage(\n\t\t\tMockStorage.createFromSummary(summaryTree),\n\t\t\tnewLongClientId,\n\t\t\tspecToSeg,\n\t\t\toptions,\n\t\t);\n\t}\n\n\tpublic static async createFromStorage(\n\t\tstorage: MockStorage,\n\t\tnewLongClientId: string,\n\t\tspecToSeg: (spec: IJSONSegment) => ISegment,\n\t\toptions?: PropertySet,\n\t): Promise<TestClient> {\n\t\tconst client2 = new TestClient(options, specToSeg);\n\t\tconst { catchupOpsP } = await client2.load(\n\t\t\t{\n\t\t\t\tlogger: client2.logger,\n\t\t\t\tclientId: newLongClientId,\n\t\t\t} as any as IFluidDataStoreRuntime,\n\t\t\tstorage,\n\t\t\tTestClient.serializer,\n\t\t);\n\t\tawait catchupOpsP;\n\t\treturn client2;\n\t}\n\n\tpublic readonly mergeTree: MergeTree;\n\n\tpublic readonly checkQ: DoublyLinkedList<string> = new DoublyLinkedList<string>();\n\tprotected readonly q: DoublyLinkedList<ISequencedDocumentMessage> =\n\t\tnew DoublyLinkedList<ISequencedDocumentMessage>();\n\n\tprivate readonly textHelper: MergeTreeTextHelper;\n\tconstructor(options?: IMergeTreeOptions & PropertySet, specToSeg = specToSegment) {\n\t\tsuper(specToSeg, createChildLogger({ namespace: \"fluid:testClient\" }), options);\n\t\tthis.mergeTree = (this as Record<\"_mergeTree\", MergeTree>)._mergeTree;\n\t\tthis.textHelper = new MergeTreeTextHelper(this.mergeTree);\n\n\t\t// Validate by default\n\t\tthis.on(\"delta\", (o, d) => {\n\t\t\t// assert.notEqual(d.deltaSegments.length, 0);\n\t\t\td.deltaSegments.forEach((s) => {\n\t\t\t\tif (d.operation === MergeTreeDeltaType.INSERT) {\n\t\t\t\t\tconst seg: IMergeLeaf = s.segment;\n\t\t\t\t\tassert.notEqual(seg.parent, undefined);\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\t}\n\n\t/**\n\t * @internal\n\t */\n\tpublic obliterateRange({\n\t\tstart,\n\t\tend,\n\t\trefSeq,\n\t\tclientId,\n\t\tseq,\n\t\toverwrite = false,\n\t\topArgs,\n\t}: {\n\t\tstart: number;\n\t\tend: number;\n\t\trefSeq: number;\n\t\tclientId: number;\n\t\tseq: number;\n\t\toverwrite?: boolean;\n\t\topArgs: IMergeTreeDeltaOpArgs;\n\t}): void {\n\t\tthis.mergeTree.obliterateRange(start, end, refSeq, clientId, seq, overwrite, opArgs);\n\t}\n\n\tpublic getText(start?: number, end?: number): string {\n\t\treturn this.textHelper.getText(this.getCurrentSeq(), this.getClientId(), \"\", start, end);\n\t}\n\n\tpublic enqueueTestString() {\n\t\tthis.checkQ.push(this.getText());\n\t}\n\tpublic getMessageCount(): number {\n\t\treturn this.q.length;\n\t}\n\tpublic enqueueMsg(msg: ISequencedDocumentMessage) {\n\t\tthis.q.push(msg);\n\t}\n\tpublic dequeueMsg(): ISequencedDocumentMessage | undefined {\n\t\treturn this.q.shift()?.data;\n\t}\n\tpublic applyMessages(msgCount: number) {\n\t\tlet currMsgCount = msgCount;\n\t\twhile (currMsgCount > 0) {\n\t\t\tconst msg = this.dequeueMsg();\n\t\t\tif (msg) {\n\t\t\t\tthis.applyMsg(msg);\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcurrMsgCount--;\n\t\t}\n\n\t\treturn true;\n\t}\n\n\tpublic insertTextLocal(pos: number, text: string, props?: PropertySet) {\n\t\tconst segment = new TextSegment(text);\n\t\tif (props) {\n\t\t\tsegment.addProperties(props);\n\t\t}\n\t\treturn this.insertSegmentLocal(pos, segment);\n\t}\n\n\tpublic insertTextRemote(\n\t\tpos: number,\n\t\ttext: string,\n\t\tprops: PropertySet | undefined,\n\t\tseq: number,\n\t\trefSeq: number,\n\t\tlongClientId: string,\n\t) {\n\t\tconst segment = new TextSegment(text);\n\t\tif (props) {\n\t\t\tsegment.addProperties(props);\n\t\t}\n\t\tthis.applyMsg(\n\t\t\tthis.makeOpMessage(createInsertSegmentOp(pos, segment), seq, refSeq, longClientId),\n\t\t);\n\t}\n\n\tpublic removeRangeRemote(\n\t\tstart: number,\n\t\tend: number,\n\t\tseq: number,\n\t\trefSeq: number,\n\t\tlongClientId: string,\n\t) {\n\t\tthis.applyMsg(\n\t\t\tthis.makeOpMessage(createRemoveRangeOp(start, end), seq, refSeq, longClientId),\n\t\t);\n\t}\n\n\tpublic annotateRangeRemote(\n\t\tstart: number,\n\t\tend: number,\n\t\tprops: PropertySet,\n\t\tseq: number,\n\t\trefSeq: number,\n\t\tlongClientId: string,\n\t) {\n\t\tthis.applyMsg(\n\t\t\tthis.makeOpMessage(createAnnotateRangeOp(start, end, props), seq, refSeq, longClientId),\n\t\t);\n\t}\n\n\tpublic insertMarkerLocal(pos: number, behaviors: ReferenceType, props?: PropertySet) {\n\t\tconst segment = new Marker(behaviors);\n\t\tif (props) {\n\t\t\tsegment.addProperties(props);\n\t\t}\n\t\treturn this.insertSegmentLocal(pos, segment);\n\t}\n\n\tpublic insertMarkerRemote(\n\t\tpos: number,\n\t\tmarkerDef: IMarkerDef,\n\t\tprops: PropertySet,\n\t\tseq: number,\n\t\trefSeq: number,\n\t\tlongClientId: string,\n\t) {\n\t\tconst segment = new Marker(markerDef.refType ?? ReferenceType.Tile);\n\t\tif (props) {\n\t\t\tsegment.addProperties(props);\n\t\t}\n\t\tthis.applyMsg(\n\t\t\tthis.makeOpMessage(createInsertSegmentOp(pos, segment), seq, refSeq, longClientId),\n\t\t);\n\t}\n\n\tpublic relText(clientId: number, refSeq: number) {\n\t\treturn `cli: ${this.getLongClientId(clientId)} refSeq: ${refSeq}: ${this.textHelper.getText(\n\t\t\trefSeq,\n\t\t\tclientId,\n\t\t)}`;\n\t}\n\n\tpublic makeOpMessage(\n\t\top: IMergeTreeOp | undefined,\n\t\tseq: number = UnassignedSequenceNumber,\n\t\trefSeq: number = this.getCurrentSeq(),\n\t\tlongClientId?: string,\n\t\tminSeqNumber = 0,\n\t) {\n\t\tif (op === undefined) {\n\t\t\tthrow new Error(\"op cannot be undefined\");\n\t\t}\n\t\tconst msg: ISequencedDocumentMessage = {\n\t\t\tclientId: longClientId ?? this.longClientId ?? \"\",\n\t\t\tclientSequenceNumber: 1,\n\t\t\tcontents: op,\n\t\t\tmetadata: undefined,\n\t\t\tminimumSequenceNumber: minSeqNumber,\n\t\t\treferenceSequenceNumber: refSeq,\n\t\t\tsequenceNumber: seq,\n\t\t\ttimestamp: Date.now(),\n\t\t\ttraces: [],\n\t\t\ttype: MessageType.Operation,\n\t\t};\n\t\treturn msg;\n\t}\n\n\tpublic validate() {\n\t\tassert(nodeOrdinalsHaveIntegrity(this.mergeTree.root));\n\t}\n\n\tpublic searchFromPos(pos: number, target: RegExp) {\n\t\tlet start = pos;\n\t\tlet chunk = \"\";\n\t\twhile (start < this.getLength()) {\n\t\t\tchunk = this.getText(start, start + TestClient.searchChunkSize);\n\n\t\t\tconst result = chunk.match(target);\n\t\t\tif (result?.index) {\n\t\t\t\treturn { text: result[0], pos: result.index + start };\n\t\t\t}\n\t\t\tstart += TestClient.searchChunkSize;\n\t\t}\n\t}\n\n\tpublic findRandomWord() {\n\t\tconst len = this.getLength();\n\t\tconst pos = random.integer(0, len);\n\t\tconst nextWord = this.searchFromPos(pos, /\\s\\w+\\b/);\n\t\treturn nextWord;\n\t}\n\n\tpublic debugDumpTree(tree: MergeTree) {\n\t\t// want the segment's content and the state of insert/remove\n\t\tconst test: string[] = [];\n\t\twalkAllChildSegments(tree.root, (segment) => {\n\t\t\tconst prefixes: (string | undefined | number)[] = [];\n\t\t\tprefixes.push(\n\t\t\t\tsegment.seq !== UnassignedSequenceNumber ? segment.seq : `L${segment.localSeq}`,\n\t\t\t);\n\t\t\tif (segment.removedSeq !== undefined) {\n\t\t\t\tprefixes.push(\n\t\t\t\t\tsegment.removedSeq !== UnassignedSequenceNumber\n\t\t\t\t\t\t? segment.removedSeq\n\t\t\t\t\t\t: `L${segment.localRemovedSeq}`,\n\t\t\t\t);\n\t\t\t}\n\t\t\ttest.push(`${prefixes.join(\",\")}:${(segment as any).text}`);\n\t\t});\n\t}\n\n\t/**\n\t * Rebases a (local) position from the perspective `{ seq: seqNumberFrom, localSeq }` to the perspective\n\t * of the current sequence number. This is desirable when rebasing operations for reconnection. Perform\n\t * slow-path computations in this function without leveraging the merge-tree's structure\n\t */\n\tpublic rebasePosition(pos: number, seqNumberFrom: number, localSeq: number): number {\n\t\tlet segment: ISegment | undefined;\n\t\tlet posAccumulated = 0;\n\t\tlet offset = pos;\n\t\tconst isInsertedInView = (seg: ISegment) =>\n\t\t\t(seg.seq !== undefined &&\n\t\t\t\tseg.seq !== UnassignedSequenceNumber &&\n\t\t\t\tseg.seq <= seqNumberFrom) ||\n\t\t\t(seg.localSeq !== undefined && seg.localSeq <= localSeq);\n\n\t\tconst isRemovedFromView = ({ removedSeq, localRemovedSeq }: ISegment) =>\n\t\t\t(removedSeq !== undefined &&\n\t\t\t\tremovedSeq !== UnassignedSequenceNumber &&\n\t\t\t\tremovedSeq <= seqNumberFrom) ||\n\t\t\t(localRemovedSeq !== undefined && localRemovedSeq <= localSeq);\n\n\t\twalkAllChildSegments(this.mergeTree.root, (seg) => {\n\t\t\tassert(\n\t\t\t\tseg.seq !== undefined || seg.localSeq !== undefined,\n\t\t\t\t\"either seq or localSeq should be defined\",\n\t\t\t);\n\t\t\tsegment = seg;\n\n\t\t\tif (isInsertedInView(seg) && !isRemovedFromView(seg)) {\n\t\t\t\tposAccumulated += seg.cachedLength;\n\t\t\t\tif (offset >= seg.cachedLength) {\n\t\t\t\t\toffset -= seg.cachedLength;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Keep going while we've yet to reach the segment at the desired position\n\t\t\treturn posAccumulated <= pos;\n\t\t});\n\n\t\tassert(segment !== undefined, \"No segment found\");\n\t\tconst segoff = getSlideToSegoff({ segment, offset }) ?? segment;\n\t\tif (segoff.segment === undefined || segoff.offset === undefined) {\n\t\t\treturn DetachedReferencePosition;\n\t\t}\n\n\t\treturn this.findReconnectionPosition(segoff.segment, localSeq) + segoff.offset;\n\t}\n\n\tpublic findReconnectionPosition(segment: ISegment, localSeq: number): number {\n\t\tconst fasterComputedPosition = super.findReconnectionPosition(segment, localSeq);\n\n\t\tlet segmentPosition = 0;\n\t\tconst isInsertedInView = (seg: ISegment) =>\n\t\t\tseg.localSeq === undefined || seg.localSeq <= localSeq;\n\t\tconst isRemovedFromView = ({ removedSeq, localRemovedSeq }: ISegment) =>\n\t\t\tremovedSeq !== undefined &&\n\t\t\t(removedSeq !== UnassignedSequenceNumber ||\n\t\t\t\t(localRemovedSeq !== undefined && localRemovedSeq <= localSeq));\n\t\tconst isMovedFromView = ({ movedSeq, localMovedSeq }: ISegment) =>\n\t\t\tmovedSeq !== undefined &&\n\t\t\t(movedSeq !== UnassignedSequenceNumber ||\n\t\t\t\t(localMovedSeq !== undefined && localMovedSeq <= localSeq));\n\t\t/*\n            Walk the segments up to the current segment, and calculate its\n            position taking into account local segments that were modified,\n            after the current segment.\n        */\n\t\twalkAllChildSegments(this.mergeTree.root, (seg) => {\n\t\t\t// If we've found the desired segment, terminate the walk and return 'segmentPosition'.\n\t\t\tif (seg === segment) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\t// Otherwise, advance segmentPosition if the segment has been inserted and not removed\n\t\t\t// with respect to the given 'localSeq'.\n\t\t\t//\n\t\t\t// Note that all ACKed / remote ops are applied and we only need concern ourself with\n\t\t\t// determining if locally pending ops fall before/after the given 'localSeq'.\n\t\t\tif (isInsertedInView(seg) && !isRemovedFromView(seg) && !isMovedFromView(seg)) {\n\t\t\t\tsegmentPosition += seg.cachedLength;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t});\n\n\t\tassert.equal(\n\t\t\tfasterComputedPosition,\n\t\t\tsegmentPosition,\n\t\t\t\"Expected fast-path computation to match result from walk all segments\",\n\t\t);\n\t\treturn segmentPosition;\n\t}\n\n\t/**\n\t * @param channel - Attribution channel name to request information from.\n\t * @returns an array of all attribution seq#s from the current perspective.\n\t * The `i`th entry of the array is the attribution key for the character at position `i`.\n\t * Validates segments either all have attribution information or none of them.\n\t * If no segment has attribution information, returns undefined.\n\t */\n\tpublic getAllAttributionSeqs(channel?: string): (number | AttributionKey | undefined)[] {\n\t\tconst seqs: (number | AttributionKey | undefined)[] = [];\n\t\tthis.walkAllSegments((segment) => {\n\t\t\tfor (let i = 0; i < segment.cachedLength; i++) {\n\t\t\t\tconst key = segment.attribution?.getAtOffset(i, channel);\n\t\t\t\tseqs.push(key?.type === \"op\" ? key.seq : key);\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\n\t\treturn seqs;\n\t}\n\n\t/**\n\t * Override and add some test only metrics\n\t */\n\tpublic applyMsg(msg: ISequencedDocumentMessage, local: boolean = false) {\n\t\tlet traceStart: Trace | undefined;\n\t\tif (this.measureOps) {\n\t\t\ttraceStart = Trace.start();\n\t\t}\n\n\t\tsuper.applyMsg(msg, local);\n\n\t\tif (traceStart) {\n\t\t\tthis.accumTime += elapsedMicroseconds(traceStart);\n\t\t\tthis.accumOps++;\n\t\t\tthis.accumWindow += this.getCurrentSeq() - this.getCollabWindow().minSeq;\n\t\t}\n\t}\n\n\t/**\n\t * Override and add some test only metrics\n\t */\n\tupdateMinSeq(minSeq: number) {\n\t\tlet trace: Trace | undefined;\n\t\tif (this.measureOps) {\n\t\t\ttrace = Trace.start();\n\t\t}\n\n\t\tsuper.updateMinSeq(minSeq);\n\t\tif (trace) {\n\t\t\tconst elapsed = elapsedMicroseconds(trace);\n\t\t\tthis.accumWindowTime += elapsed;\n\t\t\tif (elapsed > this.maxWindowTime) {\n\t\t\t\tthis.maxWindowTime = elapsed;\n\t\t\t}\n\t\t}\n\t}\n\n\tslowSearchForMarker(\n\t\tstartPos: number,\n\t\tmarkerLabel: string,\n\t\tforwards = true,\n\t): ReferencePosition | undefined {\n\t\tlet foundMarker: Marker | undefined;\n\n\t\tconst { segment } = this.getContainingSegment(startPos);\n\t\tconst segWithParent: IMergeLeaf = segment as IMergeLeaf;\n\n\t\tif (Marker.is(segWithParent)) {\n\t\t\tif (refHasTileLabel(segWithParent, markerLabel)) {\n\t\t\t\tfoundMarker = segWithParent;\n\t\t\t}\n\t\t} else {\n\t\t\tif (forwards) {\n\t\t\t\tforwardExcursion(segWithParent, (seg) => {\n\t\t\t\t\tif (Marker.is(seg)) {\n\t\t\t\t\t\tif (refHasTileLabel(seg, markerLabel)) {\n\t\t\t\t\t\t\tfoundMarker = seg;\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t} else {\n\t\t\t\tbackwardExcursion(segWithParent, (seg) => {\n\t\t\t\t\tif (Marker.is(seg)) {\n\t\t\t\t\t\tif (refHasTileLabel(seg, markerLabel)) {\n\t\t\t\t\t\t\tfoundMarker = seg;\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\n\t\treturn foundMarker;\n\t}\n}\n\nfunction elapsedMicroseconds(trace: Trace) {\n\treturn trace.trace().duration * 1000;\n}\n\n// the client doesn't submit ops, so this adds a callback to capture them\nexport type TestClientRevertibleDriver = MergeTreeRevertibleDriver &\n\tPartial<{ submitOpCallback?: (op: IMergeTreeOp | undefined) => void }>;\n\nexport const createRevertDriver = (client: TestClient): TestClientRevertibleDriver => {\n\treturn {\n\t\tremoveRange(start: number, end: number) {\n\t\t\tconst op = client.removeRangeLocal(start, end);\n\t\t\tthis.submitOpCallback?.(op);\n\t\t},\n\t\tannotateRange(start: number, end: number, props: PropertySet) {\n\t\t\tconst op = client.annotateRangeLocal(start, end, props);\n\t\t\tthis.submitOpCallback?.(op);\n\t\t},\n\t\tinsertFromSpec(pos: number, spec: IJSONSegment) {\n\t\t\tconst op = client.insertSegmentLocal(pos, client.specToSegment(spec));\n\t\t\tthis.submitOpCallback?.(op);\n\t\t},\n\t};\n};\n\nexport interface MergeTreeStats {\n\tmaxHeight: number;\n\tnodeCount: number;\n\tleafCount: number;\n\tremovedLeafCount: number;\n\tliveCount: number;\n\thisto: number[];\n\twindowTime?: number;\n\tpackTime?: number;\n\tordTime?: number;\n\tmaxOrdTime?: number;\n}\n\nexport function getStats(tree: MergeTree) {\n\tconst nodeGetStats = (block: IMergeBlock): MergeTreeStats => {\n\t\tconst stats: MergeTreeStats = {\n\t\t\tmaxHeight: 0,\n\t\t\tnodeCount: 0,\n\t\t\tleafCount: 0,\n\t\t\tremovedLeafCount: 0,\n\t\t\tliveCount: 0,\n\t\t\thisto: [],\n\t\t};\n\t\tfor (let k = 0; k < MaxNodesInBlock; k++) {\n\t\t\tstats.histo[k] = 0;\n\t\t}\n\t\tfor (let i = 0; i < block.childCount; i++) {\n\t\t\tconst child = block.children[i];\n\t\t\tlet height = 1;\n\t\t\tif (!child.isLeaf()) {\n\t\t\t\tconst childStats = nodeGetStats(child);\n\t\t\t\theight = 1 + childStats.maxHeight;\n\t\t\t\tstats.nodeCount += childStats.nodeCount;\n\t\t\t\tstats.leafCount += childStats.leafCount;\n\t\t\t\tstats.removedLeafCount += childStats.removedLeafCount;\n\t\t\t\tstats.liveCount += childStats.liveCount;\n\t\t\t\tfor (let j = 0; j < MaxNodesInBlock; j++) {\n\t\t\t\t\tstats.histo[j] += childStats.histo[j];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tstats.leafCount++;\n\t\t\t\tconst segment = child;\n\t\t\t\tif (segment.removedSeq !== undefined) {\n\t\t\t\t\tstats.removedLeafCount++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (height > stats.maxHeight) {\n\t\t\t\tstats.maxHeight = height;\n\t\t\t}\n\t\t}\n\t\tstats.histo[block.childCount]++;\n\t\tstats.nodeCount++;\n\t\tstats.liveCount += block.childCount;\n\t\treturn stats;\n\t};\n\tconst rootStats = nodeGetStats(tree.root);\n\treturn rootStats;\n}\n"]}

package/dist/test/testClientLogger.d.ts

@@ -0,0 +1,44 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { PropertySet } from "../properties";
+import { IMergeTreeOptions } from "..";
+import { TestClient } from "./testClient";
+type ClientMap<TClientName extends string> = Partial<Record<TClientName, TestClient>>;
+export declare function createClientsAtInitialState<TClients extends ClientMap<TClientName>, TClientName extends string = string & keyof TClients>(opts: {
+    initialState: string;
+    options?: IMergeTreeOptions & PropertySet;
+}, ...clientIds: TClientName[]): Record<keyof TClients, TestClient> & {
+    all: TestClient[];
+};
+export declare class TestClientLogger {
+    private readonly clients;
+    private readonly title?;
+    static toString(clients: readonly TestClient[]): string;
+    private readonly incrementalLog;
+    private readonly paddings;
+    private readonly roundLogLines;
+    private ackedLine;
+    private localLine;
+    private lastDeltaArgs;
+    private readonly disposeCallbacks;
+    /**
+     * Unsubscribes this logger from its clients' events. Consider using this for tests with client lifetime
+     * extending significantly past the logger's.
+     */
+    dispose(): void;
+    constructor(clients: readonly TestClient[], title?: string | undefined);
+    private addNewLogLine;
+    validate(opts?: {
+        clear?: boolean;
+        baseText?: string;
+        errorPrefix?: string;
+    }): string;
+    static validate(clients: readonly TestClient[], title?: string): string;
+    toString(excludeHeader?: boolean): string;
+    addLogsToError(e: unknown): Error;
+    private static getSegString;
+}
+export {};
+//# sourceMappingURL=testClientLogger.d.ts.map

package/dist/test/testClientLogger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"testClientLogger.d.ts","sourceRoot":"","sources":["../../src/test/testClientLogger.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAmB,WAAW,EAAE,MAAM,eAAe,CAAC;AAG7D,OAAO,EAAE,iBAAiB,EAAE,MAAM,IAAI,CAAC;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAiC1C,KAAK,SAAS,CAAC,WAAW,SAAS,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC,CAAC;AAEtF,wBAAgB,2BAA2B,CAC1C,QAAQ,SAAS,SAAS,CAAC,WAAW,CAAC,EACvC,WAAW,SAAS,MAAM,GAAG,MAAM,GAAG,MAAM,QAAQ,EAEpD,IAAI,EAAE;IACL,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,iBAAiB,GAAG,WAAW,CAAC;CAC1C,EACD,GAAG,SAAS,EAAE,WAAW,EAAE,GACzB,MAAM,CAAC,MAAM,QAAQ,EAAE,UAAU,CAAC,GAAG;IAAE,GAAG,EAAE,UAAU,EAAE,CAAA;CAAE,CAqB5D;AACD,qBAAa,gBAAgB;IAuC3B,OAAO,CAAC,QAAQ,CAAC,OAAO;IACxB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;WAvCV,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE;IAcrD,OAAO,CAAC,QAAQ,CAAC,cAAc,CAAS;IAExC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAgB;IACzC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAkB;IAEhD,OAAO,CAAC,SAAS,CAAgB;IACjC,OAAO,CAAC,SAAS,CAAgB;IAEjC,OAAO,CAAC,aAAa,CAAoC;IAEzD,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAsB;IAEvD;;;OAGG;IACI,OAAO,IAAI,IAAI;gBAQJ,OAAO,EAAE,SAAS,UAAU,EAAE,EAC9B,KAAK,CAAC,oBAAQ;IA0DhC,OAAO,CAAC,aAAa;IAgCd,QAAQ,CAAC,IAAI,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE;IA+DnF,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,UAAU,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM;IAOvD,QAAQ,CAAC,aAAa,GAAE,OAAe;IAuBvC,cAAc,CAAC,CAAC,EAAE,OAAO,GAAG,KAAK;IASxC,OAAO,CAAC,MAAM,CAAC,YAAY;CAyD3B"}