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

package/dist/test/obliterate.concurrent.spec.js

@@ -6,9 +6,9 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 const assert_1 = require("assert");
 const telemetry_utils_1 = require("@fluidframework/telemetry-utils");
-const partialLengths_1 = require("../partialLengths");
-const mergeTree_1 = require("../mergeTree");
-const reconnectHelper_1 = require("./reconnectHelper");
+const mergeTree_js_1 = require("../mergeTree.js");
+const reconnectHelper_js_1 = require("./reconnectHelper.js");
+const testUtils_js_1 = require("./testUtils.js");
 /**
  * Some tests contain ASCII diagrams of the trees to make it easier to reason about
  * structure. The format of these diagrams is this:
@@ -40,18 +40,15 @@ const reconnectHelper_1 = require("./reconnectHelper");
  */
 for (const incremental of [true, false]) {
     describe(`obliterate partial lengths incremental = ${incremental}`, () => {
+        (0, testUtils_js_1.useStrictPartialLengthChecks)();
         beforeEach(() => {
-            partialLengths_1.PartialSequenceLengths.options.verifier = partialLengths_1.verify;
-            partialLengths_1.PartialSequenceLengths.options.verifyExpected = partialLengths_1.verifyExpected;
-            mergeTree_1.MergeTree.options.incrementalUpdate = incremental;
+            mergeTree_js_1.MergeTree.options.incrementalUpdate = incremental;
         });
         afterEach(() => {
-            partialLengths_1.PartialSequenceLengths.options.verifier = undefined;
-            partialLengths_1.PartialSequenceLengths.options.verifyExpected = undefined;
-            mergeTree_1.MergeTree.options.incrementalUpdate = true;
+            mergeTree_js_1.MergeTree.options.incrementalUpdate = true;
         });
         it("length of children does not differ from parent when overlapping remove+obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // ABCDEFGH
             // I-[J]-(KLM-[ABC]-D-123456-E-[FG]-H)
             helper.insertText("A", 0, "ABCDEFGH");
@@ -67,7 +64,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes concurrent insert that occurs after obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "ABCD");
             helper.processAllOps();
             helper.obliterateRange("B", 0, 4);
@@ -78,7 +75,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes concurrent insert that occurs before obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "ABCD");
             helper.processAllOps();
             helper.insertText("C", 2, "X");
@@ -89,7 +86,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not delete unacked segment at start of string", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "ABC");
             helper.obliterateRange("C", 2, 3);
             helper.insertText("B", 0, "X");
@@ -100,7 +97,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("throws when local obliterate has range end outside length of local string", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "A");
             helper.insertText("C", 0, "B");
             try {
@@ -113,7 +110,7 @@ for (const incremental of [true, false]) {
             }
         });
         it("does not delete when obliterate immediately after insert", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "A");
             helper.obliterateRange("C", 0, 1);
             helper.insertText("B", 0, "W");
@@ -126,7 +123,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not delete remote insert when between local insert+obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "A");
             helper.insertText("B", 0, "X");
             helper.obliterateRange("C", 0, 1);
@@ -139,7 +136,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not delete remote insert when between local insert+obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "A");
             helper.obliterateRange("C", 0, 1);
             helper.insertText("B", 0, "B");
@@ -152,7 +149,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not delete remote insert when in middle of segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "ABC");
             helper.obliterateRange("C", 2, 3);
             helper.obliterateRange("C", 0, 1);
@@ -164,7 +161,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes segment inserted into locally obliterated segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "A");
             helper.insertText("B", 0, "X");
             helper.insertText("C", 0, "B");
@@ -176,7 +173,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("updates lengths after obliterated insertion", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "A");
             helper.insertText("B", 0, "X");
             helper.insertText("C", 0, "N");
@@ -192,7 +189,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("updates lengths when insertion causes tree to split", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "0");
             helper.insertText("C", 0, "123");
             helper.insertText("B", 0, "BB");
@@ -207,7 +204,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("length of node split by insertion does not count remotely obliterated segments", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "1");
             helper.insertText("A", 0, "2");
             helper.insertText("C", 0, "XXXX");
@@ -221,7 +218,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("length of node split by obliterate does not count remotely obliterated segments", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "1");
             helper.insertText("A", 0, "2");
             helper.insertText("C", 0, "XXXX");
@@ -236,7 +233,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("counts remotely but not concurrently inserted segments for length when tree is split", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // a-b-c-d-e-123
             // (a-b)-c-d-e-1-[2]-3
             helper.insertText("B", 0, "123");
@@ -254,7 +251,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does obliterate X for all clients", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "DE");
             helper.obliterateRange("B", 0, 1);
             helper.insertText("A", 0, "X");
@@ -266,7 +263,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not include remote but unacked segments in partial len calculation", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // 89-4567-123-X
             // 8-(9-4-w-567-1)-23-Y-X
             helper.insertText("A", 0, "X");
@@ -283,7 +280,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("correctly accounts for overlapping obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "AB");
             helper.processAllOps();
             helper.obliterateRange("C", 0, 1);
@@ -295,7 +292,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("correctly accounts for overlapping obliterate and remove", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "AB");
             helper.processAllOps();
             helper.removeRange("C", 0, 1);
@@ -307,7 +304,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("clones movedClientIds array during insert", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // the bug found here:
             // the X was skipped over by client `A` because it had already been
             // deleted, so its length at refSeq was 0
@@ -326,7 +323,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("client partial lens consider overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "123");
             helper.insertText("A", 0, "ABCDEF");
             helper.processAllOps();
@@ -340,7 +337,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("client partial lens consider overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("C", 0, "X");
             helper.insertText("C", 0, "ABCDEFG");
             helper.processAllOps();
@@ -353,7 +350,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("tracks obliterate refSeq when acking op for partial len calculation", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             //   v-----------------------v
             //           v--v
             //                  v--v
@@ -371,7 +368,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not have negative len when segment obliterated before insert", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // 1234567-D-C-AB
             // 12-([3-X-45]-67)-D-C-AB
             helper.insertText("A", 0, "AB");
@@ -390,7 +387,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not have negative len when segment obliterated before insert", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // ABCDE-1-[2]-3
             // (A-XX-B)-(CD)-E-1-3
             helper.insertText("B", 0, "123");
@@ -408,7 +405,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes segments between two obliterates with different seq", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // 90-8-1234-(5)-67-D-C-B-A
             // 9-(EFG-[0-8-1234-(5)-67)]-D-C-B-A
             helper.insertText("A", 0, "A");
@@ -428,7 +425,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes inserted segment when obliterate of different seq in-between", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "AB");
             helper.insertText("B", 0, "E");
             helper.obliterateRange("A", 0, 1);
@@ -442,7 +439,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes inserted segment when obliterate of different seq in-between", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "ABC");
             helper.obliterateRange("A", 1, 2);
             helper.processAllOps();
@@ -455,7 +452,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("deletes inserted segment when obliterate of different seq in-between", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "ABC");
             helper.obliterateRange("A", 1, 2);
             helper.processAllOps();
@@ -468,7 +465,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("considers obliterated local segments as remotely obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // G-(H-F-I-C)-J-DE-A-(B)
             // G-J-(H-F-I-CD)-E
             helper.insertText("A", 0, "AB");
@@ -485,7 +482,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("traverses hier block in obliterated when len at ref seq is >0 and len at len seq == 0", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "AB");
             helper.insertText("A", 2, "CD");
             helper.removeRange("A", 1, 3);
@@ -503,7 +500,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("traverses hier block in obliterate when len at ref seq is >0 and len at len seq == 0", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // [E]-FGH-12-[A]-[B]-CD
             // 3-4-F-[G-(H-1)-2]-CD
             helper.insertText("B", 0, "ABCD");
@@ -524,7 +521,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("ignores segments where movedSeq < seq for partial len calculations", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "ABC");
             helper.insertText("A", 0, "DEF");
             helper.removeRange("A", 1, 2);
@@ -541,7 +538,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("accounts for overlapping obliterates from same client", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "AB");
             helper.processAllOps();
             helper.logger.validate();
@@ -555,7 +552,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("accounts for concurrently obliterated segments from the perspective of the inserting client for partial lengths", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("B", 0, "A");
             helper.insertText("C", 0, "B");
             helper.insertText("C", 0, "C");
@@ -570,7 +567,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("traverses segments when there is a local obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             helper.insertText("A", 0, "AB");
             helper.obliterateRange("A", 0, 1);
             helper.insertText("C", 0, "12");
@@ -583,7 +580,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("keeps track of all obliterates on a segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // B-A
             // (B-C-(A))
             helper.insertText("C", 0, "A");
@@ -604,7 +601,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("many overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // EF-ABCD
             // (1)-2-((E)-F-A)-B-(C)-D
             helper.insertText("C", 0, "ABCD");
@@ -621,7 +618,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterates at start", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // 12345-B-A
             // ((1-C-2)-3)-4-D-5-B-A
             helper.insertText("C", 0, "A");
@@ -637,7 +634,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("partial lengths updated when local insert is acked", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // A-BCDEF
             // (A-B-G-C)-D-I-E-H-F
             helper.insertText("A", 0, "A");
@@ -656,7 +653,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("two local obliterates get different seq numbers after ack", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // C-AB
             // (C-A)-D-(B)
             helper.insertText("C", 0, "AB");
@@ -674,7 +671,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("acks remote segment obliterated by local op", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // (D-C-A)-B
             // (D-C-A)-B-E
             helper.insertText("B", 0, "AB");
@@ -692,7 +689,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("skips segments obliterated before refSeq when traversing for insertion", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CDE-(A)-B
             // C-(DE-F-(A)-B)
             helper.insertText("A", 0, "AB");
@@ -712,7 +709,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("applies correct movedSeq when right segment has multiple movedSeqs", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // AB
             // (A-C-D-(B))
             helper.insertText("B", 0, "AB");
@@ -733,7 +730,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("takes the correct moved client id when multiple clientIds for right segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // AB
             // (A-C-D-(B))
             helper.insertText("A", 0, "AB");
@@ -753,7 +750,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("selects clientId if 0", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // AB
             // (A-D-E-(C)-B)
             helper.insertText("B", 0, "AB");
@@ -773,7 +770,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("obliterates unacked segment inside non-leaf-segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // FGHIJ-E-12345678-D-C-A-K-B
             // FGHIJ-E-12345-(6-[7-L-8-D]-C)-A-K-B
             helper.insertText("A", 0, "AB");
@@ -800,7 +797,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("tracks length at seq of lower move/remove seq when overlapping", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // H-FG-A-CDE-B
             // (H-F-[G-A)-C-I-D]-E-B
             helper.insertText("C", 0, "AB");
@@ -823,7 +820,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("segment obliterated on insert overlaps with local obliterate", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // AB
             // ((A-C)-B)
             helper.insertText("B", 0, "AB");
@@ -837,7 +834,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("obliterates entire string when concurrent inserts inside range", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // GT
             // (G-O-S-Y-T)
             helper.insertText("B", 0, "GT");
@@ -851,7 +848,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("obliterate ack traverses over non-obliterated remove", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // ABCDEFGH-1
             // ABCDE-(F-[G]-2-H)-1
             // ABCDE-(F-[G]-2-H)-1-3
@@ -873,7 +870,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping remove and obliterate when remove happens last", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // FGH-E-D-BC-A
             // ([F]-G)-H-E-D-B-I-C-A
             helper.insertText("A", 0, "A");
@@ -894,7 +891,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping remove and obliterate when remove happens last _and_ partial length already exists", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // FGH-CDE-B-A
             // [F-(GH)-C]-D-Z-E-B-A
             helper.insertText("B", 0, "A");
@@ -911,7 +908,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterate and remove when obliterate is larger than remove and happened last", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // H-CDEFG-B-A
             // (H-C-[D]-E)-F-Z-G-B-A
             helper.insertText("B", 0, "A");
@@ -928,7 +925,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("wasMovedOnInsert remains after leaf node is split", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CD-B-A
             // I-(C-(G)H-E)-F-D-B-A
             helper.insertText("C", 0, "A");
@@ -946,7 +943,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterates, segment is obliterated on insert and by local client", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // DEFG-BC-A
             // v-----------v
             //    v-----v
@@ -965,7 +962,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterates and remove", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // FGHIJKL-BCDE-A
             // (FGHI-[JK-(L-B)-C]-D)-E-M-A
             helper.insertText("C", 0, "A");
@@ -982,7 +979,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("does not mark obliterated on insert for non-acked obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CDE-B-A
             // I-((C-F)-G-D)-H-E-B-A
             helper.insertText("B", 0, "A");
@@ -1000,7 +997,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("partial len isLocal when seq is -1 but moveSeq > -1", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CDEFG-AB
             // C-((D-I-E)-F)-G-A-H-B
             helper.insertText("A", 0, "AB");
@@ -1016,7 +1013,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("obliterated on insert by overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // B-DEFG-C-A
             // ((B-D-H-E)-F-I-G-C)-A
             helper.insertText("C", 0, "A");
@@ -1033,7 +1030,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // ABCDEF
             //   v-------------v
             //        v-----------v
@@ -1052,7 +1049,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping obliterates", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CDEF-AB
             // v-------------------v
             //  v---------v
@@ -1072,7 +1069,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("overlapping remove and obliterate, local obliterate does not have a remote obliterated len", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             //      v-v------v-v
             // G-(H-[F]-E)-D-[A]-B-I-C
             helper.insertText("A", 0, "ABC");
@@ -1088,7 +1085,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("triple overlapping obliterate and overlapping remove", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // I-H-BCDEFG-A
             //            v------------v
             //               v-------v
@@ -1113,7 +1110,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("triple overlapping obliterate with one being local", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // CDEFG-B-A
             //   v--------v
             //       v--------v
@@ -1135,7 +1132,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("obliterate ack traversal is not stopped by moved segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // ABCD
             // (A-(B)-E-C)-D-F
             helper.insertText("B", 0, "ABCD");
@@ -1153,7 +1150,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("updates partial lengths for segments when doing obliterate ack traversal", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // O-JKLMN-FGHI-E-CD-AB
             //               v-v---v-----v
             // (P-O-JKLMN-FG-[H]-Q-[I-E-C]-D-A)-B
@@ -1180,7 +1177,7 @@ for (const incremental of [true, false]) {
         });
         // fails only for incremental
         it("combines remote obliterated length ", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // R-XYZ12-STUVW-LMNOP-DEFGHIJK-A-34567890-Q-BC
             // v---------------v------------v------v--------v------------v
             // [R-XYZ12-STUVW-L]-abcdefghij-[MNOP-D]-klmnop-[EFGHIJK-A-34]-5-(6-x-7)-890-Q-BC
@@ -1223,7 +1220,7 @@ for (const incremental of [true, false]) {
             helper.logger.validate();
         });
         it("three obliterates on same segment", () => {
-            const helper = new reconnectHelper_1.ReconnectTestHelper();
+            const helper = new reconnectHelper_js_1.ReconnectTestHelper();
             // A
             // (C-B-D-((A)))
             helper.insertText("B", 0, "A");
@@ -1240,7 +1237,7 @@ for (const incremental of [true, false]) {
         });
         describe("incremental partial length updates", () => {
             it("obliterates concurrently inserted segment", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // (C-B-A)
                 helper.insertText("A", 0, "A");
                 helper.insertText("B", 0, "B");
@@ -1251,7 +1248,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("obliterates 2 concurrently inserted segments", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // (C-B-D-A)
                 helper.insertText("B", 0, "A");
                 helper.insertText("A", 0, "B");
@@ -1263,7 +1260,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("obliterates 4 concurrently inserted segments", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // I-F-(G-D-H-E-C-A)-B
                 helper.insertText("B", 0, "AB");
                 helper.insertText("B", 0, "C");
@@ -1277,7 +1274,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("obliterates 3 concurrently inserted segments", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // I-G-(H-D-F-E-B)-C-A
                 helper.insertText("B", 0, "A");
                 helper.insertText("B", 0, "BC");
@@ -1291,7 +1288,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("overlapping remove + obliterate, remove happened first", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // D-EFG-B-H-C-A
                 // I-D-([E]-F)-G-B-H-C-A
                 helper.insertText("A", 0, "A");
@@ -1308,7 +1305,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("overlapping remove + obliterate, remove happened last", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // DEFGH-C-B-A
                 // [D]-[E-(F)-G]-H-C-B-A
                 helper.insertText("C", 0, "A");
@@ -1325,7 +1322,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("segment inside locally obliterated segment group is split", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // CDEF-AB
                 // [C]-DE-(F-(G)-H-A)-B
                 // [C]-DE-(F-(G)-H-A)-(B)
@@ -1345,7 +1342,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("continues traversal past locally removed segment inserted before first obliterate", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // ABC
                 // (E-D-(A)-[B]-C)
                 helper.insertText("A", 0, "ABC");
@@ -1361,7 +1358,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("keeps track of remote obliterated length when hier node contains hier nodes", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // LMNO-HIJ-E-K-FG-D-C-AB
                 // lmnopq-L-[M]-NO-H-ghijk-I-(J-E-K-FG-D-C-A-a)-bc-ef-d-B
                 //                                  v--------------------------------------v
@@ -1398,7 +1395,7 @@ for (const incremental of [true, false]) {
                 helper.logger.validate();
             });
             it("combines remote obliterated length for parent node of tree with depth >=3", () => {
-                const helper = new reconnectHelper_1.ReconnectTestHelper();
+                const helper = new reconnectHelper_js_1.ReconnectTestHelper();
                 // VWXYZ0-(K)-[L]-M-[N]-O-EFGHIJ-[A]-B-P-TU-QRS-CD
                 //                                      v-v------v------------v
                 //                                            v--------------------v