@fluidframework/merge-tree 2.0.0-rc.1.0.3 → 2.0.0-rc.2.0.0

package/lib/test/client.walkSegments.spec.js

@@ -0,0 +1,52 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { TestClient } from "./testClient.js";
+describe("client.applyMsg", () => {
+    const localUserLongId = "localUser";
+    const seg1 = "hello";
+    const seg2 = "world";
+    let client;
+    beforeEach(() => {
+        client = new TestClient();
+        client.insertTextLocal(client.getLength(), seg1);
+        client.insertTextLocal(client.getLength(), seg2);
+        client.startOrUpdateCollaboration(localUserLongId);
+    });
+    it("Walk All Segments", () => {
+        let segCount = 0;
+        let segLen = 0;
+        client.walkSegments((s) => {
+            segCount++;
+            segLen += s.cachedLength;
+            return true;
+        });
+        assert.equal(segCount, 2);
+        assert.equal(segLen, seg1.length + seg2.length);
+    });
+    it("Walk Segment Range", () => {
+        let segCount = 0;
+        let segLen = 0;
+        client.walkSegments((s) => {
+            segCount++;
+            segLen += s.cachedLength;
+            return true;
+        }, seg1.length - 2, seg1.length + 2);
+        assert.equal(segCount, 2);
+        assert.equal(segLen, seg1.length + seg2.length);
+    });
+    it("Walk Segment Range With Split", () => {
+        let segCount = 0;
+        let segLen = 0;
+        client.walkSegments((s) => {
+            segCount++;
+            segLen += s.cachedLength;
+            return true;
+        }, seg1.length - 2, seg1.length + 2, undefined, true);
+        assert.equal(segCount, 2);
+        assert.equal(segLen, 4);
+    });
+});
+//# sourceMappingURL=client.walkSegments.spec.js.map

package/lib/test/client.walkSegments.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"client.walkSegments.spec.js","sourceRoot":"","sources":["../../src/test/client.walkSegments.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAChC,MAAM,eAAe,GAAG,WAAW,CAAC;IACpC,MAAM,IAAI,GAAG,OAAO,CAAC;IACrB,MAAM,IAAI,GAAG,OAAO,CAAC;IACrB,IAAI,MAAkB,CAAC;IAEvB,UAAU,CAAC,GAAG,EAAE;QACf,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC1B,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE;YACzB,QAAQ,EAAE,CAAC;YACX,MAAM,IAAI,CAAC,CAAC,YAAY,CAAC;YACzB,OAAO,IAAI,CAAC;QACb,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC7B,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,YAAY,CAClB,CAAC,CAAC,EAAE,EAAE;YACL,QAAQ,EAAE,CAAC;YACX,MAAM,IAAI,CAAC,CAAC,YAAY,CAAC;YACzB,OAAO,IAAI,CAAC;QACb,CAAC,EACD,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,MAAM,GAAG,CAAC,CACf,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,YAAY,CAClB,CAAC,CAAC,EAAE,EAAE;YACL,QAAQ,EAAE,CAAC;YACX,MAAM,IAAI,CAAC,CAAC,YAAY,CAAC;YACzB,OAAO,IAAI,CAAC;QACb,CAAC,EACD,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,SAAS,EACT,IAAI,CACJ,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { TestClient } from \"./testClient.js\";\n\ndescribe(\"client.applyMsg\", () => {\n\tconst localUserLongId = \"localUser\";\n\tconst seg1 = \"hello\";\n\tconst seg2 = \"world\";\n\tlet client: TestClient;\n\n\tbeforeEach(() => {\n\t\tclient = new TestClient();\n\t\tclient.insertTextLocal(client.getLength(), seg1);\n\t\tclient.insertTextLocal(client.getLength(), seg2);\n\t\tclient.startOrUpdateCollaboration(localUserLongId);\n\t});\n\n\tit(\"Walk All Segments\", () => {\n\t\tlet segCount = 0;\n\t\tlet segLen = 0;\n\t\tclient.walkSegments((s) => {\n\t\t\tsegCount++;\n\t\t\tsegLen += s.cachedLength;\n\t\t\treturn true;\n\t\t});\n\t\tassert.equal(segCount, 2);\n\t\tassert.equal(segLen, seg1.length + seg2.length);\n\t});\n\n\tit(\"Walk Segment Range\", () => {\n\t\tlet segCount = 0;\n\t\tlet segLen = 0;\n\t\tclient.walkSegments(\n\t\t\t(s) => {\n\t\t\t\tsegCount++;\n\t\t\t\tsegLen += s.cachedLength;\n\t\t\t\treturn true;\n\t\t\t},\n\t\t\tseg1.length - 2,\n\t\t\tseg1.length + 2,\n\t\t);\n\t\tassert.equal(segCount, 2);\n\t\tassert.equal(segLen, seg1.length + seg2.length);\n\t});\n\n\tit(\"Walk Segment Range With Split\", () => {\n\t\tlet segCount = 0;\n\t\tlet segLen = 0;\n\t\tclient.walkSegments(\n\t\t\t(s) => {\n\t\t\t\tsegCount++;\n\t\t\t\tsegLen += s.cachedLength;\n\t\t\t\treturn true;\n\t\t\t},\n\t\t\tseg1.length - 2,\n\t\t\tseg1.length + 2,\n\t\t\tundefined,\n\t\t\ttrue,\n\t\t);\n\t\tassert.equal(segCount, 2);\n\t\tassert.equal(segLen, 4);\n\t});\n});\n"]}

package/lib/test/collections.list.spec.d.ts

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

package/lib/test/collections.list.spec.d.ts.map

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

package/lib/test/collections.list.spec.js

@@ -0,0 +1,82 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { DoublyLinkedList, walkList } from "../collections/index.js";
+describe("Collections.DoublyLinkedList", () => {
+    const listCount = 5;
+    let list;
+    beforeEach(() => {
+        list = new DoublyLinkedList();
+        for (let i = 0; i < listCount; i++) {
+            list.unshift(i);
+        }
+    });
+    describe(".length", () => {
+        it("Should return the total number of items in the list", () => assert.equal(list.length, listCount, "The list count doesn't match the expected count."));
+    });
+    describe(".first", () => {
+        it("Should return the first item in the list", () => assert.equal(list.first?.data, listCount - 1, "first item not expected value"));
+    });
+    describe(".last", () => {
+        it("Should return the last item in the list", () => assert.equal(list.last?.data, 0, "last item not expected value"));
+    });
+    describe("walkList", () => {
+        it("Should walk all items of the list", () => {
+            let i = listCount - 1;
+            walkList(list, (node) => {
+                assert.equal(node.data, i, "elemeted not expected value");
+                i--;
+            });
+        });
+    });
+    describe(".iterator", () => {
+        it("Should walk all items of the list", () => {
+            let i = listCount - 1;
+            for (const item of list) {
+                assert.equal(item.data, i, "elemeted not expected value");
+                i--;
+            }
+        });
+    });
+    describe(".unshift", () => {
+        it("Should add item to the start of the list", () => {
+            list.unshift(99);
+            assert.equal(list.first?.data, 99, "first item not expected value");
+            assert.equal(list.length, listCount + 1, "The list count doesn't match the expected count.");
+        });
+    });
+    describe(".push", () => {
+        it("Should add item to the end of the list", () => {
+            list.push(99);
+            assert.equal(list.last?.data, 99, "last item not expected value");
+            assert.equal(list.length, listCount + 1, "The list count doesn't match the expected count.");
+        });
+    });
+    describe(".splice", () => {
+        for (const splicePos of [-1, 0, 1, Math.floor(listCount / 2), listCount, listCount - 1]) {
+            it(`splice at position ${splicePos}`, () => {
+                const nodesArray = [...list];
+                // negative numbers for the start move back from the end
+                // see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice#syntax
+                const spliceIndex = splicePos < 0 ? nodesArray.length + splicePos : splicePos;
+                // capture the node for the list splice
+                const spliceNode = nodesArray[spliceIndex];
+                const arraySplice = nodesArray.splice(spliceIndex);
+                const listSplice = spliceNode === undefined ? new DoublyLinkedList() : list.splice(spliceNode);
+                assert.equal(list.length, nodesArray.length, "remaining lengths don't match");
+                assert.equal(listSplice.length, arraySplice.length, "spliced lengths don't match");
+                const listNodes = [...list];
+                for (let i = 0; i < listNodes.length; i++) {
+                    assert.equal(listNodes[i], nodesArray[i], `remaining node mismatch at pos ${i}`);
+                }
+                const listSpliceNodes = [...listSplice];
+                for (let i = 0; i < listSpliceNodes.length; i++) {
+                    assert.equal(listSpliceNodes[i], arraySplice[i], `splice node mismatch at pos ${i}`);
+                }
+            });
+        }
+    });
+});
+//# sourceMappingURL=collections.list.spec.js.map

package/lib/test/collections.list.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.list.spec.js","sourceRoot":"","sources":["../../src/test/collections.list.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAErE,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;IAC7C,MAAM,SAAS,GAAG,CAAC,CAAC;IACpB,IAAI,IAA8B,CAAC;IAEnC,UAAU,CAAC,GAAG,EAAE;QACf,IAAI,GAAG,IAAI,gBAAgB,EAAU,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YACnC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAChB;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE,CAC9D,MAAM,CAAC,KAAK,CACX,IAAI,CAAC,MAAM,EACX,SAAS,EACT,kDAAkD,CAClD,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE,CACnD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,GAAG,CAAC,EAAE,+BAA+B,CAAC,CAAC,CAAC;IAClF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE,CAClD,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,8BAA8B,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC5C,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;YACtB,QAAQ,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBACvB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,6BAA6B,CAAC,CAAC;gBAC1D,CAAC,EAAE,CAAC;YACL,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC5C,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC;YACtB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;gBACxB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,6BAA6B,CAAC,CAAC;gBAC1D,CAAC,EAAE,CAAC;aACJ;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YACnD,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACjB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,+BAA+B,CAAC,CAAC;YACpE,MAAM,CAAC,KAAK,CACX,IAAI,CAAC,MAAM,EACX,SAAS,GAAG,CAAC,EACb,kDAAkD,CAClD,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACd,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,8BAA8B,CAAC,CAAC;YAClE,MAAM,CAAC,KAAK,CACX,IAAI,CAAC,MAAM,EACX,SAAS,GAAG,CAAC,EACb,kDAAkD,CAClD,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,KAAK,MAAM,SAAS,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,CAAC,EAAE;YACxF,EAAE,CAAC,sBAAsB,SAAS,EAAE,EAAE,GAAG,EAAE;gBAC1C,MAAM,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC7B,wDAAwD;gBACxD,2GAA2G;gBAC3G,MAAM,WAAW,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC9E,uCAAuC;gBACvC,MAAM,UAAU,GAAG,UAAU,CAAC,WAAW,CAAC,CAAC;gBAC3C,MAAM,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;gBAEnD,MAAM,UAAU,GACf,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,gBAAgB,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;gBAE7E,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,+BAA+B,CAAC,CAAC;gBAC9E,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,6BAA6B,CAAC,CAAC;gBAEnF,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAC1C,MAAM,CAAC,KAAK,CACX,SAAS,CAAC,CAAC,CAAC,EACZ,UAAU,CAAC,CAAC,CAAC,EACb,kCAAkC,CAAC,EAAE,CACrC,CAAC;iBACF;gBAED,MAAM,eAAe,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBAChD,MAAM,CAAC,KAAK,CACX,eAAe,CAAC,CAAC,CAAC,EAClB,WAAW,CAAC,CAAC,CAAC,EACd,+BAA+B,CAAC,EAAE,CAClC,CAAC;iBACF;YACF,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { DoublyLinkedList, walkList } from \"../collections/index.js\";\n\ndescribe(\"Collections.DoublyLinkedList\", () => {\n\tconst listCount = 5;\n\tlet list: DoublyLinkedList<number>;\n\n\tbeforeEach(() => {\n\t\tlist = new DoublyLinkedList<number>();\n\t\tfor (let i = 0; i < listCount; i++) {\n\t\t\tlist.unshift(i);\n\t\t}\n\t});\n\n\tdescribe(\".length\", () => {\n\t\tit(\"Should return the total number of items in the list\", () =>\n\t\t\tassert.equal(\n\t\t\t\tlist.length,\n\t\t\t\tlistCount,\n\t\t\t\t\"The list count doesn't match the expected count.\",\n\t\t\t));\n\t});\n\n\tdescribe(\".first\", () => {\n\t\tit(\"Should return the first item in the list\", () =>\n\t\t\tassert.equal(list.first?.data, listCount - 1, \"first item not expected value\"));\n\t});\n\n\tdescribe(\".last\", () => {\n\t\tit(\"Should return the last item in the list\", () =>\n\t\t\tassert.equal(list.last?.data, 0, \"last item not expected value\"));\n\t});\n\n\tdescribe(\"walkList\", () => {\n\t\tit(\"Should walk all items of the list\", () => {\n\t\t\tlet i = listCount - 1;\n\t\t\twalkList(list, (node) => {\n\t\t\t\tassert.equal(node.data, i, \"elemeted not expected value\");\n\t\t\t\ti--;\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe(\".iterator\", () => {\n\t\tit(\"Should walk all items of the list\", () => {\n\t\t\tlet i = listCount - 1;\n\t\t\tfor (const item of list) {\n\t\t\t\tassert.equal(item.data, i, \"elemeted not expected value\");\n\t\t\t\ti--;\n\t\t\t}\n\t\t});\n\t});\n\n\tdescribe(\".unshift\", () => {\n\t\tit(\"Should add item to the start of the list\", () => {\n\t\t\tlist.unshift(99);\n\t\t\tassert.equal(list.first?.data, 99, \"first item not expected value\");\n\t\t\tassert.equal(\n\t\t\t\tlist.length,\n\t\t\t\tlistCount + 1,\n\t\t\t\t\"The list count doesn't match the expected count.\",\n\t\t\t);\n\t\t});\n\t});\n\tdescribe(\".push\", () => {\n\t\tit(\"Should add item to the end of the list\", () => {\n\t\t\tlist.push(99);\n\t\t\tassert.equal(list.last?.data, 99, \"last item not expected value\");\n\t\t\tassert.equal(\n\t\t\t\tlist.length,\n\t\t\t\tlistCount + 1,\n\t\t\t\t\"The list count doesn't match the expected count.\",\n\t\t\t);\n\t\t});\n\t});\n\n\tdescribe(\".splice\", () => {\n\t\tfor (const splicePos of [-1, 0, 1, Math.floor(listCount / 2), listCount, listCount - 1]) {\n\t\t\tit(`splice at position ${splicePos}`, () => {\n\t\t\t\tconst nodesArray = [...list];\n\t\t\t\t// negative numbers for the start move back from the end\n\t\t\t\t// see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice#syntax\n\t\t\t\tconst spliceIndex = splicePos < 0 ? nodesArray.length + splicePos : splicePos;\n\t\t\t\t// capture the node for the list splice\n\t\t\t\tconst spliceNode = nodesArray[spliceIndex];\n\t\t\t\tconst arraySplice = nodesArray.splice(spliceIndex);\n\n\t\t\t\tconst listSplice =\n\t\t\t\t\tspliceNode === undefined ? new DoublyLinkedList() : list.splice(spliceNode);\n\n\t\t\t\tassert.equal(list.length, nodesArray.length, \"remaining lengths don't match\");\n\t\t\t\tassert.equal(listSplice.length, arraySplice.length, \"spliced lengths don't match\");\n\n\t\t\t\tconst listNodes = [...list];\n\t\t\t\tfor (let i = 0; i < listNodes.length; i++) {\n\t\t\t\t\tassert.equal(\n\t\t\t\t\t\tlistNodes[i],\n\t\t\t\t\t\tnodesArray[i],\n\t\t\t\t\t\t`remaining node mismatch at pos ${i}`,\n\t\t\t\t\t);\n\t\t\t\t}\n\n\t\t\t\tconst listSpliceNodes = [...listSplice];\n\t\t\t\tfor (let i = 0; i < listSpliceNodes.length; i++) {\n\t\t\t\t\tassert.equal(\n\t\t\t\t\t\tlistSpliceNodes[i],\n\t\t\t\t\t\tarraySplice[i],\n\t\t\t\t\t\t`splice node mismatch at pos ${i}`,\n\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t});\n});\n"]}

package/lib/test/createInsertOnlyAttributionPolicy.spec.d.ts

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

package/lib/test/createInsertOnlyAttributionPolicy.spec.d.ts.map

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

package/lib/test/createInsertOnlyAttributionPolicy.spec.js

@@ -0,0 +1,33 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { createInsertOnlyAttributionPolicy } from "../attributionPolicy.js";
+import { TestClient } from "./testClient.js";
+const localUserLongId = "localUser";
+describe("createInsertOnlyAttributionPolicy", () => {
+    let client;
+    let seq = 0;
+    beforeEach(() => {
+        client = new TestClient({
+            attribution: {
+                track: true,
+                policyFactory: createInsertOnlyAttributionPolicy,
+            },
+        });
+        seq = 0;
+    });
+    it("Attributes content on insert", () => {
+        client.startOrUpdateCollaboration(localUserLongId);
+        client.applyMsg(client.makeOpMessage(client.insertTextLocal(0, "ABC"), ++seq, seq - 1));
+        assert.deepEqual(client.getAllAttributionSeqs(), [1, 1, 1]);
+    });
+    it("Attributes content inserted before starting collaboration with a detached key", () => {
+        client.insertTextLocal(0, "C");
+        client.startOrUpdateCollaboration(localUserLongId);
+        client.applyMsg(client.makeOpMessage(client.insertTextLocal(0, "AB"), ++seq, seq - 1));
+        assert.deepEqual(client.getAllAttributionSeqs(), [1, 1, { type: "detached", id: 0 }]);
+    });
+});
+//# sourceMappingURL=createInsertOnlyAttributionPolicy.spec.js.map

package/lib/test/createInsertOnlyAttributionPolicy.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"createInsertOnlyAttributionPolicy.spec.js","sourceRoot":"","sources":["../../src/test/createInsertOnlyAttributionPolicy.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,iCAAiC,EAAE,MAAM,yBAAyB,CAAC;AAC5E,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,MAAM,eAAe,GAAG,WAAW,CAAC;AACpC,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;IAClD,IAAI,MAAkB,CAAC;IACvB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,UAAU,CAAC,GAAG,EAAE;QACf,MAAM,GAAG,IAAI,UAAU,CAAC;YACvB,WAAW,EAAE;gBACZ,KAAK,EAAE,IAAI;gBACX,aAAa,EAAE,iCAAiC;aAChD;SACD,CAAC,CAAC;QACH,GAAG,GAAG,CAAC,CAAC;IACT,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACxF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+EAA+E,EAAE,GAAG,EAAE;QACxF,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC/B,MAAM,CAAC,0BAA0B,CAAC,eAAe,CAAC,CAAC;QACnD,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACvF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,qBAAqB,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACvF,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { createInsertOnlyAttributionPolicy } from \"../attributionPolicy.js\";\nimport { TestClient } from \"./testClient.js\";\n\nconst localUserLongId = \"localUser\";\ndescribe(\"createInsertOnlyAttributionPolicy\", () => {\n\tlet client: TestClient;\n\tlet seq = 0;\n\tbeforeEach(() => {\n\t\tclient = new TestClient({\n\t\t\tattribution: {\n\t\t\t\ttrack: true,\n\t\t\t\tpolicyFactory: createInsertOnlyAttributionPolicy,\n\t\t\t},\n\t\t});\n\t\tseq = 0;\n\t});\n\n\tit(\"Attributes content on insert\", () => {\n\t\tclient.startOrUpdateCollaboration(localUserLongId);\n\t\tclient.applyMsg(client.makeOpMessage(client.insertTextLocal(0, \"ABC\"), ++seq, seq - 1));\n\t\tassert.deepEqual(client.getAllAttributionSeqs(), [1, 1, 1]);\n\t});\n\n\tit(\"Attributes content inserted before starting collaboration with a detached key\", () => {\n\t\tclient.insertTextLocal(0, \"C\");\n\t\tclient.startOrUpdateCollaboration(localUserLongId);\n\t\tclient.applyMsg(client.makeOpMessage(client.insertTextLocal(0, \"AB\"), ++seq, seq - 1));\n\t\tassert.deepEqual(client.getAllAttributionSeqs(), [1, 1, { type: \"detached\", id: 0 }]);\n\t});\n});\n"]}

package/lib/test/dirname.cjs

@@ -0,0 +1,16 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports._dirname = void 0;
+// Problem:
+//   - `__dirname` is not defined in ESM
+//   - `import.meta.url` is not defined in CJS
+// Solution:
+//   - Export '__dirname' from a .cjs file in the same directory.
+//
+// Note that *.cjs files are always CommonJS, but can be imported from ESM.
+exports._dirname = __dirname;
+//# sourceMappingURL=dirname.cjs.map

package/lib/test/dirname.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dirname.cjs","sourceRoot":"","sources":["../../src/test/dirname.cts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,WAAW;AACX,wCAAwC;AACxC,8CAA8C;AAC9C,YAAY;AACZ,iEAAiE;AACjE,EAAE;AACF,2EAA2E;AAC9D,QAAA,QAAQ,GAAG,SAAS,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// Problem:\n//   - `__dirname` is not defined in ESM\n//   - `import.meta.url` is not defined in CJS\n// Solution:\n//   - Export '__dirname' from a .cjs file in the same directory.\n//\n// Note that *.cjs files are always CommonJS, but can be imported from ESM.\nexport const _dirname = __dirname;\n"]}

package/lib/test/dirname.d.cts

@@ -0,0 +1,6 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export declare const _dirname: string;
+//# sourceMappingURL=dirname.d.cts.map

package/lib/test/dirname.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dirname.d.cts","sourceRoot":"","sources":["../../src/test/dirname.cts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,eAAO,MAAM,QAAQ,QAAY,CAAC"}

package/lib/test/index.d.ts

@@ -0,0 +1,13 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { createRevertDriver, getStats, MergeTreeStats, specToSegment, TestClient, TestClientRevertibleDriver, } from "./testClient.js";
+export { checkTextMatchRelative, TestServer } from "./testServer.js";
+export { countOperations, insertMarker, insertSegments, insertText, loadTextFromFile, loadTextFromFileWithMarkers, markRangeRemoved, nodeOrdinalsHaveIntegrity, validatePartialLengths, useStrictPartialLengthChecks, } from "./testUtils.js";
+export { annotateRange, applyMessages, doOverRange, generateClientNames, generateOperationMessagesForClients, IConfigRange, IMergeTreeOperationRunnerConfig, insertAtRefPos, removeRange, ReplayGroup, replayResultsPath, runMergeTreeOperationRunner, TestOperation, } from "./mergeTreeOperationRunner.js";
+export { LRUSegment, MergeTree } from "../mergeTree.js";
+export { MergeTreeTextHelper } from "../MergeTreeTextHelper.js";
+export { SnapshotLegacy } from "../snapshotlegacy.js";
+export { addProperties, appendToMergeTreeDeltaRevertibles, BaseSegment, Client, CollaborationWindow, compareReferencePositions, ConflictAction, createAnnotateRangeOp, createDetachedLocalReferencePosition, createGroupOp, createInsertOp, createInsertSegmentOp, createMap, createRemoveRangeOp, debugMarkerToString, DetachedReferencePosition, discardMergeTreeDeltaRevertible, IJSONMarkerSegment, IJSONSegment, IMarkerDef, IMergeNodeCommon, IMergeTreeAnnotateMsg, IMergeTreeClientSequenceArgs, IMergeTreeDelta, IMergeTreeDeltaCallbackArgs, IMergeTreeDeltaOp, IMergeTreeDeltaOpArgs, IMergeTreeGroupMsg, IMergeTreeInsertMsg, IMergeTreeMaintenanceCallbackArgs, IMergeTreeOp, IMergeTreeRemoveMsg, IMergeTreeSegmentDelta, IMergeTreeTextHelper, IRBAugmentation, IRBMatcher, IRelativePosition, IRemovalInfo, ISegment, ISegmentAction, KeyComparer, LocalReferenceCollection, LocalReferencePosition, MapLike, Marker, matchProperties, maxReferencePosition, MergeNode, MergeTreeDeltaOperationType, MergeTreeDeltaOperationTypes, MergeTreeDeltaRevertible, MergeTreeDeltaType, MergeTreeMaintenanceType, MergeTreeRevertibleDriver, minReferencePosition, PropertiesManager, Property, PropertyAction, PropertySet, RBNode, RBNodeActions, RedBlackTree, ReferencePosition, ReferenceType, refGetTileLabels, refHasTileLabel, refHasTileLabels, refTypeIncludesFlag, reservedMarkerIdKey, reservedMarkerSimpleTypeKey, reservedTileLabelsKey, revertMergeTreeDeltaRevertibles, SegmentGroup, SegmentGroupCollection, SortedSegmentSet, SortedSegmentSetItem, SortedSet, TextSegment, toRemovalInfo, Trackable, TrackingGroup, TrackingGroupCollection, UnassignedSequenceNumber, UniversalSequenceNumber, } from "../index.js";
+//# sourceMappingURL=index.d.ts.map

package/lib/test/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/test/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,kBAAkB,EAClB,QAAQ,EACR,cAAc,EACd,aAAa,EACb,UAAU,EACV,0BAA0B,GAC1B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EACN,eAAe,EACf,YAAY,EACZ,cAAc,EACd,UAAU,EACV,gBAAgB,EAChB,2BAA2B,EAC3B,gBAAgB,EAChB,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,GAC5B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACN,aAAa,EACb,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,mCAAmC,EACnC,YAAY,EACZ,+BAA+B,EAC/B,cAAc,EACd,WAAW,EACX,WAAW,EACX,iBAAiB,EACjB,2BAA2B,EAC3B,aAAa,GACb,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EACN,aAAa,EACb,iCAAiC,EACjC,WAAW,EACX,MAAM,EACN,mBAAmB,EACnB,yBAAyB,EACzB,cAAc,EACd,qBAAqB,EACrB,oCAAoC,EACpC,aAAa,EACb,cAAc,EACd,qBAAqB,EACrB,SAAS,EACT,mBAAmB,EACnB,mBAAmB,EACnB,yBAAyB,EACzB,+BAA+B,EAC/B,kBAAkB,EAClB,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,qBAAqB,EACrB,4BAA4B,EAC5B,eAAe,EACf,2BAA2B,EAC3B,iBAAiB,EACjB,qBAAqB,EACrB,kBAAkB,EAClB,mBAAmB,EACnB,iCAAiC,EACjC,YAAY,EACZ,mBAAmB,EACnB,sBAAsB,EACtB,oBAAoB,EACpB,eAAe,EACf,UAAU,EACV,iBAAiB,EACjB,YAAY,EACZ,QAAQ,EACR,cAAc,EACd,WAAW,EACX,wBAAwB,EACxB,sBAAsB,EACtB,OAAO,EACP,MAAM,EACN,eAAe,EACf,oBAAoB,EACpB,SAAS,EACT,2BAA2B,EAC3B,4BAA4B,EAC5B,wBAAwB,EACxB,kBAAkB,EAClB,wBAAwB,EACxB,yBAAyB,EACzB,oBAAoB,EACpB,iBAAiB,EACjB,QAAQ,EACR,cAAc,EACd,WAAW,EACX,MAAM,EACN,aAAa,EACb,YAAY,EACZ,iBAAiB,EACjB,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,gBAAgB,EAChB,mBAAmB,EACnB,mBAAmB,EACnB,2BAA2B,EAC3B,qBAAqB,EACrB,+BAA+B,EAC/B,YAAY,EACZ,sBAAsB,EACtB,gBAAgB,EAChB,oBAAoB,EACpB,SAAS,EACT,WAAW,EACX,aAAa,EACb,SAAS,EACT,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,uBAAuB,GACvB,MAAM,aAAa,CAAC"}

package/lib/test/index.js

@@ -0,0 +1,13 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export { createRevertDriver, getStats, specToSegment, TestClient, } from "./testClient.js";
+export { checkTextMatchRelative, TestServer } from "./testServer.js";
+export { countOperations, insertMarker, insertSegments, insertText, loadTextFromFile, loadTextFromFileWithMarkers, markRangeRemoved, nodeOrdinalsHaveIntegrity, validatePartialLengths, useStrictPartialLengthChecks, } from "./testUtils.js";
+export { annotateRange, applyMessages, doOverRange, generateClientNames, generateOperationMessagesForClients, insertAtRefPos, removeRange, replayResultsPath, runMergeTreeOperationRunner, } from "./mergeTreeOperationRunner.js";
+export { MergeTree } from "../mergeTree.js";
+export { MergeTreeTextHelper } from "../MergeTreeTextHelper.js";
+export { SnapshotLegacy } from "../snapshotlegacy.js";
+export { addProperties, appendToMergeTreeDeltaRevertibles, BaseSegment, Client, CollaborationWindow, compareReferencePositions, createAnnotateRangeOp, createDetachedLocalReferencePosition, createGroupOp, createInsertOp, createInsertSegmentOp, createMap, createRemoveRangeOp, debugMarkerToString, DetachedReferencePosition, discardMergeTreeDeltaRevertible, LocalReferenceCollection, Marker, matchProperties, maxReferencePosition, MergeNode, MergeTreeDeltaType, MergeTreeMaintenanceType, minReferencePosition, PropertiesManager, RedBlackTree, ReferenceType, refGetTileLabels, refHasTileLabel, refHasTileLabels, refTypeIncludesFlag, reservedMarkerIdKey, reservedMarkerSimpleTypeKey, reservedTileLabelsKey, revertMergeTreeDeltaRevertibles, SegmentGroupCollection, SortedSegmentSet, SortedSet, TextSegment, toRemovalInfo, TrackingGroup, TrackingGroupCollection, UnassignedSequenceNumber, UniversalSequenceNumber, } from "../index.js";
+//# sourceMappingURL=index.js.map

package/lib/test/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/test/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,kBAAkB,EAClB,QAAQ,EAER,aAAa,EACb,UAAU,GAEV,MAAM,iBAAiB,CAAC;AACzB,OAAO,EAAE,sBAAsB,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AACrE,OAAO,EACN,eAAe,EACf,YAAY,EACZ,cAAc,EACd,UAAU,EACV,gBAAgB,EAChB,2BAA2B,EAC3B,gBAAgB,EAChB,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,GAC5B,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACN,aAAa,EACb,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,mCAAmC,EAGnC,cAAc,EACd,WAAW,EAEX,iBAAiB,EACjB,2BAA2B,GAE3B,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAc,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EACN,aAAa,EACb,iCAAiC,EACjC,WAAW,EACX,MAAM,EACN,mBAAmB,EACnB,yBAAyB,EAEzB,qBAAqB,EACrB,oCAAoC,EACpC,aAAa,EACb,cAAc,EACd,qBAAqB,EACrB,SAAS,EACT,mBAAmB,EACnB,mBAAmB,EACnB,yBAAyB,EACzB,+BAA+B,EAyB/B,wBAAwB,EAGxB,MAAM,EACN,eAAe,EACf,oBAAoB,EACpB,SAAS,EAIT,kBAAkB,EAClB,wBAAwB,EAExB,oBAAoB,EACpB,iBAAiB,EAMjB,YAAY,EAEZ,aAAa,EACb,gBAAgB,EAChB,eAAe,EACf,gBAAgB,EAChB,mBAAmB,EACnB,mBAAmB,EACnB,2BAA2B,EAC3B,qBAAqB,EACrB,+BAA+B,EAE/B,sBAAsB,EACtB,gBAAgB,EAEhB,SAAS,EACT,WAAW,EACX,aAAa,EAEb,aAAa,EACb,uBAAuB,EACvB,wBAAwB,EACxB,uBAAuB,GACvB,MAAM,aAAa,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport {\n\tcreateRevertDriver,\n\tgetStats,\n\tMergeTreeStats,\n\tspecToSegment,\n\tTestClient,\n\tTestClientRevertibleDriver,\n} from \"./testClient.js\";\nexport { checkTextMatchRelative, TestServer } from \"./testServer.js\";\nexport {\n\tcountOperations,\n\tinsertMarker,\n\tinsertSegments,\n\tinsertText,\n\tloadTextFromFile,\n\tloadTextFromFileWithMarkers,\n\tmarkRangeRemoved,\n\tnodeOrdinalsHaveIntegrity,\n\tvalidatePartialLengths,\n\tuseStrictPartialLengthChecks,\n} from \"./testUtils.js\";\nexport {\n\tannotateRange,\n\tapplyMessages,\n\tdoOverRange,\n\tgenerateClientNames,\n\tgenerateOperationMessagesForClients,\n\tIConfigRange,\n\tIMergeTreeOperationRunnerConfig,\n\tinsertAtRefPos,\n\tremoveRange,\n\tReplayGroup,\n\treplayResultsPath,\n\trunMergeTreeOperationRunner,\n\tTestOperation,\n} from \"./mergeTreeOperationRunner.js\";\nexport { LRUSegment, MergeTree } from \"../mergeTree.js\";\nexport { MergeTreeTextHelper } from \"../MergeTreeTextHelper.js\";\nexport { SnapshotLegacy } from \"../snapshotlegacy.js\";\nexport {\n\taddProperties,\n\tappendToMergeTreeDeltaRevertibles,\n\tBaseSegment,\n\tClient,\n\tCollaborationWindow,\n\tcompareReferencePositions,\n\tConflictAction,\n\tcreateAnnotateRangeOp,\n\tcreateDetachedLocalReferencePosition,\n\tcreateGroupOp,\n\tcreateInsertOp,\n\tcreateInsertSegmentOp,\n\tcreateMap,\n\tcreateRemoveRangeOp,\n\tdebugMarkerToString,\n\tDetachedReferencePosition,\n\tdiscardMergeTreeDeltaRevertible,\n\tIJSONMarkerSegment,\n\tIJSONSegment,\n\tIMarkerDef,\n\tIMergeNodeCommon,\n\tIMergeTreeAnnotateMsg,\n\tIMergeTreeClientSequenceArgs,\n\tIMergeTreeDelta,\n\tIMergeTreeDeltaCallbackArgs,\n\tIMergeTreeDeltaOp,\n\tIMergeTreeDeltaOpArgs,\n\tIMergeTreeGroupMsg,\n\tIMergeTreeInsertMsg,\n\tIMergeTreeMaintenanceCallbackArgs,\n\tIMergeTreeOp,\n\tIMergeTreeRemoveMsg,\n\tIMergeTreeSegmentDelta,\n\tIMergeTreeTextHelper,\n\tIRBAugmentation,\n\tIRBMatcher,\n\tIRelativePosition,\n\tIRemovalInfo,\n\tISegment,\n\tISegmentAction,\n\tKeyComparer,\n\tLocalReferenceCollection,\n\tLocalReferencePosition,\n\tMapLike,\n\tMarker,\n\tmatchProperties,\n\tmaxReferencePosition,\n\tMergeNode,\n\tMergeTreeDeltaOperationType,\n\tMergeTreeDeltaOperationTypes,\n\tMergeTreeDeltaRevertible,\n\tMergeTreeDeltaType,\n\tMergeTreeMaintenanceType,\n\tMergeTreeRevertibleDriver,\n\tminReferencePosition,\n\tPropertiesManager,\n\tProperty,\n\tPropertyAction,\n\tPropertySet,\n\tRBNode,\n\tRBNodeActions,\n\tRedBlackTree,\n\tReferencePosition,\n\tReferenceType,\n\trefGetTileLabels,\n\trefHasTileLabel,\n\trefHasTileLabels,\n\trefTypeIncludesFlag,\n\treservedMarkerIdKey,\n\treservedMarkerSimpleTypeKey,\n\treservedTileLabelsKey,\n\trevertMergeTreeDeltaRevertibles,\n\tSegmentGroup,\n\tSegmentGroupCollection,\n\tSortedSegmentSet,\n\tSortedSegmentSetItem,\n\tSortedSet,\n\tTextSegment,\n\ttoRemovalInfo,\n\tTrackable,\n\tTrackingGroup,\n\tTrackingGroupCollection,\n\tUnassignedSequenceNumber,\n\tUniversalSequenceNumber,\n} from \"../index.js\";\n"]}

package/lib/test/mergeTree.annotate.deltaCallback.spec.d.ts

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

package/lib/test/mergeTree.annotate.deltaCallback.spec.d.ts.map

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

package/lib/test/mergeTree.annotate.deltaCallback.spec.js

@@ -0,0 +1,140 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { strict as assert } from "assert";
+import { MergeTreeDeltaType } from "../ops.js";
+import { MergeTreeMaintenanceType } from "../mergeTreeDeltaCallback.js";
+import { LocalClientId, UnassignedSequenceNumber, UniversalSequenceNumber } from "../constants.js";
+import { TextSegment } from "../textSegment.js";
+import { MergeTree } from "../mergeTree.js";
+import { countOperations, insertSegments, insertText, markRangeRemoved } from "./testUtils.js";
+describe("MergeTree", () => {
+    let mergeTree;
+    const localClientId = 17;
+    let currentSequenceNumber;
+    beforeEach(() => {
+        mergeTree = new MergeTree();
+        insertSegments({
+            mergeTree,
+            pos: 0,
+            segments: [TextSegment.make("hello world")],
+            refSeq: UniversalSequenceNumber,
+            clientId: LocalClientId,
+            seq: UniversalSequenceNumber,
+            opArgs: undefined,
+        });
+        currentSequenceNumber = 0;
+        mergeTree.startCollaboration(localClientId, 
+        /* minSeq: */ currentSequenceNumber, 
+        /* currentSeq: */ currentSequenceNumber);
+    });
+    describe("annotateRange", () => {
+        it("Event on annotation", () => {
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(4, 6, {
+                foo: "bar",
+            }, currentSequenceNumber, localClientId, UnassignedSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeDeltaType.ANNOTATE]: 1,
+                [MergeTreeMaintenanceType.SPLIT]: 2,
+            });
+        });
+        it("No event on annotation of empty range", () => {
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(3, 3, {
+                foo: "bar",
+            }, currentSequenceNumber, localClientId, ++currentSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeMaintenanceType.SPLIT]: 1,
+            });
+        });
+        it("Annotate over local insertion", () => {
+            insertText({
+                mergeTree,
+                pos: 4,
+                refSeq: currentSequenceNumber,
+                clientId: localClientId,
+                seq: UnassignedSequenceNumber,
+                text: "a",
+                props: undefined,
+                opArgs: undefined,
+            });
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(3, 8, {
+                foo: "bar",
+            }, currentSequenceNumber, localClientId, UnassignedSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeDeltaType.ANNOTATE]: 1,
+                [MergeTreeMaintenanceType.SPLIT]: 2,
+            });
+        });
+        it("Annotate over remote insertion", () => {
+            const remoteClientId = 35;
+            let remoteSequenceNumber = currentSequenceNumber;
+            insertText({
+                mergeTree,
+                pos: 4,
+                refSeq: remoteSequenceNumber,
+                clientId: remoteClientId,
+                seq: ++remoteSequenceNumber,
+                text: "a",
+                props: undefined,
+                opArgs: undefined,
+            });
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(3, 8, {
+                foo: "bar",
+            }, currentSequenceNumber, localClientId, UnassignedSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeDeltaType.ANNOTATE]: 1,
+                [MergeTreeMaintenanceType.SPLIT]: 2,
+            });
+        });
+        it("Annotate over remote deletion", () => {
+            const remoteClientId = 35;
+            let remoteSequenceNumber = currentSequenceNumber;
+            markRangeRemoved({
+                mergeTree,
+                start: 4,
+                end: 6,
+                refSeq: remoteSequenceNumber,
+                clientId: remoteClientId,
+                seq: ++remoteSequenceNumber,
+                overwrite: false,
+                opArgs: undefined,
+            });
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(3, 8, {
+                foo: "bar",
+            }, currentSequenceNumber, localClientId, UnassignedSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeDeltaType.ANNOTATE]: 1,
+                [MergeTreeMaintenanceType.SPLIT]: 2,
+            });
+        });
+        it("Remote annotate within local deletion", () => {
+            const remoteClientId = 35;
+            let remoteSequenceNumber = currentSequenceNumber;
+            markRangeRemoved({
+                mergeTree,
+                start: 3,
+                end: 8,
+                refSeq: currentSequenceNumber,
+                clientId: localClientId,
+                seq: UnassignedSequenceNumber,
+                overwrite: false,
+                opArgs: undefined,
+            });
+            const count = countOperations(mergeTree);
+            mergeTree.annotateRange(4, 6, {
+                foo: "bar",
+            }, remoteSequenceNumber, remoteClientId, ++remoteSequenceNumber, undefined);
+            assert.deepStrictEqual(count, {
+                [MergeTreeDeltaType.ANNOTATE]: 1,
+                [MergeTreeMaintenanceType.SPLIT]: 2,
+            });
+        });
+    });
+});
+//# sourceMappingURL=mergeTree.annotate.deltaCallback.spec.js.map

package/lib/test/mergeTree.annotate.deltaCallback.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mergeTree.annotate.deltaCallback.spec.js","sourceRoot":"","sources":["../../src/test/mergeTree.annotate.deltaCallback.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,wBAAwB,EAAE,MAAM,8BAA8B,CAAC;AACxE,OAAO,EAAE,aAAa,EAAE,wBAAwB,EAAE,uBAAuB,EAAE,MAAM,iBAAiB,CAAC;AACnG,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAE/F,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IAC1B,IAAI,SAAoB,CAAC;IACzB,MAAM,aAAa,GAAG,EAAE,CAAC;IACzB,IAAI,qBAA6B,CAAC;IAClC,UAAU,CAAC,GAAG,EAAE;QACf,SAAS,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,cAAc,CAAC;YACd,SAAS;YACT,GAAG,EAAE,CAAC;YACN,QAAQ,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC3C,MAAM,EAAE,uBAAuB;YAC/B,QAAQ,EAAE,aAAa;YACvB,GAAG,EAAE,uBAAuB;YAC5B,MAAM,EAAE,SAAS;SACjB,CAAC,CAAC;QAEH,qBAAqB,GAAG,CAAC,CAAC;QAC1B,SAAS,CAAC,kBAAkB,CAC3B,aAAa;QACb,aAAa,CAAC,qBAAqB;QACnC,iBAAiB,CAAC,qBAAqB,CACvC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YAEzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,qBAAqB,EACrB,aAAa,EACb,wBAAwB,EACxB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAChD,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YACzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,qBAAqB,EACrB,aAAa,EACb,EAAE,qBAAqB,EACvB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACxC,UAAU,CAAC;gBACV,SAAS;gBACT,GAAG,EAAE,CAAC;gBACN,MAAM,EAAE,qBAAqB;gBAC7B,QAAQ,EAAE,aAAa;gBACvB,GAAG,EAAE,wBAAwB;gBAC7B,IAAI,EAAE,GAAG;gBACT,KAAK,EAAE,SAAS;gBAChB,MAAM,EAAE,SAAS;aACjB,CAAC,CAAC;YAEH,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YAEzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,qBAAqB,EACrB,aAAa,EACb,wBAAwB,EACxB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,cAAc,GAAW,EAAE,CAAC;YAClC,IAAI,oBAAoB,GAAG,qBAAqB,CAAC;YAEjD,UAAU,CAAC;gBACV,SAAS;gBACT,GAAG,EAAE,CAAC;gBACN,MAAM,EAAE,oBAAoB;gBAC5B,QAAQ,EAAE,cAAc;gBACxB,GAAG,EAAE,EAAE,oBAAoB;gBAC3B,IAAI,EAAE,GAAG;gBACT,KAAK,EAAE,SAAS;gBAChB,MAAM,EAAE,SAAS;aACjB,CAAC,CAAC;YAEH,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YAEzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,qBAAqB,EACrB,aAAa,EACb,wBAAwB,EACxB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACxC,MAAM,cAAc,GAAW,EAAE,CAAC;YAClC,IAAI,oBAAoB,GAAG,qBAAqB,CAAC;YAEjD,gBAAgB,CAAC;gBAChB,SAAS;gBACT,KAAK,EAAE,CAAC;gBACR,GAAG,EAAE,CAAC;gBACN,MAAM,EAAE,oBAAoB;gBAC5B,QAAQ,EAAE,cAAc;gBACxB,GAAG,EAAE,EAAE,oBAAoB;gBAC3B,SAAS,EAAE,KAAK;gBAChB,MAAM,EAAE,SAAgB;aACxB,CAAC,CAAC;YAEH,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YAEzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,qBAAqB,EACrB,aAAa,EACb,wBAAwB,EACxB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAChD,MAAM,cAAc,GAAW,EAAE,CAAC;YAClC,IAAI,oBAAoB,GAAG,qBAAqB,CAAC;YAEjD,gBAAgB,CAAC;gBAChB,SAAS;gBACT,KAAK,EAAE,CAAC;gBACR,GAAG,EAAE,CAAC;gBACN,MAAM,EAAE,qBAAqB;gBAC7B,QAAQ,EAAE,aAAa;gBACvB,GAAG,EAAE,wBAAwB;gBAC7B,SAAS,EAAE,KAAK;gBAChB,MAAM,EAAE,SAAgB;aACxB,CAAC,CAAC;YAEH,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAC;YAEzC,SAAS,CAAC,aAAa,CACtB,CAAC,EACD,CAAC,EACD;gBACC,GAAG,EAAE,KAAK;aACV,EACD,oBAAoB,EACpB,cAAc,EACd,EAAE,oBAAoB,EACtB,SAAgB,CAChB,CAAC;YAEF,MAAM,CAAC,eAAe,CAAC,KAAK,EAAE;gBAC7B,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,CAAC;aACnC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { MergeTreeDeltaType } from \"../ops.js\";\nimport { MergeTreeMaintenanceType } from \"../mergeTreeDeltaCallback.js\";\nimport { LocalClientId, UnassignedSequenceNumber, UniversalSequenceNumber } from \"../constants.js\";\nimport { TextSegment } from \"../textSegment.js\";\nimport { MergeTree } from \"../mergeTree.js\";\nimport { countOperations, insertSegments, insertText, markRangeRemoved } from \"./testUtils.js\";\n\ndescribe(\"MergeTree\", () => {\n\tlet mergeTree: MergeTree;\n\tconst localClientId = 17;\n\tlet currentSequenceNumber: number;\n\tbeforeEach(() => {\n\t\tmergeTree = new MergeTree();\n\t\tinsertSegments({\n\t\t\tmergeTree,\n\t\t\tpos: 0,\n\t\t\tsegments: [TextSegment.make(\"hello world\")],\n\t\t\trefSeq: UniversalSequenceNumber,\n\t\t\tclientId: LocalClientId,\n\t\t\tseq: UniversalSequenceNumber,\n\t\t\topArgs: undefined,\n\t\t});\n\n\t\tcurrentSequenceNumber = 0;\n\t\tmergeTree.startCollaboration(\n\t\t\tlocalClientId,\n\t\t\t/* minSeq: */ currentSequenceNumber,\n\t\t\t/* currentSeq: */ currentSequenceNumber,\n\t\t);\n\t});\n\n\tdescribe(\"annotateRange\", () => {\n\t\tit(\"Event on annotation\", () => {\n\t\t\tconst count = countOperations(mergeTree);\n\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t4,\n\t\t\t\t6,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tcurrentSequenceNumber,\n\t\t\t\tlocalClientId,\n\t\t\t\tUnassignedSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeDeltaType.ANNOTATE]: 1,\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 2,\n\t\t\t});\n\t\t});\n\n\t\tit(\"No event on annotation of empty range\", () => {\n\t\t\tconst count = countOperations(mergeTree);\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t3,\n\t\t\t\t3,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tcurrentSequenceNumber,\n\t\t\t\tlocalClientId,\n\t\t\t\t++currentSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 1,\n\t\t\t});\n\t\t});\n\n\t\tit(\"Annotate over local insertion\", () => {\n\t\t\tinsertText({\n\t\t\t\tmergeTree,\n\t\t\t\tpos: 4,\n\t\t\t\trefSeq: currentSequenceNumber,\n\t\t\t\tclientId: localClientId,\n\t\t\t\tseq: UnassignedSequenceNumber,\n\t\t\t\ttext: \"a\",\n\t\t\t\tprops: undefined,\n\t\t\t\topArgs: undefined,\n\t\t\t});\n\n\t\t\tconst count = countOperations(mergeTree);\n\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t3,\n\t\t\t\t8,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tcurrentSequenceNumber,\n\t\t\t\tlocalClientId,\n\t\t\t\tUnassignedSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeDeltaType.ANNOTATE]: 1,\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 2,\n\t\t\t});\n\t\t});\n\n\t\tit(\"Annotate over remote insertion\", () => {\n\t\t\tconst remoteClientId: number = 35;\n\t\t\tlet remoteSequenceNumber = currentSequenceNumber;\n\n\t\t\tinsertText({\n\t\t\t\tmergeTree,\n\t\t\t\tpos: 4,\n\t\t\t\trefSeq: remoteSequenceNumber,\n\t\t\t\tclientId: remoteClientId,\n\t\t\t\tseq: ++remoteSequenceNumber,\n\t\t\t\ttext: \"a\",\n\t\t\t\tprops: undefined,\n\t\t\t\topArgs: undefined,\n\t\t\t});\n\n\t\t\tconst count = countOperations(mergeTree);\n\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t3,\n\t\t\t\t8,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tcurrentSequenceNumber,\n\t\t\t\tlocalClientId,\n\t\t\t\tUnassignedSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeDeltaType.ANNOTATE]: 1,\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 2,\n\t\t\t});\n\t\t});\n\n\t\tit(\"Annotate over remote deletion\", () => {\n\t\t\tconst remoteClientId: number = 35;\n\t\t\tlet remoteSequenceNumber = currentSequenceNumber;\n\n\t\t\tmarkRangeRemoved({\n\t\t\t\tmergeTree,\n\t\t\t\tstart: 4,\n\t\t\t\tend: 6,\n\t\t\t\trefSeq: remoteSequenceNumber,\n\t\t\t\tclientId: remoteClientId,\n\t\t\t\tseq: ++remoteSequenceNumber,\n\t\t\t\toverwrite: false,\n\t\t\t\topArgs: undefined as any,\n\t\t\t});\n\n\t\t\tconst count = countOperations(mergeTree);\n\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t3,\n\t\t\t\t8,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tcurrentSequenceNumber,\n\t\t\t\tlocalClientId,\n\t\t\t\tUnassignedSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeDeltaType.ANNOTATE]: 1,\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 2,\n\t\t\t});\n\t\t});\n\n\t\tit(\"Remote annotate within local deletion\", () => {\n\t\t\tconst remoteClientId: number = 35;\n\t\t\tlet remoteSequenceNumber = currentSequenceNumber;\n\n\t\t\tmarkRangeRemoved({\n\t\t\t\tmergeTree,\n\t\t\t\tstart: 3,\n\t\t\t\tend: 8,\n\t\t\t\trefSeq: currentSequenceNumber,\n\t\t\t\tclientId: localClientId,\n\t\t\t\tseq: UnassignedSequenceNumber,\n\t\t\t\toverwrite: false,\n\t\t\t\topArgs: undefined as any,\n\t\t\t});\n\n\t\t\tconst count = countOperations(mergeTree);\n\n\t\t\tmergeTree.annotateRange(\n\t\t\t\t4,\n\t\t\t\t6,\n\t\t\t\t{\n\t\t\t\t\tfoo: \"bar\",\n\t\t\t\t},\n\t\t\t\tremoteSequenceNumber,\n\t\t\t\tremoteClientId,\n\t\t\t\t++remoteSequenceNumber,\n\t\t\t\tundefined as any,\n\t\t\t);\n\n\t\t\tassert.deepStrictEqual(count, {\n\t\t\t\t[MergeTreeDeltaType.ANNOTATE]: 1,\n\t\t\t\t[MergeTreeMaintenanceType.SPLIT]: 2,\n\t\t\t});\n\t\t});\n\t});\n});\n"]}

package/lib/test/mergeTree.annotate.spec.d.ts

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

package/lib/test/mergeTree.annotate.spec.d.ts.map

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