@fluidframework/merge-tree 1.2.7 → 2.0.0-dev.1.3.0.96595

package/dist/mergeTreeNodes.js

@@ -0,0 +1,383 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.internedSpaces = exports.compareStrings = exports.compareNumbers = exports.CollaborationWindow = exports.IncrementalMapState = exports.IncrementalExecOp = exports.Marker = exports.reservedMarkerSimpleTypeKey = exports.reservedMarkerIdKey = exports.BaseSegment = exports.MergeBlock = exports.MaxNodesInBlock = exports.ordinalToArray = exports.MergeNode = exports.toRemovalInfo = void 0;
+/* eslint-disable @typescript-eslint/no-non-null-assertion */
+/* eslint-disable @typescript-eslint/prefer-optional-chain, no-bitwise */
+const common_utils_1 = require("@fluidframework/common-utils");
+const constants_1 = require("./constants");
+const mergeTreeTracking_1 = require("./mergeTreeTracking");
+const ops_1 = require("./ops");
+const properties_1 = require("./properties");
+const referencePositions_1 = require("./referencePositions");
+const segmentGroupCollection_1 = require("./segmentGroupCollection");
+const segmentPropertiesManager_1 = require("./segmentPropertiesManager");
+function toRemovalInfo(maybe) {
+    if ((maybe === null || maybe === void 0 ? void 0 : maybe.removedClientIds) !== undefined && (maybe === null || maybe === void 0 ? void 0 : maybe.removedSeq) !== undefined) {
+        return maybe;
+    }
+    (0, common_utils_1.assert)((maybe === null || maybe === void 0 ? void 0 : maybe.removedClientIds) === undefined && (maybe === null || maybe === void 0 ? void 0 : maybe.removedSeq) === undefined, 0x2bf /* "both removedClientIds and removedSeq should be set or not set" */);
+}
+exports.toRemovalInfo = toRemovalInfo;
+class MergeNode {
+    constructor() {
+        this.index = 0;
+        this.ordinal = "";
+        this.cachedLength = 0;
+    }
+    isLeaf() {
+        return false;
+    }
+}
+exports.MergeNode = MergeNode;
+function ordinalToArray(ord) {
+    const a = [];
+    if (ord) {
+        for (let i = 0, len = ord.length; i < len; i++) {
+            a.push(ord.charCodeAt(i));
+        }
+    }
+    return a;
+}
+exports.ordinalToArray = ordinalToArray;
+// Note that the actual branching factor of the MergeTree is `MaxNodesInBlock - 1`.  This is because
+// the MergeTree always inserts first, then checks for overflow and splits if the child count equals
+// `MaxNodesInBlock`.  (i.e., `MaxNodesInBlock` contains 1 extra slot for temporary storage to
+// facilitate splits.)
+exports.MaxNodesInBlock = 8;
+class MergeBlock extends MergeNode {
+    constructor(childCount) {
+        super();
+        this.childCount = childCount;
+        this.children = new Array(exports.MaxNodesInBlock);
+    }
+    hierBlock() {
+        return undefined;
+    }
+    setOrdinal(child, index) {
+        let childCount = this.childCount;
+        if (childCount === 8) {
+            childCount = 7;
+        }
+        (0, common_utils_1.assert)((childCount >= 1) && (childCount <= 7), 0x040 /* "Child count is not within [1,7] range!" */);
+        let localOrdinal;
+        const ordinalWidth = 1 << (exports.MaxNodesInBlock - (childCount + 1));
+        if (index === 0) {
+            localOrdinal = ordinalWidth - 1;
+        }
+        else {
+            const prevOrd = this.children[index - 1].ordinal;
+            const prevOrdCode = prevOrd.charCodeAt(prevOrd.length - 1);
+            localOrdinal = prevOrdCode + ordinalWidth;
+        }
+        child.ordinal = this.ordinal + String.fromCharCode(localOrdinal);
+        (0, common_utils_1.assert)(child.ordinal.length === (this.ordinal.length + 1), 0x041 /* "Unexpected child ordinal length!" */);
+        if (index > 0) {
+            (0, common_utils_1.assert)(child.ordinal > this.children[index - 1].ordinal, 0x042);
+        }
+    }
+    assignChild(child, index, updateOrdinal = true) {
+        child.parent = this;
+        child.index = index;
+        if (updateOrdinal) {
+            this.setOrdinal(child, index);
+        }
+        this.children[index] = child;
+    }
+}
+exports.MergeBlock = MergeBlock;
+class BaseSegment extends MergeNode {
+    constructor() {
+        super(...arguments);
+        this.clientId = constants_1.LocalClientId;
+        this.seq = constants_1.UniversalSequenceNumber;
+        this.segmentGroups = new segmentGroupCollection_1.SegmentGroupCollection(this);
+        this.trackingCollection = new mergeTreeTracking_1.TrackingGroupCollection(this);
+    }
+    addProperties(newProps, op, seq, collabWindow, rollback = segmentPropertiesManager_1.PropertiesRollback.None) {
+        if (!this.propertyManager) {
+            this.propertyManager = new segmentPropertiesManager_1.PropertiesManager();
+        }
+        if (!this.properties) {
+            this.properties = (0, properties_1.createMap)();
+        }
+        return this.propertyManager.addProperties(this.properties, newProps, op, seq, collabWindow && collabWindow.collaborating, rollback);
+    }
+    hasProperty(key) {
+        return !!this.properties && (this.properties[key] !== undefined);
+    }
+    isLeaf() {
+        return true;
+    }
+    cloneInto(b) {
+        var _a;
+        b.clientId = this.clientId;
+        // TODO: deep clone properties
+        b.properties = (0, properties_1.clone)(this.properties);
+        b.removedClientIds = (_a = this.removedClientIds) === null || _a === void 0 ? void 0 : _a.slice();
+        // TODO: copy removed client overlap and branch removal info
+        b.removedSeq = this.removedSeq;
+        b.seq = this.seq;
+    }
+    canAppend(segment) {
+        return false;
+    }
+    addSerializedProps(jseg) {
+        if (this.properties) {
+            jseg.props = this.properties;
+        }
+    }
+    /**
+     * @deprecated  for internal use only. public export will be removed.
+     * @internal
+     */
+    ack(segmentGroup, opArgs, mergeTree) {
+        const currentSegmentGroup = this.segmentGroups.dequeue();
+        (0, common_utils_1.assert)(currentSegmentGroup === segmentGroup, 0x043 /* "On ack, unexpected segmentGroup!" */);
+        switch (opArgs.op.type) {
+            case ops_1.MergeTreeDeltaType.ANNOTATE:
+                (0, common_utils_1.assert)(!!this.propertyManager, 0x044 /* "On annotate ack, missing segment property manager!" */);
+                this.propertyManager.ackPendingProperties(opArgs.op);
+                return true;
+            case ops_1.MergeTreeDeltaType.INSERT:
+                (0, common_utils_1.assert)(this.seq === constants_1.UnassignedSequenceNumber, 0x045 /* "On insert, seq number already assigned!" */);
+                this.seq = opArgs.sequencedMessage.sequenceNumber;
+                this.localSeq = undefined;
+                return true;
+            case ops_1.MergeTreeDeltaType.REMOVE:
+                const removalInfo = toRemovalInfo(this);
+                (0, common_utils_1.assert)(removalInfo !== undefined, 0x046 /* "On remove ack, missing removal info!" */);
+                this.localRemovedSeq = undefined;
+                if (removalInfo.removedSeq === constants_1.UnassignedSequenceNumber) {
+                    removalInfo.removedSeq = opArgs.sequencedMessage.sequenceNumber;
+                    return true;
+                }
+                return false;
+            default:
+                throw new Error(`${opArgs.op.type} is in unrecognized operation type`);
+        }
+    }
+    splitAt(pos) {
+        var _a;
+        if (pos > 0) {
+            const leafSegment = this.createSplitSegmentAt(pos);
+            if (leafSegment) {
+                this.copyPropertiesTo(leafSegment);
+                leafSegment.parent = this.parent;
+                // Give the leaf a temporary yet valid ordinal.
+                // when this segment is put in the tree, it will get its real ordinal,
+                // but this ordinal meets all the necessary invariants for now.
+                leafSegment.ordinal = this.ordinal + String.fromCharCode(0);
+                leafSegment.removedClientIds = (_a = this.removedClientIds) === null || _a === void 0 ? void 0 : _a.slice();
+                leafSegment.removedSeq = this.removedSeq;
+                leafSegment.localRemovedSeq = this.localRemovedSeq;
+                leafSegment.seq = this.seq;
+                leafSegment.localSeq = this.localSeq;
+                leafSegment.clientId = this.clientId;
+                this.segmentGroups.copyTo(leafSegment);
+                this.trackingCollection.copyTo(leafSegment);
+                if (this.localRefs) {
+                    this.localRefs.split(pos, leafSegment);
+                }
+            }
+            return leafSegment;
+        }
+    }
+    copyPropertiesTo(other) {
+        if (this.propertyManager) {
+            if (this.properties) {
+                other.propertyManager = new segmentPropertiesManager_1.PropertiesManager();
+                other.properties = this.propertyManager.copyTo(this.properties, other.properties, other.propertyManager);
+            }
+        }
+    }
+}
+exports.BaseSegment = BaseSegment;
+exports.reservedMarkerIdKey = "markerId";
+exports.reservedMarkerSimpleTypeKey = "markerSimpleType";
+class Marker extends BaseSegment {
+    constructor(refType) {
+        super();
+        this.refType = refType;
+        this.type = Marker.type;
+        this.cachedLength = 1;
+    }
+    static is(segment) {
+        return segment.type === Marker.type;
+    }
+    static make(refType, props) {
+        const marker = new Marker(refType);
+        if (props) {
+            marker.addProperties(props);
+        }
+        return marker;
+    }
+    toJSONObject() {
+        const obj = { marker: { refType: this.refType } };
+        super.addSerializedProps(obj);
+        return obj;
+    }
+    static fromJSONObject(spec) {
+        if (spec && typeof spec === "object" && "marker" in spec) {
+            return Marker.make(spec.marker.refType, spec.props);
+        }
+        return undefined;
+    }
+    clone() {
+        const b = Marker.make(this.refType, this.properties);
+        this.cloneInto(b);
+        return b;
+    }
+    getSegment() {
+        return this;
+    }
+    getOffset() {
+        return 0;
+    }
+    hasSimpleType(simpleTypeName) {
+        return !!this.properties &&
+            this.properties[exports.reservedMarkerSimpleTypeKey] === simpleTypeName;
+    }
+    getProperties() {
+        return this.properties;
+    }
+    getId() {
+        if (this.properties && this.properties[exports.reservedMarkerIdKey]) {
+            return this.properties[exports.reservedMarkerIdKey];
+        }
+    }
+    toString() {
+        let bbuf = "";
+        if ((0, referencePositions_1.refTypeIncludesFlag)(this, ops_1.ReferenceType.Tile)) {
+            bbuf += "Tile";
+        }
+        if ((0, referencePositions_1.refTypeIncludesFlag)(this, ops_1.ReferenceType.NestBegin)) {
+            if (bbuf.length > 0) {
+                bbuf += "; ";
+            }
+            bbuf += "RangeBegin";
+        }
+        if ((0, referencePositions_1.refTypeIncludesFlag)(this, ops_1.ReferenceType.NestEnd)) {
+            if (bbuf.length > 0) {
+                bbuf += "; ";
+            }
+            bbuf += "RangeEnd";
+        }
+        let lbuf = "";
+        const id = this.getId();
+        if (id) {
+            bbuf += ` (${id}) `;
+        }
+        const tileLabels = (0, referencePositions_1.refGetTileLabels)(this);
+        if (tileLabels) {
+            lbuf += "tile -- ";
+            for (let i = 0, len = tileLabels.length; i < len; i++) {
+                const tileLabel = tileLabels[i];
+                if (i > 0) {
+                    lbuf += "; ";
+                }
+                lbuf += tileLabel;
+            }
+        }
+        const rangeLabels = (0, referencePositions_1.refGetRangeLabels)(this);
+        if (rangeLabels) {
+            let rangeKind = "begin";
+            if ((0, referencePositions_1.refTypeIncludesFlag)(this, ops_1.ReferenceType.NestEnd)) {
+                rangeKind = "end";
+            }
+            if (tileLabels) {
+                lbuf += " ";
+            }
+            lbuf += `range ${rangeKind} -- `;
+            const labels = rangeLabels;
+            for (let i = 0, len = labels.length; i < len; i++) {
+                const rangeLabel = labels[i];
+                if (i > 0) {
+                    lbuf += "; ";
+                }
+                lbuf += rangeLabel;
+            }
+        }
+        let pbuf = "";
+        if (this.properties) {
+            pbuf += JSON.stringify(this.properties, (key, value) => {
+                // Avoid circular reference when stringifying makers containing handles.
+                // (Substitute a debug string instead.)
+                const handle = !!value && value.IFluidHandle;
+                // eslint-disable-next-line @typescript-eslint/no-unsafe-return
+                return handle
+                    ? `#Handle(${handle.routeContext.path}/${handle.path})`
+                    : value;
+            });
+        }
+        return `M ${bbuf}: ${lbuf} ${pbuf}`;
+    }
+    createSplitSegmentAt(pos) {
+        return undefined;
+    }
+    canAppend(segment) {
+        return false;
+    }
+    append() { throw new Error("Can not append to marker"); }
+}
+exports.Marker = Marker;
+Marker.type = "Marker";
+var IncrementalExecOp;
+(function (IncrementalExecOp) {
+    IncrementalExecOp[IncrementalExecOp["Go"] = 0] = "Go";
+    IncrementalExecOp[IncrementalExecOp["Stop"] = 1] = "Stop";
+    IncrementalExecOp[IncrementalExecOp["Yield"] = 2] = "Yield";
+})(IncrementalExecOp = exports.IncrementalExecOp || (exports.IncrementalExecOp = {}));
+class IncrementalMapState {
+    constructor(block, actions, pos, refSeq, clientId, context, start, end, childIndex = 0) {
+        this.block = block;
+        this.actions = actions;
+        this.pos = pos;
+        this.refSeq = refSeq;
+        this.clientId = clientId;
+        this.context = context;
+        this.start = start;
+        this.end = end;
+        this.childIndex = childIndex;
+        this.op = IncrementalExecOp.Go;
+    }
+}
+exports.IncrementalMapState = IncrementalMapState;
+class CollaborationWindow {
+    constructor() {
+        this.clientId = constants_1.LocalClientId;
+        this.collaborating = false;
+        // Lowest-numbered segment in window; no client can reference a state before this one
+        this.minSeq = 0;
+        // Highest-numbered segment in window and current
+        // reference segment for this client
+        this.currentSeq = 0;
+        this.localSeq = 0;
+    }
+    loadFrom(a) {
+        this.clientId = a.clientId;
+        this.collaborating = a.collaborating;
+        this.minSeq = a.minSeq;
+        this.currentSeq = a.currentSeq;
+    }
+}
+exports.CollaborationWindow = CollaborationWindow;
+const compareNumbers = (a, b) => a - b;
+exports.compareNumbers = compareNumbers;
+const compareStrings = (a, b) => a.localeCompare(b);
+exports.compareStrings = compareStrings;
+const indentStrings = ["", " ", "  "];
+function internedSpaces(n) {
+    if (indentStrings[n] === undefined) {
+        indentStrings[n] = "";
+        for (let i = 0; i < n; i++) {
+            indentStrings[n] += " ";
+        }
+    }
+    return indentStrings[n];
+}
+exports.internedSpaces = internedSpaces;
+//# sourceMappingURL=mergeTreeNodes.js.map

package/dist/mergeTreeNodes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeTreeNodes.js","sourceRoot":"","sources":["../src/mergeTreeNodes.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,6DAA6D;AAE7D,yEAAyE;AAEzE,+DAAsD;AACtD,2CAIqB;AASrB,2DAA8D;AAC9D,+BAMe;AAEf,6CAKsB;AACtB,6DAM+B;AAC/B,qEAAkE;AAClE,yEAAmF;AA4FnF,SAAgB,aAAa,CAAC,KAAwC;IAClE,IAAI,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,gBAAgB,MAAK,SAAS,IAAI,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,UAAU,MAAK,SAAS,EAAE;QAC1E,OAAO,KAAqB,CAAC;KAChC;IACD,IAAA,qBAAM,EAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,gBAAgB,MAAK,SAAS,IAAI,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,UAAU,MAAK,SAAS,EAC3E,KAAK,CAAC,qEAAqE,CAAC,CAAC;AACrF,CAAC;AAND,sCAMC;AA8KD,MAAa,SAAS;IAAtB;QACI,UAAK,GAAW,CAAC,CAAC;QAClB,YAAO,GAAW,EAAE,CAAC;QAErB,iBAAY,GAAW,CAAC,CAAC;IAK7B,CAAC;IAHG,MAAM;QACF,OAAO,KAAK,CAAC;IACjB,CAAC;CACJ;AATD,8BASC;AACD,SAAgB,cAAc,CAAC,GAAW;IACtC,MAAM,CAAC,GAAa,EAAE,CAAC;IACvB,IAAI,GAAG,EAAE;QACL,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC5C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;KACJ;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AARD,wCAQC;AAED,oGAAoG;AACpG,oGAAoG;AACpG,8FAA8F;AAC9F,sBAAsB;AACT,QAAA,eAAe,GAAG,CAAC,CAAC;AAEjC,MAAa,UAAW,SAAQ,SAAS;IAErC,YAA0B,UAAkB;QACxC,KAAK,EAAE,CAAC;QADc,eAAU,GAAV,UAAU,CAAQ;QAExC,IAAI,CAAC,QAAQ,GAAG,IAAI,KAAK,CAAa,uBAAe,CAAC,CAAC;IAC3D,CAAC;IAEM,SAAS;QACZ,OAAO,SAAS,CAAC;IACrB,CAAC;IAEM,UAAU,CAAC,KAAiB,EAAE,KAAa;QAC9C,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACjC,IAAI,UAAU,KAAK,CAAC,EAAE;YAClB,UAAU,GAAG,CAAC,CAAC;SAClB;QACD,IAAA,qBAAM,EAAC,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,8CAA8C,CAAC,CAAC;QACrG,IAAI,YAAoB,CAAC;QACzB,MAAM,YAAY,GAAG,CAAC,IAAI,CAAC,uBAAe,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,KAAK,KAAK,CAAC,EAAE;YACb,YAAY,GAAG,YAAY,GAAG,CAAC,CAAC;SACnC;aAAM;YACH,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YACjD,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC3D,YAAY,GAAG,WAAW,GAAG,YAAY,CAAC;SAC7C;QACD,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QACjE,IAAA,qBAAM,EAAC,KAAK,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC3G,IAAI,KAAK,GAAG,CAAC,EAAE;YACX,IAAA,qBAAM,EACF,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,OAAO,EAChD,KAAK,CACR,CAAC;SACL;IACL,CAAC;IAEM,WAAW,CAAC,KAAiB,EAAE,KAAa,EAAE,aAAa,GAAG,IAAI;QACrE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;QACpB,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC;QACpB,IAAI,aAAa,EAAE;YACf,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IACjC,CAAC;CACJ;AA5CD,gCA4CC;AAED,MAAsB,WAAY,SAAQ,SAAS;IAAnD;;QACW,aAAQ,GAAW,yBAAa,CAAC;QACjC,QAAG,GAAW,mCAAuB,CAAC;QAG7B,kBAAa,GAA2B,IAAI,+CAAsB,CAAC,IAAI,CAAC,CAAC;QACzE,uBAAkB,GAA4B,IAAI,2CAAuB,CAAC,IAAI,CAAC,CAAC;IAsIpG,CAAC;IA9HU,aAAa,CAAC,QAAqB,EAAE,EAAiB,EAAE,GAAY,EACvE,YAAkC,EAAE,WAA+B,6CAAkB,CAAC,IAAI;QAC1F,IAAI,CAAC,IAAI,CAAC,eAAe,EAAE;YACvB,IAAI,CAAC,eAAe,GAAG,IAAI,4CAAiB,EAAE,CAAC;SAClD;QACD,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,IAAI,CAAC,UAAU,GAAG,IAAA,sBAAS,GAAO,CAAC;SACtC;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,aAAa,CACrC,IAAI,CAAC,UAAU,EACf,QAAQ,EACR,EAAE,EACF,GAAG,EACH,YAAY,IAAI,YAAY,CAAC,aAAa,EAC1C,QAAQ,CACX,CAAC;IACN,CAAC;IAEM,WAAW,CAAC,GAAW;QAC1B,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC;IACrE,CAAC;IAEM,MAAM;QACT,OAAO,IAAI,CAAC;IAChB,CAAC;IAES,SAAS,CAAC,CAAW;;QAC3B,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC3B,8BAA8B;QAC9B,CAAC,CAAC,UAAU,GAAG,IAAA,kBAAK,EAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACtC,CAAC,CAAC,gBAAgB,GAAG,MAAA,IAAI,CAAC,gBAAgB,0CAAE,KAAK,EAAE,CAAC;QACpD,4DAA4D;QAC5D,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;IACrB,CAAC;IAEM,SAAS,CAAC,OAAiB;QAC9B,OAAO,KAAK,CAAC;IACjB,CAAC;IAES,kBAAkB,CAAC,IAAkB;QAC3C,IAAI,IAAI,CAAC,UAAU,EAAE;YACjB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;SAChC;IACL,CAAC;IAID;;;OAGG;IACI,GAAG,CAAC,YAA0B,EAAE,MAA6B,EAAE,SAAoB;QACtF,MAAM,mBAAmB,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;QACzD,IAAA,qBAAM,EAAC,mBAAmB,KAAK,YAAY,EAAE,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC7F,QAAQ,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE;YACpB,KAAK,wBAAkB,CAAC,QAAQ;gBAC5B,IAAA,qBAAM,EAAC,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,0DAA0D,CAAC,CAAC;gBACjG,IAAI,CAAC,eAAe,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACrD,OAAO,IAAI,CAAC;YAEhB,KAAK,wBAAkB,CAAC,MAAM;gBAC1B,IAAA,qBAAM,EAAC,IAAI,CAAC,GAAG,KAAK,oCAAwB,EAAE,KAAK,CAAC,+CAA+C,CAAC,CAAC;gBACrG,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,gBAAiB,CAAC,cAAc,CAAC;gBACnD,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC1B,OAAO,IAAI,CAAC;YAEhB,KAAK,wBAAkB,CAAC,MAAM;gBAC1B,MAAM,WAAW,GAA6B,aAAa,CAAC,IAAI,CAAC,CAAC;gBAClE,IAAA,qBAAM,EAAC,WAAW,KAAK,SAAS,EAAE,KAAK,CAAC,4CAA4C,CAAC,CAAC;gBACtF,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;gBACjC,IAAI,WAAW,CAAC,UAAU,KAAK,oCAAwB,EAAE;oBACrD,WAAW,CAAC,UAAU,GAAG,MAAM,CAAC,gBAAiB,CAAC,cAAc,CAAC;oBACjE,OAAO,IAAI,CAAC;iBACf;gBACD,OAAO,KAAK,CAAC;YAEjB;gBACI,MAAM,IAAI,KAAK,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,oCAAoC,CAAC,CAAC;SAC9E;IACL,CAAC;IAEM,OAAO,CAAC,GAAW;;QACtB,IAAI,GAAG,GAAG,CAAC,EAAE;YACT,MAAM,WAAW,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YACnD,IAAI,WAAW,EAAE;gBACb,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;gBACnC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAEjC,+CAA+C;gBAC/C,sEAAsE;gBACtE,+DAA+D;gBAC/D,WAAW,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;gBAE5D,WAAW,CAAC,gBAAgB,GAAG,MAAA,IAAI,CAAC,gBAAgB,0CAAE,KAAK,EAAE,CAAC;gBAC9D,WAAW,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;gBACzC,WAAW,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC;gBACnD,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;gBAC3B,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBACrC,WAAW,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;gBACrC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBACvC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAC5C,IAAI,IAAI,CAAC,SAAS,EAAE;oBAChB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;iBAC1C;aACJ;YACD,OAAO,WAAW,CAAC;SACtB;IACL,CAAC;IAEO,gBAAgB,CAAC,KAAe;QACpC,IAAI,IAAI,CAAC,eAAe,EAAE;YACtB,IAAI,IAAI,CAAC,UAAU,EAAE;gBACjB,KAAK,CAAC,eAAe,GAAG,IAAI,4CAAiB,EAAE,CAAC;gBAChD,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAC1C,IAAI,CAAC,UAAU,EACf,KAAK,CAAC,UAAU,EAChB,KAAK,CAAC,eAAe,CACxB,CAAC;aACL;SACJ;IACL,CAAC;CAKJ;AA5ID,kCA4IC;AAEY,QAAA,mBAAmB,GAAG,UAAU,CAAC;AACjC,QAAA,2BAA2B,GAAG,kBAAkB,CAAC;AAM9D,MAAa,MAAO,SAAQ,WAAW;IAgBnC,YAAmB,OAAsB;QACrC,KAAK,EAAE,CAAC;QADO,YAAO,GAAP,OAAO,CAAe;QAXzB,SAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QAa/B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;IAC1B,CAAC;IAjBM,MAAM,CAAC,EAAE,CAAC,OAAiB;QAC9B,OAAO,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC;IACxC,CAAC;IAGM,MAAM,CAAC,IAAI,CACd,OAAsB,EAAE,KAAmB;QAC3C,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,KAAK,EAAE;YACP,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;SAC/B;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAOD,YAAY;QACR,MAAM,GAAG,GAAuB,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC;QACtE,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;QAC9B,OAAO,GAAG,CAAC;IACf,CAAC;IAED,MAAM,CAAC,cAAc,CAAC,IAAS;QAC3B,IAAI,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,IAAI,QAAQ,IAAI,IAAI,EAAE;YACtD,OAAO,MAAM,CAAC,IAAI,CACd,IAAI,CAAC,MAAM,CAAC,OAAO,EACnB,IAAI,CAAC,KAAoB,CAAC,CAAC;SAClC;QACD,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,KAAK;QACD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACb,CAAC;IAED,UAAU;QACN,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,SAAS;QACL,OAAO,CAAC,CAAC;IACb,CAAC;IAED,aAAa,CAAC,cAAsB;QAChC,OAAO,CAAC,CAAC,IAAI,CAAC,UAAU;YACpB,IAAI,CAAC,UAAU,CAAC,mCAA2B,CAAC,KAAK,cAAc,CAAC;IACxE,CAAC;IAED,aAAa;QACT,OAAO,IAAI,CAAC,UAAU,CAAC;IAC3B,CAAC;IAED,KAAK;QACD,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,2BAAmB,CAAC,EAAE;YACzD,OAAO,IAAI,CAAC,UAAU,CAAC,2BAAmB,CAAW,CAAC;SACzD;IACL,CAAC;IAED,QAAQ;QACJ,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,IAAA,wCAAmB,EAAC,IAAI,EAAE,mBAAa,CAAC,IAAI,CAAC,EAAE;YAC/C,IAAI,IAAI,MAAM,CAAC;SAClB;QACD,IAAI,IAAA,wCAAmB,EAAC,IAAI,EAAE,mBAAa,CAAC,SAAS,CAAC,EAAE;YACpD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACjB,IAAI,IAAI,IAAI,CAAC;aAChB;YACD,IAAI,IAAI,YAAY,CAAC;SACxB;QACD,IAAI,IAAA,wCAAmB,EAAC,IAAI,EAAE,mBAAa,CAAC,OAAO,CAAC,EAAE;YAClD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;gBACjB,IAAI,IAAI,IAAI,CAAC;aAChB;YACD,IAAI,IAAI,UAAU,CAAC;SACtB;QACD,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACxB,IAAI,EAAE,EAAE;YACJ,IAAI,IAAI,KAAK,EAAE,IAAI,CAAC;SACvB;QACD,MAAM,UAAU,GAAG,IAAA,qCAAgB,EAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,UAAU,EAAE;YACZ,IAAI,IAAI,UAAU,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBACnD,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;gBAChC,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,IAAI,IAAI,IAAI,CAAC;iBAChB;gBACD,IAAI,IAAI,SAAS,CAAC;aACrB;SACJ;QACD,MAAM,WAAW,GAAG,IAAA,sCAAiB,EAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,WAAW,EAAE;YACb,IAAI,SAAS,GAAG,OAAO,CAAC;YACxB,IAAI,IAAA,wCAAmB,EAAC,IAAI,EAAE,mBAAa,CAAC,OAAO,CAAC,EAAE;gBAClD,SAAS,GAAG,KAAK,CAAC;aACrB;YACD,IAAI,UAAU,EAAE;gBACZ,IAAI,IAAI,GAAG,CAAC;aACf;YACD,IAAI,IAAI,SAAS,SAAS,MAAM,CAAC;YACjC,MAAM,MAAM,GAAG,WAAW,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC/C,MAAM,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,EAAE;oBACP,IAAI,IAAI,IAAI,CAAC;iBAChB;gBACD,IAAI,IAAI,UAAU,CAAC;aACtB;SACJ;QACD,IAAI,IAAI,GAAG,EAAE,CAAC;QACd,IAAI,IAAI,CAAC,UAAU,EAAE;YACjB,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;gBACnD,wEAAwE;gBACxE,uCAAuC;gBACvC,MAAM,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,KAAK,CAAC,YAAY,CAAC;gBAE7C,+DAA+D;gBAC/D,OAAO,MAAM;oBACT,CAAC,CAAC,WAAW,MAAM,CAAC,YAAY,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,GAAG;oBACvD,CAAC,CAAC,KAAK,CAAC;YAChB,CAAC,CAAC,CAAC;SACN;QACD,OAAO,KAAK,IAAI,KAAK,IAAI,IAAI,IAAI,EAAE,CAAC;IACxC,CAAC;IAES,oBAAoB,CAAC,GAAW;QACtC,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,SAAS,CAAC,OAAiB;QACvB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,MAAM,KAAK,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,CAAC,CAAC;;AA7I7D,wBA8IC;AA7I0B,WAAI,GAAG,QAAQ,CAAC;AA+I3C,IAAY,iBAIX;AAJD,WAAY,iBAAiB;IACzB,qDAAE,CAAA;IACF,yDAAI,CAAA;IACJ,2DAAK,CAAA;AACT,CAAC,EAJW,iBAAiB,GAAjB,yBAAiB,KAAjB,yBAAiB,QAI5B;AAED,MAAa,mBAAmB;IAE5B,YACW,KAAkB,EAClB,OAA4C,EAC5C,GAAW,EACX,MAAc,EACd,QAAgB,EAChB,OAAiB,EACjB,KAAa,EACb,GAAW,EACX,aAAa,CAAC;QARd,UAAK,GAAL,KAAK,CAAa;QAClB,YAAO,GAAP,OAAO,CAAqC;QAC5C,QAAG,GAAH,GAAG,CAAQ;QACX,WAAM,GAAN,MAAM,CAAQ;QACd,aAAQ,GAAR,QAAQ,CAAQ;QAChB,YAAO,GAAP,OAAO,CAAU;QACjB,UAAK,GAAL,KAAK,CAAQ;QACb,QAAG,GAAH,GAAG,CAAQ;QACX,eAAU,GAAV,UAAU,CAAI;QAVzB,OAAE,GAAG,iBAAiB,CAAC,EAAE,CAAC;IAY1B,CAAC;CACJ;AAdD,kDAcC;AAED,MAAa,mBAAmB;IAAhC;QACI,aAAQ,GAAG,yBAAa,CAAC;QACzB,kBAAa,GAAG,KAAK,CAAC;QACtB,qFAAqF;QACrF,WAAM,GAAG,CAAC,CAAC;QACX,iDAAiD;QACjD,oCAAoC;QACpC,eAAU,GAAG,CAAC,CAAC;QAEf,aAAQ,GAAG,CAAC,CAAC;IAQjB,CAAC;IANG,QAAQ,CAAC,CAAsB;QAC3B,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC;QACrC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;IACnC,CAAC;CACJ;AAjBD,kDAiBC;AAEM,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;AAAjD,QAAA,cAAc,kBAAmC;AAEvD,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;AAA9D,QAAA,cAAc,kBAAgD;AAE3E,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;AACtC,SAAgB,cAAc,CAAC,CAAS;IACpC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;QAChC,aAAa,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,aAAa,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;SAC3B;KACJ;IACD,OAAO,aAAa,CAAC,CAAC,CAAC,CAAC;AAC5B,CAAC;AARD,wCAQC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable @typescript-eslint/no-non-null-assertion */\n\n/* eslint-disable @typescript-eslint/prefer-optional-chain, no-bitwise */\n\nimport { assert } from \"@fluidframework/common-utils\";\nimport {\n    LocalClientId,\n    UnassignedSequenceNumber,\n    UniversalSequenceNumber,\n} from \"./constants\";\nimport {\n     LocalReferenceCollection,\n     LocalReferencePosition,\n} from \"./localReference\";\nimport { MergeTree } from \"./mergeTree\";\nimport {\n    IMergeTreeDeltaOpArgs,\n} from \"./mergeTreeDeltaCallback\";\nimport { TrackingGroupCollection } from \"./mergeTreeTracking\";\nimport {\n    ICombiningOp,\n    IJSONSegment,\n    IMarkerDef,\n    MergeTreeDeltaType,\n    ReferenceType,\n} from \"./ops\";\nimport { PartialSequenceLengths } from \"./partialLengths\";\nimport {\n    clone,\n    createMap,\n    MapLike,\n    PropertySet,\n} from \"./properties\";\nimport {\n    refTypeIncludesFlag,\n    RangeStackMap,\n    ReferencePosition,\n    refGetRangeLabels,\n    refGetTileLabels,\n } from \"./referencePositions\";\nimport { SegmentGroupCollection } from \"./segmentGroupCollection\";\nimport { PropertiesManager, PropertiesRollback } from \"./segmentPropertiesManager\";\n\n/**\n * Common properties for a node in a merge tree.\n */\nexport interface IMergeNodeCommon {\n    parent?: IMergeBlock;\n    /**\n     * The length of the contents of the node.\n     */\n    cachedLength: number;\n    /**\n     * The index of this node in its parent's list of children.\n     */\n    index: number;\n    /**\n     * A string that can be used for comparing the location of this node to other `MergeNode`s in the same tree.\n     * `a.ordinal < b.ordinal` if and only if `a` comes before `b` in a pre-order traversal of the tree.\n     */\n    ordinal: string;\n    isLeaf(): this is ISegment;\n}\n\nexport type IMergeNode = IMergeBlock | ISegment;\n\n/**\n * Internal (i.e. non-leaf) node in a merge tree.\n */\nexport interface IMergeBlock extends IMergeNodeCommon {\n    needsScour?: boolean;\n    /**\n     * Number of direct children of this node\n     */\n    childCount: number;\n    /**\n     * Array of child nodes.\n     *\n     * @remarks To avoid reallocation, this is always initialized to have maximum length as deemed by\n     * the merge tree's branching factor. Use `childCount` to determine how many children this node actually has.\n     */\n    children: IMergeNode[];\n    /**\n     * Supports querying the total length of all descendants of this IMergeBlock from the perspective of any\n     * (clientId, seq) within the collab window.\n     *\n     * @remarks This is only optional for implementation reasons (internal nodes can be created/moved without\n     * immediately initializing the partial lengths). Aside from mid-update on tree operations, these lengths\n     * objects are always defined.\n     */\n    partialLengths?: PartialSequenceLengths;\n    hierBlock(): IHierBlock | undefined;\n    assignChild(child: IMergeNode, index: number, updateOrdinal?: boolean): void;\n    setOrdinal(child: IMergeNode, index: number): void;\n}\n\nexport interface IHierBlock extends IMergeBlock {\n    hierToString(indentCount: number): string;\n    /**\n     * @deprecated  for internal use only. public export will be removed.\n     * @internal\n     */\n    addNodeReferences(mergeTree: MergeTree, node: IMergeNode): void;\n    rightmostTiles: MapLike<ReferencePosition>;\n    leftmostTiles: MapLike<ReferencePosition>;\n    /**\n     * @deprecated  for internal use only. public export will be removed.\n     * @internal\n     */\n    rangeStacks: RangeStackMap;\n}\n\n/**\n * Contains removal information associated to an {@link ISegment}.\n */\nexport interface IRemovalInfo {\n    /**\n     * Local seq at which this segment was removed, if the removal is yet-to-be acked.\n     */\n    localRemovedSeq?: number;\n    /**\n     * Seq at which this segment was removed.\n     */\n    removedSeq: number;\n    /**\n     * List of client IDs that have removed this segment.\n     * The client that actually removed the segment (i.e. whose removal op was sequenced first) is stored as the first\n     * client in this list. Other clients in the list have all issued concurrent ops to remove the segment.\n     * @remarks When this list has length \\> 1, this is referred to as the \"overlapping remove\" case.\n     */\n    removedClientIds: number[];\n}\n\nexport function toRemovalInfo(maybe: Partial<IRemovalInfo> | undefined): IRemovalInfo | undefined {\n    if (maybe?.removedClientIds !== undefined && maybe?.removedSeq !== undefined) {\n        return maybe as IRemovalInfo;\n    }\n    assert(maybe?.removedClientIds === undefined && maybe?.removedSeq === undefined,\n        0x2bf /* \"both removedClientIds and removedSeq should be set or not set\" */);\n}\n\n/**\n * A segment representing a portion of the merge tree.\n * Segments are leaf nodes of the merge tree and contain data.\n */\nexport interface ISegment extends IMergeNodeCommon, Partial<IRemovalInfo> {\n    readonly type: string;\n    readonly segmentGroups: SegmentGroupCollection;\n    readonly trackingCollection: TrackingGroupCollection;\n    /**\n     * Manages pending local state for properties on this segment.\n     */\n    propertyManager?: PropertiesManager;\n    /**\n     * Local seq at which this segment was inserted. If this is defined, `seq` will be UnassignedSequenceNumber.\n     * Once the segment is acked, this field is cleared.\n     */\n    localSeq?: number;\n    /**\n     * Local seq at which this segment was removed. If this is defined, `removedSeq` will initially be set to\n     * UnassignedSequenceNumber. However, if another client concurrently removes the same segment, `removedSeq`\n     * will be updated to the seq at which that client removed this segment.\n     *\n     * Like `localSeq`, this field is cleared once the local removal of the segment is acked.\n     */\n    localRemovedSeq?: number;\n    /**\n     * Seq at which this segment was inserted.\n     * If undefined, it is assumed the segment was inserted prior to the collab window's minimum sequence number.\n     */\n    seq?: number;\n    /**\n     * Short clientId for the client that inserted this segment.\n     */\n    clientId: number;\n    /**\n     * Local references added to this segment.\n     */\n    localRefs?: LocalReferenceCollection;\n    /**\n     * Properties that have been added to this segment via annotation.\n     */\n    properties?: PropertySet;\n    addProperties(\n        newProps: PropertySet,\n        op?: ICombiningOp,\n        seq?: number,\n        collabWindow?: CollaborationWindow,\n        rollback?: PropertiesRollback,\n    ): PropertySet | undefined;\n    clone(): ISegment;\n    canAppend(segment: ISegment): boolean;\n    append(segment: ISegment): void;\n    splitAt(pos: number): ISegment | undefined;\n    toJSONObject(): any;\n    /**\n     * Acks the current segment against the segment group, op, and merge tree.\n     *\n     * Throws error if the segment state doesn't match segment group or op.\n     * E.g. Segment group not first is pending queue.\n     * Inserted segment does not have unassigned sequence number.\n     *\n     * Returns true if the op  modifies the segment, otherwise false.\n     * The only current false case is overlapping remove, where a segment is removed\n     * by a previously sequenced operation before the current operation is acked.\n     *\n     * @deprecated  for internal use only. public export will be removed.\n     * @internal\n     */\n    ack(segmentGroup: SegmentGroup, opArgs: IMergeTreeDeltaOpArgs, mergeTree: MergeTree): boolean;\n}\n\nexport interface IMarkerModifiedAction {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    (marker: Marker): void;\n}\n\nexport interface ISegmentAction<TClientData> {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    (segment: ISegment, pos: number, refSeq: number, clientId: number, start: number,\n        end: number, accum: TClientData): boolean;\n}\n\nexport interface ISegmentChanges {\n    next?: ISegment;\n    replaceCurrent?: ISegment;\n}\n\nexport interface BlockAction<TClientData> {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    (\n        block: IMergeBlock,\n        pos: number,\n        refSeq: number,\n        clientId: number,\n        start: number | undefined,\n        end: number | undefined,\n        accum: TClientData,\n    ): boolean;\n}\n\nexport interface NodeAction<TClientData> {\n    // eslint-disable-next-line @typescript-eslint/prefer-function-type\n    (\n        node: IMergeNode,\n        pos: number,\n        refSeq: number,\n        clientId: number,\n        start: number | undefined,\n        end: number | undefined,\n        clientData: TClientData,\n    ): boolean;\n}\n\nexport interface IncrementalSegmentAction<TContext> {\n    (segment: ISegment, state: IncrementalMapState<TContext>);\n}\n\nexport interface IncrementalBlockAction<TContext> {\n    (state: IncrementalMapState<TContext>);\n}\n\nexport interface BlockUpdateActions {\n    child: (block: IMergeBlock, index: number) => void;\n}\n\nexport interface InsertContext {\n    candidateSegment?: ISegment;\n    prepareEvents?: boolean;\n    structureChange?: boolean;\n    leaf: (segment: ISegment | undefined, pos: number, ic: InsertContext) => ISegmentChanges;\n    continuePredicate?: (continueFromBlock: IMergeBlock) => boolean;\n}\n\nexport interface SegmentActions<TClientData> {\n    leaf?: ISegmentAction<TClientData>;\n    shift?: NodeAction<TClientData>;\n    contains?: NodeAction<TClientData>;\n    pre?: BlockAction<TClientData>;\n    post?: BlockAction<TClientData>;\n}\n\nexport interface IncrementalSegmentActions<TContext> {\n    leaf: IncrementalSegmentAction<TContext>;\n    pre?: IncrementalBlockAction<TContext>;\n    post?: IncrementalBlockAction<TContext>;\n}\n\nexport interface SearchResult {\n    text: string;\n    pos: number;\n}\n\nexport interface MergeTreeStats {\n    maxHeight: number;\n    nodeCount: number;\n    leafCount: number;\n    removedLeafCount: number;\n    liveCount: number;\n    histo: number[];\n    windowTime?: number;\n    packTime?: number;\n    ordTime?: number;\n    maxOrdTime?: number;\n}\n\nexport interface SegmentGroup {\n    segments: ISegment[];\n    previousProps?: PropertySet[];\n    removedReferences?: LocalReferencePosition[];\n    localSeq: number;\n}\n\nexport class MergeNode implements IMergeNodeCommon {\n    index: number = 0;\n    ordinal: string = \"\";\n    parent?: IMergeBlock;\n    cachedLength: number = 0;\n\n    isLeaf() {\n        return false;\n    }\n}\nexport function ordinalToArray(ord: string) {\n    const a: number[] = [];\n    if (ord) {\n        for (let i = 0, len = ord.length; i < len; i++) {\n            a.push(ord.charCodeAt(i));\n        }\n    }\n    return a;\n}\n\n// Note that the actual branching factor of the MergeTree is `MaxNodesInBlock - 1`.  This is because\n// the MergeTree always inserts first, then checks for overflow and splits if the child count equals\n// `MaxNodesInBlock`.  (i.e., `MaxNodesInBlock` contains 1 extra slot for temporary storage to\n// facilitate splits.)\nexport const MaxNodesInBlock = 8;\n\nexport class MergeBlock extends MergeNode implements IMergeBlock {\n    public children: IMergeNode[];\n    public constructor(public childCount: number) {\n        super();\n        this.children = new Array<IMergeNode>(MaxNodesInBlock);\n    }\n\n    public hierBlock(): IHierBlock | undefined {\n        return undefined;\n    }\n\n    public setOrdinal(child: IMergeNode, index: number) {\n        let childCount = this.childCount;\n        if (childCount === 8) {\n            childCount = 7;\n        }\n        assert((childCount >= 1) && (childCount <= 7), 0x040 /* \"Child count is not within [1,7] range!\" */);\n        let localOrdinal: number;\n        const ordinalWidth = 1 << (MaxNodesInBlock - (childCount + 1));\n        if (index === 0) {\n            localOrdinal = ordinalWidth - 1;\n        } else {\n            const prevOrd = this.children[index - 1].ordinal;\n            const prevOrdCode = prevOrd.charCodeAt(prevOrd.length - 1);\n            localOrdinal = prevOrdCode + ordinalWidth;\n        }\n        child.ordinal = this.ordinal + String.fromCharCode(localOrdinal);\n        assert(child.ordinal.length === (this.ordinal.length + 1), 0x041 /* \"Unexpected child ordinal length!\" */);\n        if (index > 0) {\n            assert(\n                child.ordinal > this.children[index - 1].ordinal,\n                0x042, /* \"Child ordinal <= previous sibling ordinal!\" */\n            );\n        }\n    }\n\n    public assignChild(child: IMergeNode, index: number, updateOrdinal = true) {\n        child.parent = this;\n        child.index = index;\n        if (updateOrdinal) {\n            this.setOrdinal(child, index);\n        }\n        this.children[index] = child;\n    }\n}\n\nexport abstract class BaseSegment extends MergeNode implements ISegment {\n    public clientId: number = LocalClientId;\n    public seq: number = UniversalSequenceNumber;\n    public removedSeq?: number;\n    public removedClientIds?: number[];\n    public readonly segmentGroups: SegmentGroupCollection = new SegmentGroupCollection(this);\n    public readonly trackingCollection: TrackingGroupCollection = new TrackingGroupCollection(this);\n    public propertyManager?: PropertiesManager;\n    public properties?: PropertySet;\n    public localRefs?: LocalReferenceCollection;\n    public abstract readonly type: string;\n    public localSeq?: number;\n    public localRemovedSeq?: number;\n\n    public addProperties(newProps: PropertySet, op?: ICombiningOp, seq?: number,\n        collabWindow?: CollaborationWindow, rollback: PropertiesRollback = PropertiesRollback.None) {\n        if (!this.propertyManager) {\n            this.propertyManager = new PropertiesManager();\n        }\n        if (!this.properties) {\n            this.properties = createMap<any>();\n        }\n        return this.propertyManager.addProperties(\n            this.properties,\n            newProps,\n            op,\n            seq,\n            collabWindow && collabWindow.collaborating,\n            rollback,\n        );\n    }\n\n    public hasProperty(key: string): boolean {\n        return !!this.properties && (this.properties[key] !== undefined);\n    }\n\n    public isLeaf() {\n        return true;\n    }\n\n    protected cloneInto(b: ISegment) {\n        b.clientId = this.clientId;\n        // TODO: deep clone properties\n        b.properties = clone(this.properties);\n        b.removedClientIds = this.removedClientIds?.slice();\n        // TODO: copy removed client overlap and branch removal info\n        b.removedSeq = this.removedSeq;\n        b.seq = this.seq;\n    }\n\n    public canAppend(segment: ISegment): boolean {\n        return false;\n    }\n\n    protected addSerializedProps(jseg: IJSONSegment) {\n        if (this.properties) {\n            jseg.props = this.properties;\n        }\n    }\n\n    public abstract toJSONObject(): any;\n\n    /**\n     * @deprecated  for internal use only. public export will be removed.\n     * @internal\n     */\n    public ack(segmentGroup: SegmentGroup, opArgs: IMergeTreeDeltaOpArgs, mergeTree: MergeTree): boolean {\n        const currentSegmentGroup = this.segmentGroups.dequeue();\n        assert(currentSegmentGroup === segmentGroup, 0x043 /* \"On ack, unexpected segmentGroup!\" */);\n        switch (opArgs.op.type) {\n            case MergeTreeDeltaType.ANNOTATE:\n                assert(!!this.propertyManager, 0x044 /* \"On annotate ack, missing segment property manager!\" */);\n                this.propertyManager.ackPendingProperties(opArgs.op);\n                return true;\n\n            case MergeTreeDeltaType.INSERT:\n                assert(this.seq === UnassignedSequenceNumber, 0x045 /* \"On insert, seq number already assigned!\" */);\n                this.seq = opArgs.sequencedMessage!.sequenceNumber;\n                this.localSeq = undefined;\n                return true;\n\n            case MergeTreeDeltaType.REMOVE:\n                const removalInfo: IRemovalInfo | undefined = toRemovalInfo(this);\n                assert(removalInfo !== undefined, 0x046 /* \"On remove ack, missing removal info!\" */);\n                this.localRemovedSeq = undefined;\n                if (removalInfo.removedSeq === UnassignedSequenceNumber) {\n                    removalInfo.removedSeq = opArgs.sequencedMessage!.sequenceNumber;\n                    return true;\n                }\n                return false;\n\n            default:\n                throw new Error(`${opArgs.op.type} is in unrecognized operation type`);\n        }\n    }\n\n    public splitAt(pos: number): ISegment | undefined {\n        if (pos > 0) {\n            const leafSegment = this.createSplitSegmentAt(pos);\n            if (leafSegment) {\n                this.copyPropertiesTo(leafSegment);\n                leafSegment.parent = this.parent;\n\n                // Give the leaf a temporary yet valid ordinal.\n                // when this segment is put in the tree, it will get its real ordinal,\n                // but this ordinal meets all the necessary invariants for now.\n                leafSegment.ordinal = this.ordinal + String.fromCharCode(0);\n\n                leafSegment.removedClientIds = this.removedClientIds?.slice();\n                leafSegment.removedSeq = this.removedSeq;\n                leafSegment.localRemovedSeq = this.localRemovedSeq;\n                leafSegment.seq = this.seq;\n                leafSegment.localSeq = this.localSeq;\n                leafSegment.clientId = this.clientId;\n                this.segmentGroups.copyTo(leafSegment);\n                this.trackingCollection.copyTo(leafSegment);\n                if (this.localRefs) {\n                    this.localRefs.split(pos, leafSegment);\n                }\n            }\n            return leafSegment;\n        }\n    }\n\n    private copyPropertiesTo(other: ISegment) {\n        if (this.propertyManager) {\n            if (this.properties) {\n                other.propertyManager = new PropertiesManager();\n                other.properties = this.propertyManager.copyTo(\n                    this.properties,\n                    other.properties,\n                    other.propertyManager,\n                );\n            }\n        }\n    }\n\n    public abstract clone(): ISegment;\n    public abstract append(segment: ISegment): void;\n    protected abstract createSplitSegmentAt(pos: number): BaseSegment | undefined;\n}\n\nexport const reservedMarkerIdKey = \"markerId\";\nexport const reservedMarkerSimpleTypeKey = \"markerSimpleType\";\n\nexport interface IJSONMarkerSegment extends IJSONSegment {\n    marker: IMarkerDef;\n}\n\nexport class Marker extends BaseSegment implements ReferencePosition {\n    public static readonly type = \"Marker\";\n    public static is(segment: ISegment): segment is Marker {\n        return segment.type === Marker.type;\n    }\n    public readonly type = Marker.type;\n\n    public static make(\n        refType: ReferenceType, props?: PropertySet) {\n        const marker = new Marker(refType);\n        if (props) {\n            marker.addProperties(props);\n        }\n        return marker;\n    }\n\n    constructor(public refType: ReferenceType) {\n        super();\n        this.cachedLength = 1;\n    }\n\n    toJSONObject() {\n        const obj: IJSONMarkerSegment = { marker: { refType: this.refType } };\n        super.addSerializedProps(obj);\n        return obj;\n    }\n\n    static fromJSONObject(spec: any) {\n        if (spec && typeof spec === \"object\" && \"marker\" in spec) {\n            return Marker.make(\n                spec.marker.refType,\n                spec.props as PropertySet);\n        }\n        return undefined;\n    }\n\n    clone() {\n        const b = Marker.make(this.refType, this.properties);\n        this.cloneInto(b);\n        return b;\n    }\n\n    getSegment() {\n        return this;\n    }\n\n    getOffset() {\n        return 0;\n    }\n\n    hasSimpleType(simpleTypeName: string) {\n        return !!this.properties &&\n            this.properties[reservedMarkerSimpleTypeKey] === simpleTypeName;\n    }\n\n    getProperties() {\n        return this.properties;\n    }\n\n    getId(): string | undefined {\n        if (this.properties && this.properties[reservedMarkerIdKey]) {\n            return this.properties[reservedMarkerIdKey] as string;\n        }\n    }\n\n    toString() {\n        let bbuf = \"\";\n        if (refTypeIncludesFlag(this, ReferenceType.Tile)) {\n            bbuf += \"Tile\";\n        }\n        if (refTypeIncludesFlag(this, ReferenceType.NestBegin)) {\n            if (bbuf.length > 0) {\n                bbuf += \"; \";\n            }\n            bbuf += \"RangeBegin\";\n        }\n        if (refTypeIncludesFlag(this, ReferenceType.NestEnd)) {\n            if (bbuf.length > 0) {\n                bbuf += \"; \";\n            }\n            bbuf += \"RangeEnd\";\n        }\n        let lbuf = \"\";\n        const id = this.getId();\n        if (id) {\n            bbuf += ` (${id}) `;\n        }\n        const tileLabels = refGetTileLabels(this);\n        if (tileLabels) {\n            lbuf += \"tile -- \";\n            for (let i = 0, len = tileLabels.length; i < len; i++) {\n                const tileLabel = tileLabels[i];\n                if (i > 0) {\n                    lbuf += \"; \";\n                }\n                lbuf += tileLabel;\n            }\n        }\n        const rangeLabels = refGetRangeLabels(this);\n        if (rangeLabels) {\n            let rangeKind = \"begin\";\n            if (refTypeIncludesFlag(this, ReferenceType.NestEnd)) {\n                rangeKind = \"end\";\n            }\n            if (tileLabels) {\n                lbuf += \" \";\n            }\n            lbuf += `range ${rangeKind} -- `;\n            const labels = rangeLabels;\n            for (let i = 0, len = labels.length; i < len; i++) {\n                const rangeLabel = labels[i];\n                if (i > 0) {\n                    lbuf += \"; \";\n                }\n                lbuf += rangeLabel;\n            }\n        }\n        let pbuf = \"\";\n        if (this.properties) {\n            pbuf += JSON.stringify(this.properties, (key, value) => {\n                // Avoid circular reference when stringifying makers containing handles.\n                // (Substitute a debug string instead.)\n                const handle = !!value && value.IFluidHandle;\n\n                // eslint-disable-next-line @typescript-eslint/no-unsafe-return\n                return handle\n                    ? `#Handle(${handle.routeContext.path}/${handle.path})`\n                    : value;\n            });\n        }\n        return `M ${bbuf}: ${lbuf} ${pbuf}`;\n    }\n\n    protected createSplitSegmentAt(pos: number) {\n        return undefined;\n    }\n\n    canAppend(segment: ISegment): boolean {\n        return false;\n    }\n\n    append() { throw new Error(\"Can not append to marker\"); }\n}\n\nexport enum IncrementalExecOp {\n    Go,\n    Stop,\n    Yield,\n}\n\nexport class IncrementalMapState<TContext> {\n    op = IncrementalExecOp.Go;\n    constructor(\n        public block: IMergeBlock,\n        public actions: IncrementalSegmentActions<TContext>,\n        public pos: number,\n        public refSeq: number,\n        public clientId: number,\n        public context: TContext,\n        public start: number,\n        public end: number,\n        public childIndex = 0,\n    ) {\n    }\n}\n\nexport class CollaborationWindow {\n    clientId = LocalClientId;\n    collaborating = false;\n    // Lowest-numbered segment in window; no client can reference a state before this one\n    minSeq = 0;\n    // Highest-numbered segment in window and current\n    // reference segment for this client\n    currentSeq = 0;\n\n    localSeq = 0;\n\n    loadFrom(a: CollaborationWindow) {\n        this.clientId = a.clientId;\n        this.collaborating = a.collaborating;\n        this.minSeq = a.minSeq;\n        this.currentSeq = a.currentSeq;\n    }\n}\n\nexport const compareNumbers = (a: number, b: number) => a - b;\n\nexport const compareStrings = (a: string, b: string) => a.localeCompare(b);\n\nconst indentStrings = [\"\", \" \", \"  \"];\nexport function internedSpaces(n: number) {\n    if (indentStrings[n] === undefined) {\n        indentStrings[n] = \"\";\n        for (let i = 0; i < n; i++) {\n            indentStrings[n] += \" \";\n        }\n    }\n    return indentStrings[n];\n}\n\nexport interface IConsensusInfo {\n    marker: Marker;\n    callback: (m: Marker) => void;\n}\n\nexport interface SegmentAccumulator {\n    segments: ISegment[];\n}\n\nexport interface MinListener {\n    minRequired: number;\n    onMinGE(minSeq: number): void;\n}\n"]}

package/dist/mergeTreeTracking.d.ts

@@ -2,7 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ISegment } from "./mergeTree";
+import { ISegment } from "./mergeTreeNodes";
 export declare class TrackingGroup {
     private readonly segmentSet;
     constructor();

package/dist/mergeTreeTracking.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mergeTreeTracking.d.ts","sourceRoot":"","sources":["../src/mergeTreeTracking.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,qBAAa,aAAa;IACtB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAmB;;IAM9C,IAAW,QAAQ,IAAI,SAAS,QAAQ,EAAE,CAEzC;IAED,IAAW,IAAI,IAAI,MAAM,CAExB;IAEM,GAAG,CAAC,OAAO,EAAE,QAAQ,GAAG,OAAO;IAI/B,IAAI,CAAC,OAAO,EAAE,QAAQ;IAOtB,MAAM,CAAC,OAAO,EAAE,QAAQ;CAKlC;AAED,qBAAa,uBAAuB;IAGpB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAFpC,SAAgB,cAAc,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;gBAEtB,OAAO,EAAE,QAAQ;IAIvC,IAAI,CAAC,aAAa,EAAE,aAAa;IAYjC,MAAM,CAAC,aAAa,EAAE,aAAa;IAOnC,MAAM,CAAC,OAAO,EAAE,QAAQ;IAK/B,IAAW,KAAK,IAAI,OAAO,CAE1B;IAEM,OAAO,CAAC,kBAAkB,EAAE,uBAAuB,GAAG,OAAO;CAYvE"}
+{"version":3,"file":"mergeTreeTracking.d.ts","sourceRoot":"","sources":["../src/mergeTreeTracking.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAG5C,qBAAa,aAAa;IACtB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAmB;;IAM9C,IAAW,QAAQ,IAAI,SAAS,QAAQ,EAAE,CAEzC;IAED,IAAW,IAAI,IAAI,MAAM,CAExB;IAEM,GAAG,CAAC,OAAO,EAAE,QAAQ,GAAG,OAAO;IAI/B,IAAI,CAAC,OAAO,EAAE,QAAQ;IAOtB,MAAM,CAAC,OAAO,EAAE,QAAQ;CAKlC;AAED,qBAAa,uBAAuB;IAGpB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAFpC,SAAgB,cAAc,EAAE,GAAG,CAAC,aAAa,CAAC,CAAC;gBAEtB,OAAO,EAAE,QAAQ;IAIvC,IAAI,CAAC,aAAa,EAAE,aAAa;IAYjC,MAAM,CAAC,aAAa,EAAE,aAAa;IAOnC,MAAM,CAAC,OAAO,EAAE,QAAQ;IAK/B,IAAW,KAAK,IAAI,OAAO,CAE1B;IAEM,OAAO,CAAC,kBAAkB,EAAE,uBAAuB,GAAG,OAAO;CAYvE"}

package/dist/mergeTreeTracking.js.map

@@ -1 +1 @@
-{"version":3,"file":"mergeTreeTracking.js","sourceRoot":"","sources":["../src/mergeTreeTracking.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,yDAAsD;AAEtD,MAAa,aAAa;IAGtB;QACI,IAAI,CAAC,UAAU,GAAG,IAAI,mCAAgB,EAAE,CAAC;IAC7C,CAAC;IAED,IAAW,QAAQ;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;IACjC,CAAC;IAED,IAAW,IAAI;QACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAChC,CAAC;IAEM,GAAG,CAAC,OAAiB;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAEM,IAAI,CAAC,OAAiB;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;YAC/B,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACrC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACzC;IACL,CAAC;IAEM,MAAM,CAAC,OAAiB;QAC3B,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;YACjC,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SAC3C;IACL,CAAC;CACJ;AA/BD,sCA+BC;AAED,MAAa,uBAAuB;IAGhC,YAA6B,OAAiB;QAAjB,YAAO,GAAP,OAAO,CAAU;QAC1C,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAiB,CAAC;IACnD,CAAC;IAEM,IAAI,CAAC,aAA4B;QACpC,IAAI,aAAa,EAAE;YACf,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;gBACzC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;aAC1C;YAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;gBAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACpC;SACJ;IACL,CAAC;IAEM,MAAM,CAAC,aAA4B;QACtC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YACjC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACtC;QACD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IAEM,MAAM,CAAC,OAAiB;QAC3B,IAAI,CAAC,cAAc,CAAC,OAAO,CACvB,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,kBAA2C;QACtD,IAAI,CAAC,kBAAkB;eAChB,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,kBAAkB,CAAC,cAAc,CAAC,IAAI,EAAE;YACxE,OAAO,KAAK,CAAC;SAChB;QACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE;YAC3C,IAAI,CAAC,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAC5C,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AA/CD,0DA+CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ISegment } from \"./mergeTree\";\nimport { SortedSegmentSet } from \"./sortedSegmentSet\";\n\nexport class TrackingGroup {\n    private readonly segmentSet: SortedSegmentSet;\n\n    constructor() {\n        this.segmentSet = new SortedSegmentSet();\n    }\n\n    public get segments(): readonly ISegment[] {\n        return this.segmentSet.items;\n    }\n\n    public get size(): number {\n        return this.segmentSet.size;\n    }\n\n    public has(segment: ISegment): boolean {\n        return this.segmentSet.has(segment);\n    }\n\n    public link(segment: ISegment) {\n        if (!this.segmentSet.has(segment)) {\n            this.segmentSet.addOrUpdate(segment);\n            segment.trackingCollection.link(this);\n        }\n    }\n\n    public unlink(segment: ISegment) {\n        if (this.segmentSet.remove(segment)) {\n            segment.trackingCollection.unlink(this);\n        }\n    }\n}\n\nexport class TrackingGroupCollection {\n    public readonly trackingGroups: Set<TrackingGroup>;\n\n    constructor(private readonly segment: ISegment) {\n        this.trackingGroups = new Set<TrackingGroup>();\n    }\n\n    public link(trackingGroup: TrackingGroup) {\n        if (trackingGroup) {\n            if (!this.trackingGroups.has(trackingGroup)) {\n                this.trackingGroups.add(trackingGroup);\n            }\n\n            if (!trackingGroup.has(this.segment)) {\n                trackingGroup.link(this.segment);\n            }\n        }\n    }\n\n    public unlink(trackingGroup: TrackingGroup) {\n        if (trackingGroup.has(this.segment)) {\n            trackingGroup.unlink(this.segment);\n        }\n        this.trackingGroups.delete(trackingGroup);\n    }\n\n    public copyTo(segment: ISegment) {\n        this.trackingGroups.forEach(\n            (sg) => segment.trackingCollection.link(sg));\n    }\n\n    public get empty(): boolean {\n        return this.trackingGroups.size === 0;\n    }\n\n    public matches(trackingCollection: TrackingGroupCollection): boolean {\n        if (!trackingCollection\n            || this.trackingGroups.size !== trackingCollection.trackingGroups.size) {\n            return false;\n        }\n        for (const tg of this.trackingGroups.values()) {\n            if (!trackingCollection.trackingGroups.has(tg)) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n"]}
+{"version":3,"file":"mergeTreeTracking.js","sourceRoot":"","sources":["../src/mergeTreeTracking.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,yDAAsD;AAEtD,MAAa,aAAa;IAGtB;QACI,IAAI,CAAC,UAAU,GAAG,IAAI,mCAAgB,EAAE,CAAC;IAC7C,CAAC;IAED,IAAW,QAAQ;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;IACjC,CAAC;IAED,IAAW,IAAI;QACX,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;IAChC,CAAC;IAEM,GAAG,CAAC,OAAiB;QACxB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAEM,IAAI,CAAC,OAAiB;QACzB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;YAC/B,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACrC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACzC;IACL,CAAC;IAEM,MAAM,CAAC,OAAiB;QAC3B,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE;YACjC,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;SAC3C;IACL,CAAC;CACJ;AA/BD,sCA+BC;AAED,MAAa,uBAAuB;IAGhC,YAA6B,OAAiB;QAAjB,YAAO,GAAP,OAAO,CAAU;QAC1C,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAiB,CAAC;IACnD,CAAC;IAEM,IAAI,CAAC,aAA4B;QACpC,IAAI,aAAa,EAAE;YACf,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE;gBACzC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;aAC1C;YAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;gBAClC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;aACpC;SACJ;IACL,CAAC;IAEM,MAAM,CAAC,aAA4B;QACtC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YACjC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACtC;QACD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;IAC9C,CAAC;IAEM,MAAM,CAAC,OAAiB;QAC3B,IAAI,CAAC,cAAc,CAAC,OAAO,CACvB,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAED,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,CAAC;IAC1C,CAAC;IAEM,OAAO,CAAC,kBAA2C;QACtD,IAAI,CAAC,kBAAkB;eAChB,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,kBAAkB,CAAC,cAAc,CAAC,IAAI,EAAE;YACxE,OAAO,KAAK,CAAC;SAChB;QACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE;YAC3C,IAAI,CAAC,kBAAkB,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAC5C,OAAO,KAAK,CAAC;aAChB;SACJ;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;CACJ;AA/CD,0DA+CC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ISegment } from \"./mergeTreeNodes\";\nimport { SortedSegmentSet } from \"./sortedSegmentSet\";\n\nexport class TrackingGroup {\n    private readonly segmentSet: SortedSegmentSet;\n\n    constructor() {\n        this.segmentSet = new SortedSegmentSet();\n    }\n\n    public get segments(): readonly ISegment[] {\n        return this.segmentSet.items;\n    }\n\n    public get size(): number {\n        return this.segmentSet.size;\n    }\n\n    public has(segment: ISegment): boolean {\n        return this.segmentSet.has(segment);\n    }\n\n    public link(segment: ISegment) {\n        if (!this.segmentSet.has(segment)) {\n            this.segmentSet.addOrUpdate(segment);\n            segment.trackingCollection.link(this);\n        }\n    }\n\n    public unlink(segment: ISegment) {\n        if (this.segmentSet.remove(segment)) {\n            segment.trackingCollection.unlink(this);\n        }\n    }\n}\n\nexport class TrackingGroupCollection {\n    public readonly trackingGroups: Set<TrackingGroup>;\n\n    constructor(private readonly segment: ISegment) {\n        this.trackingGroups = new Set<TrackingGroup>();\n    }\n\n    public link(trackingGroup: TrackingGroup) {\n        if (trackingGroup) {\n            if (!this.trackingGroups.has(trackingGroup)) {\n                this.trackingGroups.add(trackingGroup);\n            }\n\n            if (!trackingGroup.has(this.segment)) {\n                trackingGroup.link(this.segment);\n            }\n        }\n    }\n\n    public unlink(trackingGroup: TrackingGroup) {\n        if (trackingGroup.has(this.segment)) {\n            trackingGroup.unlink(this.segment);\n        }\n        this.trackingGroups.delete(trackingGroup);\n    }\n\n    public copyTo(segment: ISegment) {\n        this.trackingGroups.forEach(\n            (sg) => segment.trackingCollection.link(sg));\n    }\n\n    public get empty(): boolean {\n        return this.trackingGroups.size === 0;\n    }\n\n    public matches(trackingCollection: TrackingGroupCollection): boolean {\n        if (!trackingCollection\n            || this.trackingGroups.size !== trackingCollection.trackingGroups.size) {\n            return false;\n        }\n        for (const tg of this.trackingGroups.values()) {\n            if (!trackingCollection.trackingGroups.has(tg)) {\n                return false;\n            }\n        }\n        return true;\n    }\n}\n"]}

package/dist/opBuilder.d.ts

@@ -2,7 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ISegment, Marker } from "./mergeTree";
+import { ISegment, Marker } from "./mergeTreeNodes";
 import { ICombiningOp, IMergeTreeAnnotateMsg, IMergeTreeGroupMsg, IMergeTreeInsertMsg, IMergeTreeRemoveMsg, IMergeTreeDeltaOp } from "./ops";
 import { PropertySet } from "./properties";
 /**

package/dist/opBuilder.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"opBuilder.d.ts","sourceRoot":"","sources":["../src/opBuilder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EACH,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EAEnB,iBAAiB,EACpB,MAAM,OAAO,CAAC;AACf,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAClC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,YAAY,GAAG,qBAAqB,GAAG,SAAS,CAarG;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACjC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,GAAG,SAAS,GAAG,qBAAqB,CAQhH;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,mBAAmB,CAMnF;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,GAAG,mBAAmB,CAIzF;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,mBAAmB,CAM7E;AAED;;;GAGG;AACH,wBAAgB,aAAa,CACzB,GAAG,GAAG,EAAE,iBAAiB,EAAE,GAAG,kBAAkB,CAKnD"}
+{"version":3,"file":"opBuilder.d.ts","sourceRoot":"","sources":["../src/opBuilder.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EACH,YAAY,EACZ,qBAAqB,EACrB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EAEnB,iBAAiB,EACpB,MAAM,OAAO,CAAC;AACf,OAAO,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAE3C;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAClC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,YAAY,GAAG,qBAAqB,GAAG,SAAS,CAarG;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACjC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,WAAW,EAAE,YAAY,GAAG,SAAS,GAAG,qBAAqB,CAQhH;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,mBAAmB,CAMnF;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,GAAG,mBAAmB,CAIzF;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,mBAAmB,CAM7E;AAED;;;GAGG;AACH,wBAAgB,aAAa,CACzB,GAAG,GAAG,EAAE,iBAAiB,EAAE,GAAG,kBAAkB,CAKnD"}

package/dist/opBuilder.js.map

@@ -1 +1 @@
-{"version":3,"file":"opBuilder.js","sourceRoot":"","sources":["../src/opBuilder.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,+BAQe;AAGf;;;;;;GAMG;AACH,SAAgB,sBAAsB,CAClC,MAAc,EAAE,KAAkB,EAAE,WAA0B;IAC9D,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,CAAC,EAAE,EAAE;QACL,OAAO,SAAS,CAAC;KACpB;IAED,OAAO;QACH,WAAW;QACX,KAAK;QACL,YAAY,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;QAClC,YAAY,EAAE,EAAE,EAAE,EAAE;QACpB,IAAI,EAAE,wBAAkB,CAAC,QAAQ;KACpC,CAAC;AACN,CAAC;AAdD,wDAcC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CACjC,KAAa,EAAE,GAAW,EAAE,KAAkB,EAAE,WAAqC;IACrF,OAAO;QACH,WAAW;QACX,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,GAAG;QACT,KAAK;QACL,IAAI,EAAE,wBAAkB,CAAC,QAAQ;KACpC,CAAC;AACN,CAAC;AATD,sDASC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,KAAa,EAAE,GAAW;IAC1D,OAAO;QACH,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,GAAG;QACT,IAAI,EAAE,wBAAkB,CAAC,MAAM;KAClC,CAAC;AACN,CAAC;AAND,kDAMC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,GAAW,EAAE,OAAiB;IAChE,OAAO,cAAc,CACjB,GAAG,EACH,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;AAChC,CAAC;AAJD,sDAIC;AAED,SAAgB,cAAc,CAAC,GAAW,EAAE,OAAY;IACpD,OAAO;QACH,IAAI,EAAE,GAAG;QACT,GAAG,EAAE,OAAO;QACZ,IAAI,EAAE,wBAAkB,CAAC,MAAM;KAClC,CAAC;AACN,CAAC;AAND,wCAMC;AAED;;;GAGG;AACH,SAAgB,aAAa,CACzB,GAAG,GAAwB;IAC3B,OAAO;QACH,GAAG;QACH,IAAI,EAAE,wBAAkB,CAAC,KAAK;KACjC,CAAC;AACN,CAAC;AAND,sCAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ISegment, Marker } from \"./mergeTree\";\nimport {\n    ICombiningOp,\n    IMergeTreeAnnotateMsg,\n    IMergeTreeGroupMsg,\n    IMergeTreeInsertMsg,\n    IMergeTreeRemoveMsg,\n    MergeTreeDeltaType,\n    IMergeTreeDeltaOp,\n} from \"./ops\";\nimport { PropertySet } from \"./properties\";\n\n/**\n * Creates the op for annotating the markers with the provided properties\n * @param marker - The marker to annotate\n * @param props - The properties to annotate the marker with\n * @param combiningOp - Optional. Specifies how to combine values for the property, such as \"incr\" for increment.\n * @returns The annotate op\n */\nexport function createAnnotateMarkerOp(\n    marker: Marker, props: PropertySet, combiningOp?: ICombiningOp): IMergeTreeAnnotateMsg | undefined {\n    const id = marker.getId();\n    if (!id) {\n        return undefined;\n    }\n\n    return {\n        combiningOp,\n        props,\n        relativePos1: { id, before: true },\n        relativePos2: { id },\n        type: MergeTreeDeltaType.ANNOTATE,\n    };\n}\n\n/**\n * Creates the op for annotating the range with the provided properties\n * @param start - The inclusive start position of the range to annotate\n * @param end - The exclusive end position of the range to annotate\n * @param props - The properties to annotate the range with\n * @param combiningOp - Optional. Specifies how to combine values for the property, such as \"incr\" for increment.\n * @returns The annotate op\n */\nexport function createAnnotateRangeOp(\n    start: number, end: number, props: PropertySet, combiningOp: ICombiningOp | undefined): IMergeTreeAnnotateMsg {\n    return {\n        combiningOp,\n        pos1: start,\n        pos2: end,\n        props,\n        type: MergeTreeDeltaType.ANNOTATE,\n    };\n}\n\n/**\n * Creates the op to remove a range\n *\n * @param start - The inclusive start of the range to remove\n * @param end - The exclusive end of the range to remove\n */\nexport function createRemoveRangeOp(start: number, end: number): IMergeTreeRemoveMsg {\n    return {\n        pos1: start,\n        pos2: end,\n        type: MergeTreeDeltaType.REMOVE,\n    };\n}\n\n/**\n *\n * @param pos - The position to insert the segment at\n * @param segment - The segment to insert\n */\nexport function createInsertSegmentOp(pos: number, segment: ISegment): IMergeTreeInsertMsg {\n    return createInsertOp(\n        pos,\n        segment.toJSONObject());\n}\n\nexport function createInsertOp(pos: number, segSpec: any): IMergeTreeInsertMsg {\n    return {\n        pos1: pos,\n        seg: segSpec,\n        type: MergeTreeDeltaType.INSERT,\n    };\n}\n\n/**\n *\n * @param ops - The ops to group\n */\nexport function createGroupOp(\n    ...ops: IMergeTreeDeltaOp[]): IMergeTreeGroupMsg {\n    return {\n        ops,\n        type: MergeTreeDeltaType.GROUP,\n    };\n}\n"]}
+{"version":3,"file":"opBuilder.js","sourceRoot":"","sources":["../src/opBuilder.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,+BAQe;AAGf;;;;;;GAMG;AACH,SAAgB,sBAAsB,CAClC,MAAc,EAAE,KAAkB,EAAE,WAA0B;IAC9D,MAAM,EAAE,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;IAC1B,IAAI,CAAC,EAAE,EAAE;QACL,OAAO,SAAS,CAAC;KACpB;IAED,OAAO;QACH,WAAW;QACX,KAAK;QACL,YAAY,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE;QAClC,YAAY,EAAE,EAAE,EAAE,EAAE;QACpB,IAAI,EAAE,wBAAkB,CAAC,QAAQ;KACpC,CAAC;AACN,CAAC;AAdD,wDAcC;AAED;;;;;;;GAOG;AACH,SAAgB,qBAAqB,CACjC,KAAa,EAAE,GAAW,EAAE,KAAkB,EAAE,WAAqC;IACrF,OAAO;QACH,WAAW;QACX,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,GAAG;QACT,KAAK;QACL,IAAI,EAAE,wBAAkB,CAAC,QAAQ;KACpC,CAAC;AACN,CAAC;AATD,sDASC;AAED;;;;;GAKG;AACH,SAAgB,mBAAmB,CAAC,KAAa,EAAE,GAAW;IAC1D,OAAO;QACH,IAAI,EAAE,KAAK;QACX,IAAI,EAAE,GAAG;QACT,IAAI,EAAE,wBAAkB,CAAC,MAAM;KAClC,CAAC;AACN,CAAC;AAND,kDAMC;AAED;;;;GAIG;AACH,SAAgB,qBAAqB,CAAC,GAAW,EAAE,OAAiB;IAChE,OAAO,cAAc,CACjB,GAAG,EACH,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;AAChC,CAAC;AAJD,sDAIC;AAED,SAAgB,cAAc,CAAC,GAAW,EAAE,OAAY;IACpD,OAAO;QACH,IAAI,EAAE,GAAG;QACT,GAAG,EAAE,OAAO;QACZ,IAAI,EAAE,wBAAkB,CAAC,MAAM;KAClC,CAAC;AACN,CAAC;AAND,wCAMC;AAED;;;GAGG;AACH,SAAgB,aAAa,CACzB,GAAG,GAAwB;IAC3B,OAAO;QACH,GAAG;QACH,IAAI,EAAE,wBAAkB,CAAC,KAAK;KACjC,CAAC;AACN,CAAC;AAND,sCAMC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ISegment, Marker } from \"./mergeTreeNodes\";\nimport {\n    ICombiningOp,\n    IMergeTreeAnnotateMsg,\n    IMergeTreeGroupMsg,\n    IMergeTreeInsertMsg,\n    IMergeTreeRemoveMsg,\n    MergeTreeDeltaType,\n    IMergeTreeDeltaOp,\n} from \"./ops\";\nimport { PropertySet } from \"./properties\";\n\n/**\n * Creates the op for annotating the markers with the provided properties\n * @param marker - The marker to annotate\n * @param props - The properties to annotate the marker with\n * @param combiningOp - Optional. Specifies how to combine values for the property, such as \"incr\" for increment.\n * @returns The annotate op\n */\nexport function createAnnotateMarkerOp(\n    marker: Marker, props: PropertySet, combiningOp?: ICombiningOp): IMergeTreeAnnotateMsg | undefined {\n    const id = marker.getId();\n    if (!id) {\n        return undefined;\n    }\n\n    return {\n        combiningOp,\n        props,\n        relativePos1: { id, before: true },\n        relativePos2: { id },\n        type: MergeTreeDeltaType.ANNOTATE,\n    };\n}\n\n/**\n * Creates the op for annotating the range with the provided properties\n * @param start - The inclusive start position of the range to annotate\n * @param end - The exclusive end position of the range to annotate\n * @param props - The properties to annotate the range with\n * @param combiningOp - Optional. Specifies how to combine values for the property, such as \"incr\" for increment.\n * @returns The annotate op\n */\nexport function createAnnotateRangeOp(\n    start: number, end: number, props: PropertySet, combiningOp: ICombiningOp | undefined): IMergeTreeAnnotateMsg {\n    return {\n        combiningOp,\n        pos1: start,\n        pos2: end,\n        props,\n        type: MergeTreeDeltaType.ANNOTATE,\n    };\n}\n\n/**\n * Creates the op to remove a range\n *\n * @param start - The inclusive start of the range to remove\n * @param end - The exclusive end of the range to remove\n */\nexport function createRemoveRangeOp(start: number, end: number): IMergeTreeRemoveMsg {\n    return {\n        pos1: start,\n        pos2: end,\n        type: MergeTreeDeltaType.REMOVE,\n    };\n}\n\n/**\n *\n * @param pos - The position to insert the segment at\n * @param segment - The segment to insert\n */\nexport function createInsertSegmentOp(pos: number, segment: ISegment): IMergeTreeInsertMsg {\n    return createInsertOp(\n        pos,\n        segment.toJSONObject());\n}\n\nexport function createInsertOp(pos: number, segSpec: any): IMergeTreeInsertMsg {\n    return {\n        pos1: pos,\n        seg: segSpec,\n        type: MergeTreeDeltaType.INSERT,\n    };\n}\n\n/**\n *\n * @param ops - The ops to group\n */\nexport function createGroupOp(\n    ...ops: IMergeTreeDeltaOp[]): IMergeTreeGroupMsg {\n    return {\n        ops,\n        type: MergeTreeDeltaType.GROUP,\n    };\n}\n"]}