@fluidframework/sequence 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.1

package/lib/test/memory/sharedString.spec.js

@@ -1,134 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { benchmarkMemory } from "@fluid-tools/benchmark";
-import { ReferenceType, reservedMarkerIdKey } from "@fluidframework/merge-tree";
-import { SharedString } from "../../sharedString.js";
-import { SharedStringFactory } from "../../sequenceFactory.js";
-function createLocalSharedString(id) {
-    return new SharedString(new MockFluidDataStoreRuntime(), id, SharedStringFactory.Attributes);
-}
-describe("SharedString memory usage", () => {
-    // IMPORTANT: variables scoped to the test suite are a big problem for memory-profiling tests
-    // because they won't be out of scope when we garbage-collect between runs of the same test,
-    // and that will skew measurements. Tests should allocate all the memory they need using local
-    // variables scoped to the test function itself, so several iterations of a given test can
-    // measure from the same baseline (as much as possible).
-    beforeEach(async () => {
-        // CAREFUL: usually beforeEach/afterEach hooks are used to initialize or interact with variables
-        // whose scope is the encompasing test suite, but that's a problem for memory-profiling tests.
-        // See the comment at the top of the test suite for more details.
-    });
-    afterEach(() => {
-        // CAREFUL: usually beforeEach/afterEach hooks are used to initialize or interact with variables
-        // whose scope is the encompasing test suite, but that's a problem for memory-profiling tests.
-        // See the comment at the top of the test suite for more details.
-    });
-    benchmarkMemory(new (class {
-        constructor() {
-            this.title = "Create empty SharedString";
-            this.minSampleCount = 500;
-            this.sharedString = createLocalSharedString("testSharedString");
-        }
-        async run() {
-            this.sharedString = createLocalSharedString("testSharedString");
-        }
-    })());
-    const numbersOfEntriesForTests = [100, 1000, 10000];
-    numbersOfEntriesForTests.forEach((x) => {
-        benchmarkMemory(new (class {
-            constructor() {
-                this.title = `Insert and remove text ${x} times`;
-                this.sharedString = createLocalSharedString("testSharedString");
-            }
-            async run() {
-                for (let i = 0; i < x; i++) {
-                    this.sharedString.insertText(0, "my-test-text");
-                    this.sharedString.removeText(0, 12);
-                }
-            }
-            beforeIteration() {
-                this.sharedString = createLocalSharedString("testestSharedString");
-            }
-        })());
-        benchmarkMemory(new (class {
-            constructor() {
-                this.title = `Replace text ${x} times`;
-                this.sharedString = createLocalSharedString("testSharedString");
-            }
-            async run() {
-                for (let i = 0; i < x; i++) {
-                    this.sharedString.replaceText(0, 4, i.toString().padStart(4, "0"));
-                }
-            }
-            beforeIteration() {
-                this.sharedString = createLocalSharedString("testestSharedString");
-                this.sharedString.insertText(0, "0000");
-            }
-        })());
-        benchmarkMemory(new (class {
-            constructor() {
-                this.title = `Get text annotation ${x} times`;
-                this.sharedString = createLocalSharedString("testSharedString");
-                this.text = "hello world";
-                this.styleProps = { style: "bold" };
-            }
-            async run() {
-                for (let i = 0; i < x; i++) {
-                    this.sharedString.getPropertiesAtPosition(i);
-                }
-            }
-            beforeIteration() {
-                this.sharedString = createLocalSharedString("testSharedString");
-                this.text = "hello world";
-                this.styleProps = { style: "bold" };
-                this.sharedString.insertText(0, this.text, this.styleProps);
-            }
-        })());
-        benchmarkMemory(new (class {
-            constructor() {
-                this.title = `Get marker ${x} times`;
-                this.markerId = "myMarkerId";
-                this.sharedString = createLocalSharedString("testSharedString");
-            }
-            async run() {
-                for (let i = 0; i < x; i++) {
-                    this.sharedString.getMarkerFromId(this.markerId);
-                }
-            }
-            beforeIteration() {
-                this.markerId = "myMarkerId";
-                this.sharedString = createLocalSharedString("testSharedString");
-                this.sharedString.insertText(0, "my-test-text");
-                this.sharedString.insertMarker(0, ReferenceType.Simple, {
-                    [reservedMarkerIdKey]: this.markerId,
-                });
-            }
-        })());
-        benchmarkMemory(new (class {
-            constructor() {
-                this.title = `Annotate marker ${x} times with same options`;
-                this.markerId = "myMarkerId";
-                this.sharedString = createLocalSharedString("testSharedString");
-                this.simpleMarker = this.sharedString.getMarkerFromId(this.markerId);
-            }
-            async run() {
-                for (let i = 0; i < x; i++) {
-                    this.sharedString.annotateMarker(this.simpleMarker, { color: "blue" });
-                }
-            }
-            beforeIteration() {
-                this.markerId = "myMarkerId";
-                this.sharedString = createLocalSharedString("testSharedString");
-                this.sharedString.insertText(0, "my-test-text");
-                this.sharedString.insertMarker(0, ReferenceType.Simple, {
-                    [reservedMarkerIdKey]: this.markerId,
-                });
-                this.simpleMarker = this.sharedString.getMarkerFromId(this.markerId);
-            }
-        })());
-    });
-});
-//# sourceMappingURL=sharedString.spec.js.map

package/lib/test/memory/sharedString.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sharedString.spec.js","sourceRoot":"","sources":["../../../src/test/memory/sharedString.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAAE,eAAe,EAAqB,MAAM,wBAAwB,CAAC;AAC5E,OAAO,EAAU,aAAa,EAAE,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AACxF,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAE/D,SAAS,uBAAuB,CAAC,EAAU;IAC1C,OAAO,IAAI,YAAY,CAAC,IAAI,yBAAyB,EAAE,EAAE,EAAE,EAAE,mBAAmB,CAAC,UAAU,CAAC,CAAC;AAC9F,CAAC;AAED,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,6FAA6F;IAC7F,4FAA4F;IAC5F,8FAA8F;IAC9F,0FAA0F;IAC1F,wDAAwD;IAExD,UAAU,CAAC,KAAK,IAAI,EAAE;QACrB,gGAAgG;QAChG,8FAA8F;QAC9F,iEAAiE;IAClE,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,GAAG,EAAE;QACd,gGAAgG;QAChG,8FAA8F;QAC9F,iEAAiE;IAClE,CAAC,CAAC,CAAC;IAEH,eAAe,CACd,IAAI,CAAC;QAAA;YACJ,UAAK,GAAG,2BAA2B,CAAC;YACpC,mBAAc,GAAG,GAAG,CAAC;YAEb,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;QAKpE,CAAC;QAHA,KAAK,CAAC,GAAG;YACR,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;QACjE,CAAC;KACD,CAAC,EAAE,CACJ,CAAC;IAEF,MAAM,wBAAwB,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAM,CAAC,CAAC;IAErD,wBAAwB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACtC,eAAe,CACd,IAAI,CAAC;YAAA;gBACJ,UAAK,GAAG,0BAA0B,CAAC,QAAQ,CAAC;gBACpC,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;YAYpE,CAAC;YAVA,KAAK,CAAC,GAAG;gBACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;oBAChD,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;iBACpC;YACF,CAAC;YAED,eAAe;gBACd,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,qBAAqB,CAAC,CAAC;YACpE,CAAC;SACD,CAAC,EAAE,CACJ,CAAC;QAEF,eAAe,CACd,IAAI,CAAC;YAAA;gBACJ,UAAK,GAAG,gBAAgB,CAAC,QAAQ,CAAC;gBAC1B,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;YAYpE,CAAC;YAVA,KAAK,CAAC,GAAG;gBACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;iBACnE;YACF,CAAC;YAED,eAAe;gBACd,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,qBAAqB,CAAC,CAAC;gBACnE,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACzC,CAAC;SACD,CAAC,EAAE,CACJ,CAAC;QAEF,eAAe,CACd,IAAI,CAAC;YAAA;gBACJ,UAAK,GAAG,uBAAuB,CAAC,QAAQ,CAAC;gBACjC,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;gBAC3D,SAAI,GAAG,aAAa,CAAC;gBACrB,eAAU,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;YAcxC,CAAC;YAZA,KAAK,CAAC,GAAG;gBACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;iBAC7C;YACF,CAAC;YAED,eAAe;gBACd,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;gBAChE,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;gBAC1B,IAAI,CAAC,UAAU,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;gBACpC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7D,CAAC;SACD,CAAC,EAAE,CACJ,CAAC;QAEF,eAAe,CACd,IAAI,CAAC;YAAA;gBACJ,UAAK,GAAG,cAAc,CAAC,QAAQ,CAAC;gBACxB,aAAQ,GAAG,YAAY,CAAC;gBACxB,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;YAgBpE,CAAC;YAdA,KAAK,CAAC,GAAG;gBACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;iBACjD;YACF,CAAC;YAED,eAAe;gBACd,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;gBAC7B,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;gBAChE,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;gBAChD,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,EAAE;oBACvD,CAAC,mBAAmB,CAAC,EAAE,IAAI,CAAC,QAAQ;iBACpC,CAAC,CAAC;YACJ,CAAC;SACD,CAAC,EAAE,CACJ,CAAC;QAEF,eAAe,CACd,IAAI,CAAC;YAAA;gBACJ,UAAK,GAAG,mBAAmB,CAAC,0BAA0B,CAAC;gBAC/C,aAAQ,GAAG,YAAY,CAAC;gBACxB,iBAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;gBAC3D,iBAAY,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAW,CAAC;YAiBnF,CAAC;YAfA,KAAK,CAAC,GAAG;gBACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC3B,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;iBACvE;YACF,CAAC;YAED,eAAe;gBACd,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC;gBAC7B,IAAI,CAAC,YAAY,GAAG,uBAAuB,CAAC,kBAAkB,CAAC,CAAC;gBAChE,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC;gBAChD,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC,EAAE,aAAa,CAAC,MAAM,EAAE;oBACvD,CAAC,mBAAmB,CAAC,EAAE,IAAI,CAAC,QAAQ;iBACpC,CAAC,CAAC;gBACH,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAW,CAAC;YAChF,CAAC;SACD,CAAC,EAAE,CACJ,CAAC;IACH,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 { MockFluidDataStoreRuntime } from \"@fluidframework/test-runtime-utils\";\nimport { benchmarkMemory, IMemoryTestObject } from \"@fluid-tools/benchmark\";\nimport { Marker, ReferenceType, reservedMarkerIdKey } from \"@fluidframework/merge-tree\";\nimport { SharedString } from \"../../sharedString.js\";\nimport { SharedStringFactory } from \"../../sequenceFactory.js\";\n\nfunction createLocalSharedString(id: string) {\n\treturn new SharedString(new MockFluidDataStoreRuntime(), id, SharedStringFactory.Attributes);\n}\n\ndescribe(\"SharedString memory usage\", () => {\n\t// IMPORTANT: variables scoped to the test suite are a big problem for memory-profiling tests\n\t// because they won't be out of scope when we garbage-collect between runs of the same test,\n\t// and that will skew measurements. Tests should allocate all the memory they need using local\n\t// variables scoped to the test function itself, so several iterations of a given test can\n\t// measure from the same baseline (as much as possible).\n\n\tbeforeEach(async () => {\n\t\t// CAREFUL: usually beforeEach/afterEach hooks are used to initialize or interact with variables\n\t\t// whose scope is the encompasing test suite, but that's a problem for memory-profiling tests.\n\t\t// See the comment at the top of the test suite for more details.\n\t});\n\n\tafterEach(() => {\n\t\t// CAREFUL: usually beforeEach/afterEach hooks are used to initialize or interact with variables\n\t\t// whose scope is the encompasing test suite, but that's a problem for memory-profiling tests.\n\t\t// See the comment at the top of the test suite for more details.\n\t});\n\n\tbenchmarkMemory(\n\t\tnew (class implements IMemoryTestObject {\n\t\t\ttitle = \"Create empty SharedString\";\n\t\t\tminSampleCount = 500;\n\n\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\n\t\t\tasync run() {\n\t\t\t\tthis.sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t}\n\t\t})(),\n\t);\n\n\tconst numbersOfEntriesForTests = [100, 1000, 10_000];\n\n\tnumbersOfEntriesForTests.forEach((x) => {\n\t\tbenchmarkMemory(\n\t\t\tnew (class implements IMemoryTestObject {\n\t\t\t\ttitle = `Insert and remove text ${x} times`;\n\t\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\n\t\t\t\tasync run() {\n\t\t\t\t\tfor (let i = 0; i < x; i++) {\n\t\t\t\t\t\tthis.sharedString.insertText(0, \"my-test-text\");\n\t\t\t\t\t\tthis.sharedString.removeText(0, 12);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbeforeIteration() {\n\t\t\t\t\tthis.sharedString = createLocalSharedString(\"testestSharedString\");\n\t\t\t\t}\n\t\t\t})(),\n\t\t);\n\n\t\tbenchmarkMemory(\n\t\t\tnew (class implements IMemoryTestObject {\n\t\t\t\ttitle = `Replace text ${x} times`;\n\t\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\n\t\t\t\tasync run() {\n\t\t\t\t\tfor (let i = 0; i < x; i++) {\n\t\t\t\t\t\tthis.sharedString.replaceText(0, 4, i.toString().padStart(4, \"0\"));\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbeforeIteration() {\n\t\t\t\t\tthis.sharedString = createLocalSharedString(\"testestSharedString\");\n\t\t\t\t\tthis.sharedString.insertText(0, \"0000\");\n\t\t\t\t}\n\t\t\t})(),\n\t\t);\n\n\t\tbenchmarkMemory(\n\t\t\tnew (class implements IMemoryTestObject {\n\t\t\t\ttitle = `Get text annotation ${x} times`;\n\t\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t\tprivate text = \"hello world\";\n\t\t\t\tprivate styleProps = { style: \"bold\" };\n\n\t\t\t\tasync run() {\n\t\t\t\t\tfor (let i = 0; i < x; i++) {\n\t\t\t\t\t\tthis.sharedString.getPropertiesAtPosition(i);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbeforeIteration() {\n\t\t\t\t\tthis.sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t\t\tthis.text = \"hello world\";\n\t\t\t\t\tthis.styleProps = { style: \"bold\" };\n\t\t\t\t\tthis.sharedString.insertText(0, this.text, this.styleProps);\n\t\t\t\t}\n\t\t\t})(),\n\t\t);\n\n\t\tbenchmarkMemory(\n\t\t\tnew (class implements IMemoryTestObject {\n\t\t\t\ttitle = `Get marker ${x} times`;\n\t\t\t\tprivate markerId = \"myMarkerId\";\n\t\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\n\t\t\t\tasync run() {\n\t\t\t\t\tfor (let i = 0; i < x; i++) {\n\t\t\t\t\t\tthis.sharedString.getMarkerFromId(this.markerId);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbeforeIteration() {\n\t\t\t\t\tthis.markerId = \"myMarkerId\";\n\t\t\t\t\tthis.sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t\t\tthis.sharedString.insertText(0, \"my-test-text\");\n\t\t\t\t\tthis.sharedString.insertMarker(0, ReferenceType.Simple, {\n\t\t\t\t\t\t[reservedMarkerIdKey]: this.markerId,\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t})(),\n\t\t);\n\n\t\tbenchmarkMemory(\n\t\t\tnew (class implements IMemoryTestObject {\n\t\t\t\ttitle = `Annotate marker ${x} times with same options`;\n\t\t\t\tprivate markerId = \"myMarkerId\";\n\t\t\t\tprivate sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t\tprivate simpleMarker = this.sharedString.getMarkerFromId(this.markerId) as Marker;\n\n\t\t\t\tasync run() {\n\t\t\t\t\tfor (let i = 0; i < x; i++) {\n\t\t\t\t\t\tthis.sharedString.annotateMarker(this.simpleMarker, { color: \"blue\" });\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tbeforeIteration() {\n\t\t\t\t\tthis.markerId = \"myMarkerId\";\n\t\t\t\t\tthis.sharedString = createLocalSharedString(\"testSharedString\");\n\t\t\t\t\tthis.sharedString.insertText(0, \"my-test-text\");\n\t\t\t\t\tthis.sharedString.insertMarker(0, ReferenceType.Simple, {\n\t\t\t\t\t\t[reservedMarkerIdKey]: this.markerId,\n\t\t\t\t\t});\n\t\t\t\t\tthis.simpleMarker = this.sharedString.getMarkerFromId(this.markerId) as Marker;\n\t\t\t\t}\n\t\t\t})(),\n\t\t);\n\t});\n});\n"]}

package/lib/test/overlappingSequenceIntervalsIndex.spec.js

@@ -1,348 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable jsdoc/check-indentation */
-import { strict as assert } from "assert";
-import { MockFluidDataStoreRuntime } from "@fluidframework/test-runtime-utils";
-import { compareReferencePositions } from "@fluidframework/merge-tree";
-import { makeRandom } from "@fluid-private/stochastic-test-utils";
-import { SequenceInterval } from "../intervals/index.js";
-import { SharedString } from "../sharedString.js";
-import { SharedStringFactory } from "../sequenceFactory.js";
-import { createOverlappingIntervalsIndex, createOverlappingSequenceIntervalsIndex, } from "../intervalIndex/index.js";
-function assertSequenceIntervalsEqual(string, results, expected) {
-    assert.equal(results.length, expected.length, "Mismatched result count");
-    for (let i = 0; i < results.length; ++i) {
-        assert(results[i]);
-        const resultStart = string.localReferencePositionToPosition(results[i].start);
-        const resultEnd = string.localReferencePositionToPosition(results[i].end);
-        let expectedStart;
-        let expectedEnd;
-        if (expected[i] instanceof SequenceInterval) {
-            expectedStart = string.localReferencePositionToPosition(expected[i].start);
-            expectedEnd = string.localReferencePositionToPosition(expected[i].end);
-        }
-        else {
-            expectedStart = expected[i].start;
-            expectedEnd = expected[i].end;
-        }
-        assert.equal(resultStart, expectedStart, "mismatched start");
-        assert.equal(resultEnd, expectedEnd, "mismatched end");
-    }
-}
-describe("findOverlappingIntervalsBySegoff", () => {
-    // sort the query results by the local reference position of interval endpoints
-    const compareFn = (a, b) => {
-        if (compareReferencePositions(a.start, b.start) !== 0) {
-            return compareReferencePositions(a.start, b.start);
-        }
-        return compareReferencePositions(a.end, b.end);
-    };
-    let testSharedString;
-    let dataStoreRuntime;
-    let overlappingSequenceIntervalsIndex;
-    let collection;
-    let results;
-    const queryIntervalsByPositions = (start, end) => {
-        const startSegOff = testSharedString.getContainingSegment(start);
-        const endSegOff = testSharedString.getContainingSegment(end);
-        const intervals = overlappingSequenceIntervalsIndex.findOverlappingIntervalsBySegoff(startSegOff, endSegOff);
-        intervals.sort(compareFn);
-        // eslint-disable-next-line @typescript-eslint/no-unsafe-return
-        return intervals;
-    };
-    beforeEach(() => {
-        dataStoreRuntime = new MockFluidDataStoreRuntime({ clientId: "1" });
-        dataStoreRuntime.options = { intervalStickinessEnabled: true };
-        testSharedString = new SharedString(dataStoreRuntime, "test-shared-string", SharedStringFactory.Attributes);
-        overlappingSequenceIntervalsIndex =
-            createOverlappingSequenceIntervalsIndex(testSharedString);
-        testSharedString.initializeLocal();
-        collection = testSharedString.getIntervalCollection("test");
-        collection.attachIndex(overlappingSequenceIntervalsIndex);
-    });
-    describe("find no intervals", () => {
-        beforeEach(() => {
-            testSharedString.insertText(0, "ab");
-            testSharedString.insertText(2, "cde");
-            testSharedString.insertText(5, "fg");
-        });
-        it("when the index is empty", () => {
-            results = queryIntervalsByPositions(0, 2);
-            assert.equal(results.length, 0);
-        });
-        it("when all intervals in index are above the query range", () => {
-            collection.add({ start: 5, end: 6 });
-            results = queryIntervalsByPositions(0, 2);
-            assert.equal(results.length, 0);
-        });
-        it("when all intervals in index are below the query range", () => {
-            collection.add({ start: 1, end: 1 });
-            results = queryIntervalsByPositions(2, 5);
-            assert.equal(results.length, 0);
-        });
-        it("when startSegment occurs `after` the endSegment", () => {
-            collection.add({ start: 1, end: 1 });
-            results = queryIntervalsByPositions(2, 0);
-            assert.equal(results.length, 0);
-        });
-        it("when the segments are the same but startOffset occurs `after` the endOffset", () => {
-            collection.add({ start: 1, end: 1 });
-            results = queryIntervalsByPositions(1, 0);
-            assert.equal(results.length, 0);
-        });
-        it("when the endSegment does not exist (out of bound)", () => {
-            collection.add({ start: 1, end: 1 });
-            results = queryIntervalsByPositions(1, 1000);
-            assert.equal(results.length, 0);
-        });
-    });
-    describe("find correct results", () => {
-        let interval1;
-        let interval2;
-        let interval3;
-        beforeEach(() => {
-            testSharedString.insertText(0, "ab");
-            testSharedString.insertText(2, "cde");
-            testSharedString.insertText(5, "fg");
-            interval1 = collection.add({ start: 1, end: 1 }).getIntervalId();
-            interval2 = collection.add({ start: 2, end: 3 }).getIntervalId();
-            interval3 = collection.add({ start: 5, end: 6 }).getIntervalId();
-        });
-        it("when each interval is within a single segment", () => {
-            results = queryIntervalsByPositions(0, 1);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 1, end: 1 }]);
-            results = queryIntervalsByPositions(1, 1);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 1, end: 1 }]);
-            results = queryIntervalsByPositions(1, 3);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 2, end: 3 },
-            ]);
-            results = queryIntervalsByPositions(2, 4);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 2, end: 3 }]);
-            results = queryIntervalsByPositions(5, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 5, end: 6 }]);
-            results = queryIntervalsByPositions(1, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 2, end: 3 },
-                { start: 5, end: 6 },
-            ]);
-        });
-        it("when existing interval across multiple segments", () => {
-            // Add intervals which are across more than one segments
-            collection.add({ start: 1, end: 3 });
-            collection.add({ start: 2, end: 5 });
-            collection.add({ start: 1, end: 6 });
-            results = queryIntervalsByPositions(0, 1);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 3 },
-                { start: 1, end: 6 },
-            ]);
-            results = queryIntervalsByPositions(1, 3);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 3 },
-                { start: 1, end: 6 },
-                { start: 2, end: 3 },
-                { start: 2, end: 5 },
-            ]);
-            results = queryIntervalsByPositions(5, 5);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 6 },
-                { start: 2, end: 5 },
-                { start: 5, end: 6 },
-            ]);
-        });
-        it("when adding duplicate intervals to the index", () => {
-            collection.add({ start: 1, end: 1 });
-            collection.add({ start: 2, end: 3 });
-            collection.add({ start: 1, end: 1 });
-            results = queryIntervalsByPositions(1, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 1 },
-                { start: 1, end: 1 },
-                { start: 2, end: 3 },
-                { start: 2, end: 3 },
-                { start: 5, end: 6 },
-            ]);
-        });
-        it("when removing intervals from the index", () => {
-            collection.removeIntervalById(interval2);
-            results = queryIntervalsByPositions(1, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 5, end: 6 },
-            ]);
-            // Add and remove duplicate intervals
-            const interval4 = collection.add({ start: 1, end: 1 }).getIntervalId();
-            collection.removeIntervalById(interval1);
-            results = queryIntervalsByPositions(1, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 5, end: 6 },
-            ]);
-            collection.removeIntervalById(interval4);
-            results = queryIntervalsByPositions(1, 6);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 5, end: 6 }]);
-        });
-        it("when inserting or appending additional segments to the string", () => {
-            // Append a segment to the end of the string
-            testSharedString.insertText(7, "hijk");
-            collection.add({ start: 7, end: 9 }); // `interval4` in below graphs
-            /**
-             * Visualization of intervals within the string after the last insertion:
-             *
-             *                  0 1 2 3 4 5 6 7 8 9 10
-             *                  a b c d e f g h i j k
-             *  interval1         ^
-             *  interval2           [-]
-             *  interval3                 [-]
-             *  interval4                     [---]
-             */
-            results = queryIntervalsByPositions(5, 7);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 5, end: 6 },
-                { start: 7, end: 9 },
-            ]);
-            // Insert a segment in the middle of the string
-            testSharedString.insertText(3, "xx");
-            /**
-             * Visualization of intervals within the string after the last insertion:
-             *
-             * interval2's endpoint slides forwards
-             * interval3 and interval4 shift forwards
-             *
-             *                  0 1 2 3 4 5 6 7 8 9 10 11 12
-             *                  a b c x x d e f g h i  j  k
-             *  interval1         ^
-             *  interval2           [-----]
-             *  interval3                     [-]
-             *  interval4                         [----]
-             */
-            results = queryIntervalsByPositions(2, 4);
-            assertSequenceIntervalsEqual(testSharedString, results, [{ start: 2, end: 5 }]);
-            results = queryIntervalsByPositions(5, 7);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 2, end: 5 },
-                { start: 7, end: 8 },
-            ]);
-            results = queryIntervalsByPositions(6, 9);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 7, end: 8 },
-                { start: 9, end: 11 },
-            ]);
-            // Insert a segment at the head of the string
-            testSharedString.insertText(0, "yy");
-            /**
-             * Visualization of intervals within the string after the last insertion:
-             * All intervals shift forwards
-             *
-             *                  0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
-             *                  y y a b c x x d e f g  h  i  j  k
-             *  interval1             ^
-             *  interval2               [-----]
-             *  interval3                         [-]
-             *  interval4                              [-----]
-             */
-            results = queryIntervalsByPositions(0, 14);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 3, end: 3 },
-                { start: 4, end: 7 },
-                { start: 9, end: 10 },
-                { start: 11, end: 13 },
-            ]);
-        });
-        it("when removing segments from the string", () => {
-            // Remove the middle part of the string
-            testSharedString.removeText(2, 4);
-            /**
-             * Visualization of intervals within the string after the last deletion:
-             *
-             * interval2's startpoint slides forwards but the remains in the original segment
-             * interval3 shifts forwards
-             *
-             *                  0 1 2 3 4
-             *                  a b e f g
-             *  interval1         ^
-             *  interval2           ^
-             *  interval3             [-]
-             */
-            results = queryIntervalsByPositions(0, 4);
-            assertSequenceIntervalsEqual(testSharedString, results, [
-                { start: 1, end: 1 },
-                { start: 2, end: 2 },
-                { start: 3, end: 4 },
-            ]);
-            // Remove the end part of the string
-            testSharedString.removeText(2, 5);
-            /**
-             * Visualization of intervals within the string after the last deletion:
-             *
-             * There does not exist a next valid segment for interval2 and interval3
-             *
-             *                  0 1
-             *                  a b
-             *  interval1         ^
-             *  interval2
-             *  interval3
-             */
-            results = queryIntervalsByPositions(0, 1);
-            assertSequenceIntervalsEqual(testSharedString, results, 
-            // TODO: At this point, this test should expect interval2 and interval3 to slide to an EndOfString segment
-            // rather than back, and so should expect results:
-            // [{ start: 1, end: 1 }]
-            // However, currently intervals attempt to slide back when sliding forward fails.
-            [
-                { start: 1, end: 1 },
-                { start: 1, end: 1 },
-                { start: 1, end: 1 },
-            ]);
-        });
-    });
-    describe("find consistent results with `naive` method", () => {
-        /**
-         * Fills in random sequence intervals to the index and interval collection
-         * @param options - The options object containing random, count, and min properties.
-         */
-        const fillInRandomSequenceIntervals = ({ random, count, min, }) => {
-            // Generate random text, and insert them into random positions of the string
-            for (let i = 0; i < count / 2; ++i) {
-                testSharedString.insertText(random.integer(0, Math.max(testSharedString.getLength() - 1, 0)), random.string(random.bool() ? 2 : 1));
-            }
-            const max = testSharedString.getLength() - 1;
-            // Genereate random sequence intervals
-            for (let i = 0; i < count; ++i) {
-                const start = random.integer(min, max);
-                const end = random.integer(start, max);
-                collection.add({ start, end });
-            }
-        };
-        it("when given massive random inputs", () => {
-            const random = makeRandom(0);
-            const count = 100;
-            const min = 0;
-            // Attach the default overlapping interval index for comparison purposes
-            const overlappingIntervalsIndex = createOverlappingIntervalsIndex(testSharedString);
-            collection.attachIndex(overlappingIntervalsIndex);
-            fillInRandomSequenceIntervals({ random, count, min });
-            // Test with running 100 random queries
-            const max = testSharedString.getLength() - 1;
-            for (let i = 0; i < 100; ++i) {
-                const start = random.integer(min, max);
-                const end = random.integer(start, max);
-                // Query intervals using two distinct methods
-                results = queryIntervalsByPositions(start, end);
-                const expected = overlappingIntervalsIndex.findOverlappingIntervals(start, end);
-                results.sort(compareFn);
-                expected.sort(compareFn);
-                assertSequenceIntervalsEqual(testSharedString, results, expected);
-            }
-        });
-    });
-});
-//# sourceMappingURL=overlappingSequenceIntervalsIndex.spec.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"overlappingSequenceIntervalsIndex.spec.js","sourceRoot":"","sources":["../../src/test/overlappingSequenceIntervalsIndex.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,4CAA4C;AAE5C,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,yBAAyB,EAAE,MAAM,oCAAoC,CAAC;AAC/E,OAAO,EAA0B,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AAC/F,OAAO,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAClE,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EACN,+BAA+B,EAC/B,uCAAuC,GACvC,MAAM,2BAA2B,CAAC;AAGnC,SAAS,4BAA4B,CACpC,MAAoB,EACpB,OAA2B,EAC3B,QAA+D;IAE/D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,yBAAyB,CAAC,CAAC;IAEzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,WAAW,GAAG,MAAM,CAAC,gCAAgC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC9E,MAAM,SAAS,GAAG,MAAM,CAAC,gCAAgC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1E,IAAI,aAAa,CAAC;QAClB,IAAI,WAAW,CAAC;QAEhB,IAAI,QAAQ,CAAC,CAAC,CAAC,YAAY,gBAAgB,EAAE;YAC5C,aAAa,GAAG,MAAM,CAAC,gCAAgC,CACtD,QAAQ,CAAC,CAAC,CAAC,CAAC,KAA+B,CAC3C,CAAC;YACF,WAAW,GAAG,MAAM,CAAC,gCAAgC,CACpD,QAAQ,CAAC,CAAC,CAAC,CAAC,GAA6B,CACzC,CAAC;SACF;aAAM;YACN,aAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAClC,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;SAC9B;QAED,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,aAAa,EAAE,kBAAkB,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,WAAW,EAAE,gBAAgB,CAAC,CAAC;KACvD;AACF,CAAC;AAED,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IACjD,+EAA+E;IAC/E,MAAM,SAAS,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAE,EAAE;QAC9D,IAAI,yBAAyB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE;YACtD,OAAO,yBAAyB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;SACnD;QACD,OAAO,yBAAyB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC,CAAC;IACF,IAAI,gBAA8B,CAAC;IACnC,IAAI,gBAA2C,CAAC;IAChD,IAAI,iCAAiC,CAAC;IACtC,IAAI,UAAU,CAAC;IACf,IAAI,OAAO,CAAC;IAEZ,MAAM,yBAAyB,GAAG,CAAC,KAAa,EAAE,GAAW,EAA8B,EAAE;QAC5F,MAAM,WAAW,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACjE,MAAM,SAAS,GAAG,gBAAgB,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAE7D,MAAM,SAAS,GAAG,iCAAiC,CAAC,gCAAgC,CACnF,WAAW,EACX,SAAS,CACT,CAAC;QACF,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1B,+DAA+D;QAC/D,OAAO,SAAS,CAAC;IAClB,CAAC,CAAC;IAEF,UAAU,CAAC,GAAG,EAAE;QACf,gBAAgB,GAAG,IAAI,yBAAyB,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,CAAC;QACpE,gBAAgB,CAAC,OAAO,GAAG,EAAE,yBAAyB,EAAE,IAAI,EAAE,CAAC;QAC/D,gBAAgB,GAAG,IAAI,YAAY,CAClC,gBAAgB,EAChB,oBAAoB,EACpB,mBAAmB,CAAC,UAAU,CAC9B,CAAC;QACF,iCAAiC;YAChC,uCAAuC,CAAC,gBAAgB,CAAC,CAAC;QAE3D,gBAAgB,CAAC,eAAe,EAAE,CAAC;QACnC,UAAU,GAAG,gBAAgB,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAC5D,UAAU,CAAC,WAAW,CAAC,iCAAiC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,UAAU,CAAC,GAAG,EAAE;YACf,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACrC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAChE,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAChE,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6EAA6E,EAAE,GAAG,EAAE;YACtF,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC7C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QACrC,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QAEd,UAAU,CAAC,GAAG,EAAE;YACf,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACrC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACrC,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YACjE,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YACjE,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACxD,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEhF,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEhF,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEhF,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAEhF,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,wDAAwD;YACxD,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAErC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACvD,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAErC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,UAAU,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;YACzC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,qCAAqC;YACrC,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;YACvE,UAAU,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;YACzC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,UAAU,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;YACzC,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACxE,4CAA4C;YAC5C,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACvC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,8BAA8B;YAEpE;;;;;;;;;eASG;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,+CAA+C;YAC/C,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAErC;;;;;;;;;;;;eAYG;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChF,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YACH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;aACrB,CAAC,CAAC;YAEH,6CAA6C;YAC7C,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAErC;;;;;;;;;;eAUG;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE;gBACrB,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE;aACtB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YACjD,uCAAuC;YACvC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElC;;;;;;;;;;;eAWG;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE;gBACvD,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,oCAAoC;YACpC,gBAAgB,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAElC;;;;;;;;;;eAUG;YAEH,OAAO,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,4BAA4B,CAC3B,gBAAgB,EAChB,OAAO;YACP,0GAA0G;YAC1G,kDAAkD;YAClD,yBAAyB;YACzB,iFAAiF;YACjF;gBACC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CACD,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6CAA6C,EAAE,GAAG,EAAE;QAC5D;;;WAGG;QACH,MAAM,6BAA6B,GAAG,CAAC,EACtC,MAAM,EACN,KAAK,EACL,GAAG,GACsD,EAAQ,EAAE;YACnE,4EAA4E;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;gBACnC,gBAAgB,CAAC,UAAU,CAC1B,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAChE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACpC,CAAC;aACF;YACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC7C,sCAAsC;YACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,EAAE,CAAC,EAAE;gBAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACvC,UAAU,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;aAC/B;QACF,CAAC,CAAC;QAEF,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC;YAClB,MAAM,GAAG,GAAG,CAAC,CAAC;YAEd,wEAAwE;YACxE,MAAM,yBAAyB,GAAG,+BAA+B,CAAC,gBAAgB,CAAC,CAAC;YACpF,UAAU,CAAC,WAAW,CAAC,yBAAyB,CAAC,CAAC;YAElD,6BAA6B,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACtD,uCAAuC;YACvC,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE;gBAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACvC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAEvC,6CAA6C;gBAC7C,OAAO,GAAG,yBAAyB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAChD,MAAM,QAAQ,GAAG,yBAAyB,CAAC,wBAAwB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAEhF,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAEzB,4BAA4B,CAAC,gBAAgB,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;aAClE;QACF,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\n/* eslint-disable jsdoc/check-indentation */\n\nimport { strict as assert } from \"assert\";\nimport { MockFluidDataStoreRuntime } from \"@fluidframework/test-runtime-utils\";\nimport { LocalReferencePosition, compareReferencePositions } from \"@fluidframework/merge-tree\";\nimport { makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { SequenceInterval } from \"../intervals/index.js\";\nimport { SharedString } from \"../sharedString.js\";\nimport { SharedStringFactory } from \"../sequenceFactory.js\";\nimport {\n\tcreateOverlappingIntervalsIndex,\n\tcreateOverlappingSequenceIntervalsIndex,\n} from \"../intervalIndex/index.js\";\nimport { RandomIntervalOptions } from \"./intervalIndexTestUtils.js\";\n\nfunction assertSequenceIntervalsEqual(\n\tstring: SharedString,\n\tresults: SequenceInterval[],\n\texpected: { start: number; end: number }[] | SequenceInterval[],\n): void {\n\tassert.equal(results.length, expected.length, \"Mismatched result count\");\n\n\tfor (let i = 0; i < results.length; ++i) {\n\t\tassert(results[i]);\n\t\tconst resultStart = string.localReferencePositionToPosition(results[i].start);\n\t\tconst resultEnd = string.localReferencePositionToPosition(results[i].end);\n\t\tlet expectedStart;\n\t\tlet expectedEnd;\n\n\t\tif (expected[i] instanceof SequenceInterval) {\n\t\t\texpectedStart = string.localReferencePositionToPosition(\n\t\t\t\texpected[i].start as LocalReferencePosition,\n\t\t\t);\n\t\t\texpectedEnd = string.localReferencePositionToPosition(\n\t\t\t\texpected[i].end as LocalReferencePosition,\n\t\t\t);\n\t\t} else {\n\t\t\texpectedStart = expected[i].start;\n\t\t\texpectedEnd = expected[i].end;\n\t\t}\n\n\t\tassert.equal(resultStart, expectedStart, \"mismatched start\");\n\t\tassert.equal(resultEnd, expectedEnd, \"mismatched end\");\n\t}\n}\n\ndescribe(\"findOverlappingIntervalsBySegoff\", () => {\n\t// sort the query results by the local reference position of interval endpoints\n\tconst compareFn = (a: SequenceInterval, b: SequenceInterval) => {\n\t\tif (compareReferencePositions(a.start, b.start) !== 0) {\n\t\t\treturn compareReferencePositions(a.start, b.start);\n\t\t}\n\t\treturn compareReferencePositions(a.end, b.end);\n\t};\n\tlet testSharedString: SharedString;\n\tlet dataStoreRuntime: MockFluidDataStoreRuntime;\n\tlet overlappingSequenceIntervalsIndex;\n\tlet collection;\n\tlet results;\n\n\tconst queryIntervalsByPositions = (start: number, end: number): Iterable<SequenceInterval> => {\n\t\tconst startSegOff = testSharedString.getContainingSegment(start);\n\t\tconst endSegOff = testSharedString.getContainingSegment(end);\n\n\t\tconst intervals = overlappingSequenceIntervalsIndex.findOverlappingIntervalsBySegoff(\n\t\t\tstartSegOff,\n\t\t\tendSegOff,\n\t\t);\n\t\tintervals.sort(compareFn);\n\t\t// eslint-disable-next-line @typescript-eslint/no-unsafe-return\n\t\treturn intervals;\n\t};\n\n\tbeforeEach(() => {\n\t\tdataStoreRuntime = new MockFluidDataStoreRuntime({ clientId: \"1\" });\n\t\tdataStoreRuntime.options = { intervalStickinessEnabled: true };\n\t\ttestSharedString = new SharedString(\n\t\t\tdataStoreRuntime,\n\t\t\t\"test-shared-string\",\n\t\t\tSharedStringFactory.Attributes,\n\t\t);\n\t\toverlappingSequenceIntervalsIndex =\n\t\t\tcreateOverlappingSequenceIntervalsIndex(testSharedString);\n\n\t\ttestSharedString.initializeLocal();\n\t\tcollection = testSharedString.getIntervalCollection(\"test\");\n\t\tcollection.attachIndex(overlappingSequenceIntervalsIndex);\n\t});\n\n\tdescribe(\"find no intervals\", () => {\n\t\tbeforeEach(() => {\n\t\t\ttestSharedString.insertText(0, \"ab\");\n\t\t\ttestSharedString.insertText(2, \"cde\");\n\t\t\ttestSharedString.insertText(5, \"fg\");\n\t\t});\n\n\t\tit(\"when the index is empty\", () => {\n\t\t\tresults = queryIntervalsByPositions(0, 2);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tit(\"when all intervals in index are above the query range\", () => {\n\t\t\tcollection.add({ start: 5, end: 6 });\n\t\t\tresults = queryIntervalsByPositions(0, 2);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tit(\"when all intervals in index are below the query range\", () => {\n\t\t\tcollection.add({ start: 1, end: 1 });\n\t\t\tresults = queryIntervalsByPositions(2, 5);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tit(\"when startSegment occurs `after` the endSegment\", () => {\n\t\t\tcollection.add({ start: 1, end: 1 });\n\t\t\tresults = queryIntervalsByPositions(2, 0);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tit(\"when the segments are the same but startOffset occurs `after` the endOffset\", () => {\n\t\t\tcollection.add({ start: 1, end: 1 });\n\t\t\tresults = queryIntervalsByPositions(1, 0);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tit(\"when the endSegment does not exist (out of bound)\", () => {\n\t\t\tcollection.add({ start: 1, end: 1 });\n\t\t\tresults = queryIntervalsByPositions(1, 1000);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\t});\n\n\tdescribe(\"find correct results\", () => {\n\t\tlet interval1;\n\t\tlet interval2;\n\t\tlet interval3;\n\n\t\tbeforeEach(() => {\n\t\t\ttestSharedString.insertText(0, \"ab\");\n\t\t\ttestSharedString.insertText(2, \"cde\");\n\t\t\ttestSharedString.insertText(5, \"fg\");\n\t\t\tinterval1 = collection.add({ start: 1, end: 1 }).getIntervalId();\n\t\t\tinterval2 = collection.add({ start: 2, end: 3 }).getIntervalId();\n\t\t\tinterval3 = collection.add({ start: 5, end: 6 }).getIntervalId();\n\t\t});\n\n\t\tit(\"when each interval is within a single segment\", () => {\n\t\t\tresults = queryIntervalsByPositions(0, 1);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 1, end: 1 }]);\n\n\t\t\tresults = queryIntervalsByPositions(1, 1);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 1, end: 1 }]);\n\n\t\t\tresults = queryIntervalsByPositions(1, 3);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 2, end: 3 },\n\t\t\t]);\n\n\t\t\tresults = queryIntervalsByPositions(2, 4);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 2, end: 3 }]);\n\n\t\t\tresults = queryIntervalsByPositions(5, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 5, end: 6 }]);\n\n\t\t\tresults = queryIntervalsByPositions(1, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 2, end: 3 },\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when existing interval across multiple segments\", () => {\n\t\t\t// Add intervals which are across more than one segments\n\t\t\tcollection.add({ start: 1, end: 3 });\n\t\t\tcollection.add({ start: 2, end: 5 });\n\t\t\tcollection.add({ start: 1, end: 6 });\n\n\t\t\tresults = queryIntervalsByPositions(0, 1);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t\t{ start: 1, end: 6 },\n\t\t\t]);\n\n\t\t\tresults = queryIntervalsByPositions(1, 3);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t\t{ start: 1, end: 6 },\n\t\t\t\t{ start: 2, end: 3 },\n\t\t\t\t{ start: 2, end: 5 },\n\t\t\t]);\n\n\t\t\tresults = queryIntervalsByPositions(5, 5);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 6 },\n\t\t\t\t{ start: 2, end: 5 },\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when adding duplicate intervals to the index\", () => {\n\t\t\tcollection.add({ start: 1, end: 1 });\n\t\t\tcollection.add({ start: 2, end: 3 });\n\t\t\tcollection.add({ start: 1, end: 1 });\n\n\t\t\tresults = queryIntervalsByPositions(1, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 2, end: 3 },\n\t\t\t\t{ start: 2, end: 3 },\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when removing intervals from the index\", () => {\n\t\t\tcollection.removeIntervalById(interval2);\n\t\t\tresults = queryIntervalsByPositions(1, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t]);\n\n\t\t\t// Add and remove duplicate intervals\n\t\t\tconst interval4 = collection.add({ start: 1, end: 1 }).getIntervalId();\n\t\t\tcollection.removeIntervalById(interval1);\n\t\t\tresults = queryIntervalsByPositions(1, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t]);\n\n\t\t\tcollection.removeIntervalById(interval4);\n\t\t\tresults = queryIntervalsByPositions(1, 6);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 5, end: 6 }]);\n\t\t});\n\n\t\tit(\"when inserting or appending additional segments to the string\", () => {\n\t\t\t// Append a segment to the end of the string\n\t\t\ttestSharedString.insertText(7, \"hijk\");\n\t\t\tcollection.add({ start: 7, end: 9 }); // `interval4` in below graphs\n\n\t\t\t/**\n\t\t\t * Visualization of intervals within the string after the last insertion:\n\t\t\t *\n\t\t\t *                  0 1 2 3 4 5 6 7 8 9 10\n\t\t\t *                  a b c d e f g h i j k\n\t\t\t *  interval1         ^\n\t\t\t *  interval2           [-]\n\t\t\t *  interval3                 [-]\n\t\t\t *  interval4                     [---]\n\t\t\t */\n\n\t\t\tresults = queryIntervalsByPositions(5, 7);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 5, end: 6 },\n\t\t\t\t{ start: 7, end: 9 },\n\t\t\t]);\n\n\t\t\t// Insert a segment in the middle of the string\n\t\t\ttestSharedString.insertText(3, \"xx\");\n\n\t\t\t/**\n\t\t\t * Visualization of intervals within the string after the last insertion:\n\t\t\t *\n\t\t\t * interval2's endpoint slides forwards\n\t\t\t * interval3 and interval4 shift forwards\n\t\t\t *\n\t\t\t *                  0 1 2 3 4 5 6 7 8 9 10 11 12\n\t\t\t *                  a b c x x d e f g h i  j  k\n\t\t\t *  interval1         ^\n\t\t\t *  interval2           [-----]\n\t\t\t *  interval3                     [-]\n\t\t\t *  interval4                         [----]\n\t\t\t */\n\n\t\t\tresults = queryIntervalsByPositions(2, 4);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [{ start: 2, end: 5 }]);\n\t\t\tresults = queryIntervalsByPositions(5, 7);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 2, end: 5 },\n\t\t\t\t{ start: 7, end: 8 },\n\t\t\t]);\n\t\t\tresults = queryIntervalsByPositions(6, 9);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 7, end: 8 },\n\t\t\t\t{ start: 9, end: 11 },\n\t\t\t]);\n\n\t\t\t// Insert a segment at the head of the string\n\t\t\ttestSharedString.insertText(0, \"yy\");\n\n\t\t\t/**\n\t\t\t * Visualization of intervals within the string after the last insertion:\n\t\t\t * All intervals shift forwards\n\t\t\t *\n\t\t\t *                  0 1 2 3 4 5 6 7 8 9 10 11 12 13 14\n\t\t\t *                  y y a b c x x d e f g  h  i  j  k\n\t\t\t *  interval1             ^\n\t\t\t *  interval2               [-----]\n\t\t\t *  interval3                         [-]\n\t\t\t *  interval4                              [-----]\n\t\t\t */\n\n\t\t\tresults = queryIntervalsByPositions(0, 14);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 3, end: 3 },\n\t\t\t\t{ start: 4, end: 7 },\n\t\t\t\t{ start: 9, end: 10 },\n\t\t\t\t{ start: 11, end: 13 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when removing segments from the string\", () => {\n\t\t\t// Remove the middle part of the string\n\t\t\ttestSharedString.removeText(2, 4);\n\n\t\t\t/**\n\t\t\t * Visualization of intervals within the string after the last deletion:\n\t\t\t *\n\t\t\t * interval2's startpoint slides forwards but the remains in the original segment\n\t\t\t * interval3 shifts forwards\n\t\t\t *\n\t\t\t *                  0 1 2 3 4\n\t\t\t *                  a b e f g\n\t\t\t *  interval1         ^\n\t\t\t *  interval2           ^\n\t\t\t *  interval3             [-]\n\t\t\t */\n\n\t\t\tresults = queryIntervalsByPositions(0, 4);\n\t\t\tassertSequenceIntervalsEqual(testSharedString, results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 2, end: 2 },\n\t\t\t\t{ start: 3, end: 4 },\n\t\t\t]);\n\n\t\t\t// Remove the end part of the string\n\t\t\ttestSharedString.removeText(2, 5);\n\n\t\t\t/**\n\t\t\t * Visualization of intervals within the string after the last deletion:\n\t\t\t *\n\t\t\t * There does not exist a next valid segment for interval2 and interval3\n\t\t\t *\n\t\t\t *                  0 1\n\t\t\t *                  a b\n\t\t\t *  interval1         ^\n\t\t\t *  interval2\n\t\t\t *  interval3\n\t\t\t */\n\n\t\t\tresults = queryIntervalsByPositions(0, 1);\n\t\t\tassertSequenceIntervalsEqual(\n\t\t\t\ttestSharedString,\n\t\t\t\tresults,\n\t\t\t\t// TODO: At this point, this test should expect interval2 and interval3 to slide to an EndOfString segment\n\t\t\t\t// rather than back, and so should expect results:\n\t\t\t\t// [{ start: 1, end: 1 }]\n\t\t\t\t// However, currently intervals attempt to slide back when sliding forward fails.\n\t\t\t\t[\n\t\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t],\n\t\t\t);\n\t\t});\n\t});\n\n\tdescribe(\"find consistent results with `naive` method\", () => {\n\t\t/**\n\t\t * Fills in random sequence intervals to the index and interval collection\n\t\t * @param options - The options object containing random, count, and min properties.\n\t\t */\n\t\tconst fillInRandomSequenceIntervals = ({\n\t\t\trandom,\n\t\t\tcount,\n\t\t\tmin,\n\t\t}: Pick<RandomIntervalOptions, \"random\" | \"count\" | \"min\">): void => {\n\t\t\t// Generate random text, and insert them into random positions of the string\n\t\t\tfor (let i = 0; i < count / 2; ++i) {\n\t\t\t\ttestSharedString.insertText(\n\t\t\t\t\trandom.integer(0, Math.max(testSharedString.getLength() - 1, 0)),\n\t\t\t\t\trandom.string(random.bool() ? 2 : 1),\n\t\t\t\t);\n\t\t\t}\n\t\t\tconst max = testSharedString.getLength() - 1;\n\t\t\t// Genereate random sequence intervals\n\t\t\tfor (let i = 0; i < count; ++i) {\n\t\t\t\tconst start = random.integer(min, max);\n\t\t\t\tconst end = random.integer(start, max);\n\t\t\t\tcollection.add({ start, end });\n\t\t\t}\n\t\t};\n\n\t\tit(\"when given massive random inputs\", () => {\n\t\t\tconst random = makeRandom(0);\n\t\t\tconst count = 100;\n\t\t\tconst min = 0;\n\n\t\t\t// Attach the default overlapping interval index for comparison purposes\n\t\t\tconst overlappingIntervalsIndex = createOverlappingIntervalsIndex(testSharedString);\n\t\t\tcollection.attachIndex(overlappingIntervalsIndex);\n\n\t\t\tfillInRandomSequenceIntervals({ random, count, min });\n\t\t\t// Test with running 100 random queries\n\t\t\tconst max = testSharedString.getLength() - 1;\n\t\t\tfor (let i = 0; i < 100; ++i) {\n\t\t\t\tconst start = random.integer(min, max);\n\t\t\t\tconst end = random.integer(start, max);\n\n\t\t\t\t// Query intervals using two distinct methods\n\t\t\t\tresults = queryIntervalsByPositions(start, end);\n\t\t\t\tconst expected = overlappingIntervalsIndex.findOverlappingIntervals(start, end);\n\n\t\t\t\tresults.sort(compareFn);\n\t\t\t\texpected.sort(compareFn);\n\n\t\t\t\tassertSequenceIntervalsEqual(testSharedString, results, expected);\n\t\t\t}\n\t\t});\n\t});\n});\n"]}