@fluidframework/sequence 2.0.0-dev-rc.3.0.0.250606 → 2.0.0-dev-rc.3.0.0.253463

package/src/sharedString.ts

@@ -14,7 +14,8 @@ import {
 	ReferenceType,
 	TextSegment,
 	refHasTileLabel,
-} from "@fluidframework/merge-tree";
+} from "@fluidframework/merge-tree/internal";
+
 import { SharedSegmentSequence } from "./sequence.js";
 import { SharedStringFactory } from "./sequenceFactory.js";
 

package/lib/test/collections.intervalTree.js

@@ -1,73 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { IntervalTree } from "../intervalTree.js";
-class TestInterval {
-    constructor(start, end) {
-        this.start = start;
-        this.end = end;
-    }
-    clone() {
-        return new TestInterval(this.start, this.end);
-    }
-    compare(b) {
-        const startResult = this.compareStart(b);
-        return startResult === 0 ? this.compareEnd(b) : startResult;
-    }
-    compareStart(b) {
-        return this.start - b.start;
-    }
-    compareEnd(b) {
-        return this.end - b.end;
-    }
-    overlaps(b) {
-        const result = this.start <= b.end && this.end >= b.start;
-        return result;
-    }
-    union(b) {
-        return new TestInterval(Math.min(this.start, b.start), Math.max(this.end, b.end));
-    }
-    modify(label, start, end) {
-        const startPos = start ?? this.start;
-        const endPos = end ?? this.end;
-        if (this.start === startPos && this.end === endPos) {
-            // Return undefined to indicate that no change is necessary.
-            return;
-        }
-        return new TestInterval(startPos, endPos);
-    }
-}
-describe("Collections.IntervalTree", () => {
-    let intervalTree;
-    beforeEach(() => {
-        intervalTree = new IntervalTree();
-    });
-    describe(".map", () => {
-        it("Should run each node through the given function", () => {
-            intervalTree.put(new TestInterval(1, 5));
-            intervalTree.put(new TestInterval(4, 8));
-            intervalTree.put(new TestInterval(1, 10));
-            let range1Pass = false;
-            let range2Pass = false;
-            let range3Pass = false;
-            const map = (interval) => {
-                if (interval.start === 1 && interval.end === 5) {
-                    range1Pass = true;
-                }
-                else if (interval.start === 4 && interval.end === 8) {
-                    range2Pass = true;
-                }
-                else if (interval.start === 1 && interval.end === 10) {
-                    range3Pass = true;
-                }
-                return true;
-            };
-            intervalTree.map(map);
-            const fullWalk = range1Pass && range2Pass && range3Pass;
-            assert.equal(fullWalk, true, "Full walk of the interval tree did not occur");
-        });
-    });
-});
-//# sourceMappingURL=collections.intervalTree.js.map

package/lib/test/collections.intervalTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"collections.intervalTree.js","sourceRoot":"","sources":["../../src/test/collections.intervalTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAGlD,MAAM,YAAY;IACjB,YACQ,KAAa,EACb,GAAW;QADX,UAAK,GAAL,KAAK,CAAQ;QACb,QAAG,GAAH,GAAG,CAAQ;IAChB,CAAC;IAEG,KAAK;QACX,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC;IAEM,OAAO,CAAC,CAAe;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACzC,OAAO,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAC7D,CAAC;IAEM,YAAY,CAAC,CAAe;QAClC,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC7B,CAAC;IAEM,UAAU,CAAC,CAAe;QAChC,OAAO,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IACzB,CAAC;IAEM,QAAQ,CAAC,CAAe;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC;QAC1D,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,KAAK,CAAC,CAAe;QAC3B,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnF,CAAC;IAEM,MAAM,CAAC,KAAa,EAAE,KAAa,EAAE,GAAW;QACtD,MAAM,QAAQ,GAAG,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;QAC/B,IAAI,IAAI,CAAC,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,KAAK,MAAM,EAAE;YACnD,4DAA4D;YAC5D,OAAO;SACP;QACD,OAAO,IAAI,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;CACD;AAED,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACzC,IAAI,YAAwC,CAAC;IAE7C,UAAU,CAAC,GAAG,EAAE;QACf,YAAY,GAAG,IAAI,YAAY,EAAgB,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QACrB,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YAC1D,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,YAAY,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAE1C,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,IAAI,UAAU,GAAG,KAAK,CAAC;YAEvB,MAAM,GAAG,GAAG,CAAC,QAAsB,EAAE,EAAE;gBACtC,IAAI,QAAQ,CAAC,KAAK,KAAK,CAAC,IAAI,QAAQ,CAAC,GAAG,KAAK,CAAC,EAAE;oBAC/C,UAAU,GAAG,IAAI,CAAC;iBAClB;qBAAM,IAAI,QAAQ,CAAC,KAAK,KAAK,CAAC,IAAI,QAAQ,CAAC,GAAG,KAAK,CAAC,EAAE;oBACtD,UAAU,GAAG,IAAI,CAAC;iBAClB;qBAAM,IAAI,QAAQ,CAAC,KAAK,KAAK,CAAC,IAAI,QAAQ,CAAC,GAAG,KAAK,EAAE,EAAE;oBACvD,UAAU,GAAG,IAAI,CAAC;iBAClB;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC;YAEF,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEtB,MAAM,QAAQ,GAAG,UAAU,IAAI,UAAU,IAAI,UAAU,CAAC;YACxD,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,8CAA8C,CAAC,CAAC;QAC9E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { IntervalTree } from \"../intervalTree.js\";\nimport { IInterval } from \"../intervals/index.js\";\n\nclass TestInterval implements IInterval {\n\tconstructor(\n\t\tpublic start: number,\n\t\tpublic end: number,\n\t) {}\n\n\tpublic clone() {\n\t\treturn new TestInterval(this.start, this.end);\n\t}\n\n\tpublic compare(b: TestInterval) {\n\t\tconst startResult = this.compareStart(b);\n\t\treturn startResult === 0 ? this.compareEnd(b) : startResult;\n\t}\n\n\tpublic compareStart(b: TestInterval) {\n\t\treturn this.start - b.start;\n\t}\n\n\tpublic compareEnd(b: TestInterval) {\n\t\treturn this.end - b.end;\n\t}\n\n\tpublic overlaps(b: TestInterval) {\n\t\tconst result = this.start <= b.end && this.end >= b.start;\n\t\treturn result;\n\t}\n\n\tpublic union(b: TestInterval) {\n\t\treturn new TestInterval(Math.min(this.start, b.start), Math.max(this.end, b.end));\n\t}\n\n\tpublic modify(label: string, start: number, end: number) {\n\t\tconst startPos = start ?? this.start;\n\t\tconst endPos = end ?? this.end;\n\t\tif (this.start === startPos && this.end === endPos) {\n\t\t\t// Return undefined to indicate that no change is necessary.\n\t\t\treturn;\n\t\t}\n\t\treturn new TestInterval(startPos, endPos);\n\t}\n}\n\ndescribe(\"Collections.IntervalTree\", () => {\n\tlet intervalTree: IntervalTree<TestInterval>;\n\n\tbeforeEach(() => {\n\t\tintervalTree = new IntervalTree<TestInterval>();\n\t});\n\n\tdescribe(\".map\", () => {\n\t\tit(\"Should run each node through the given function\", () => {\n\t\t\tintervalTree.put(new TestInterval(1, 5));\n\t\t\tintervalTree.put(new TestInterval(4, 8));\n\t\t\tintervalTree.put(new TestInterval(1, 10));\n\n\t\t\tlet range1Pass = false;\n\t\t\tlet range2Pass = false;\n\t\t\tlet range3Pass = false;\n\n\t\t\tconst map = (interval: TestInterval) => {\n\t\t\t\tif (interval.start === 1 && interval.end === 5) {\n\t\t\t\t\trange1Pass = true;\n\t\t\t\t} else if (interval.start === 4 && interval.end === 8) {\n\t\t\t\t\trange2Pass = true;\n\t\t\t\t} else if (interval.start === 1 && interval.end === 10) {\n\t\t\t\t\trange3Pass = true;\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t};\n\n\t\t\tintervalTree.map(map);\n\n\t\t\tconst fullWalk = range1Pass && range2Pass && range3Pass;\n\t\t\tassert.equal(fullWalk, true, \"Full walk of the interval tree did not occur\");\n\t\t});\n\t});\n});\n"]}

package/lib/test/createSnapshotFiles.js

@@ -1,15 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import fs from "fs";
-import { convertSummaryTreeToITree } from "@fluidframework/runtime-utils";
-import { LocationBase, generateStrings } from "./generateSharedStrings.js";
-for (const { snapshotPath, expected, snapshotIsNormalized } of generateStrings()) {
-    const summaryTree = expected.getAttachSummary().summary;
-    const snapshotTree = convertSummaryTreeToITree(summaryTree);
-    if (snapshotIsNormalized || snapshotPath === "v1Intervals/withV1Intervals") {
-        fs.writeFileSync(`${LocationBase}${snapshotPath}.json`, JSON.stringify(snapshotTree, undefined, 1));
-    }
-}
-//# sourceMappingURL=createSnapshotFiles.js.map

package/lib/test/createSnapshotFiles.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"createSnapshotFiles.js","sourceRoot":"","sources":["../../src/test/createSnapshotFiles.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,EAAE,yBAAyB,EAAE,MAAM,+BAA+B,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAE3E,KAAK,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,oBAAoB,EAAE,IAAI,eAAe,EAAE,EAAE;IACjF,MAAM,WAAW,GAAG,QAAQ,CAAC,gBAAgB,EAAE,CAAC,OAAO,CAAC;IACxD,MAAM,YAAY,GAAG,yBAAyB,CAAC,WAAW,CAAC,CAAC;IAC5D,IAAI,oBAAoB,IAAI,YAAY,KAAK,6BAA6B,EAAE;QAC3E,EAAE,CAAC,aAAa,CACf,GAAG,YAAY,GAAG,YAAY,OAAO,EACrC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC,CAC1C,CAAC;KACF;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport fs from \"fs\";\nimport { convertSummaryTreeToITree } from \"@fluidframework/runtime-utils\";\nimport { LocationBase, generateStrings } from \"./generateSharedStrings.js\";\n\nfor (const { snapshotPath, expected, snapshotIsNormalized } of generateStrings()) {\n\tconst summaryTree = expected.getAttachSummary().summary;\n\tconst snapshotTree = convertSummaryTreeToITree(summaryTree);\n\tif (snapshotIsNormalized || snapshotPath === \"v1Intervals/withV1Intervals\") {\n\t\tfs.writeFileSync(\n\t\t\t`${LocationBase}${snapshotPath}.json`,\n\t\t\tJSON.stringify(snapshotTree, undefined, 1),\n\t\t);\n\t}\n}\n"]}

package/lib/test/dirname.cjs

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

package/lib/test/dirname.cjs.map

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

package/lib/test/endpointInRangeIndex.spec.js

@@ -1,182 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { makeRandom } from "@fluid-private/stochastic-test-utils";
-import { EndpointInRangeIndex } from "../intervalIndex/index.js";
-import { intervalHelpers } from "../intervals/index.js";
-import { assertPlainNumberIntervals, createTestInterval, generateRandomIntervals, } from "./intervalIndexTestUtils.js";
-class TestEndpointInRangeIndex {
-    constructor() {
-        this.intervals = [];
-    }
-    add(interval) {
-        this.intervals.push(interval);
-    }
-    remove(interval) {
-        const index = this.intervals.findIndex((i) => i === interval);
-        if (index !== -1) {
-            this.intervals.splice(index, 1);
-        }
-    }
-    findIntervalsWithEndpointInRange(start, end) {
-        return this.intervals.filter((interval) => interval.end >= start && interval.end <= end);
-    }
-}
-describe("findIntervalsWithEndpointInRange", () => {
-    const helpers = intervalHelpers;
-    // sort the query result by the interval endpoint value
-    const compareFn = (a, b) => {
-        if (a.end === b.end) {
-            return a.start - b.start;
-        }
-        return a.end - b.end;
-    };
-    let endpointInRangeIndex;
-    let results;
-    beforeEach(() => {
-        endpointInRangeIndex = new EndpointInRangeIndex(undefined, helpers);
-    });
-    describe("finds no intervals", () => {
-        it("when the index is empty", () => {
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);
-            assert.equal(results.length, 0);
-        });
-        describe("with intervals in the index", () => {
-            beforeEach(() => {
-                endpointInRangeIndex.add(createTestInterval(1, 2));
-                endpointInRangeIndex.add(createTestInterval(2, 3));
-            });
-            it("when start > end for the query range", () => {
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(2, 1);
-                assert.equal(results.length, 0);
-            });
-            it("when start is 0 for the query range", () => {
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(0, 1);
-                assert.equal(results.length, 0);
-            });
-            it("when endpoint(s) of the query range are negative", () => {
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(-2, -1);
-                assert.equal(results.length, 0);
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(-1, 1);
-                assert.equal(results.length, 0);
-            });
-            it("when all intervals are above the query range", () => {
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);
-                assert.equal(results.length, 0);
-            });
-            it("when all intervals are below the query range", () => {
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(4, 5);
-                assert.equal(results.length, 0);
-            });
-        });
-    });
-    describe("finds intervals while performing multiple adding operations on the index", () => {
-        beforeEach(() => {
-            endpointInRangeIndex.add(createTestInterval(1, 1));
-            endpointInRangeIndex.add(createTestInterval(1, 3));
-        });
-        it("when quering the intervals which the startpoints exactly fall on the range boundary", () => {
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);
-            assertPlainNumberIntervals(results, [{ start: 1, end: 1 }]);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);
-            assertPlainNumberIntervals(results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 3 },
-            ]);
-        });
-        it("when querying various kinds of intervals within the range", () => {
-            endpointInRangeIndex.add(createTestInterval(2, 4));
-            endpointInRangeIndex.add(createTestInterval(3, 5));
-            endpointInRangeIndex.add(createTestInterval(3, 4));
-            endpointInRangeIndex.add(createTestInterval(3, 4)); // duplicate interval
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(3, 6);
-            results.sort(compareFn);
-            assertPlainNumberIntervals(results, [
-                { start: 1, end: 3 },
-                { start: 2, end: 4 },
-                { start: 3, end: 4 },
-                { start: 3, end: 4 },
-                { start: 3, end: 5 },
-            ]);
-        });
-    });
-    describe("find intervals while performing removing operations on the index", () => {
-        let interval1;
-        let interval2;
-        beforeEach(() => {
-            interval1 = createTestInterval(1, 1);
-            interval2 = createTestInterval(1, 3);
-            endpointInRangeIndex.add(interval1);
-            endpointInRangeIndex.add(interval2);
-        });
-        it("when removing the interval with duplicate startpoints/endpoints", () => {
-            const interval3 = createTestInterval(1, 1);
-            endpointInRangeIndex.add(interval3);
-            endpointInRangeIndex.remove(interval1);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);
-            results.sort(compareFn);
-            assertPlainNumberIntervals(results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 3 },
-            ]);
-            endpointInRangeIndex.remove(interval3);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);
-            assertPlainNumberIntervals(results, [{ start: 1, end: 3 }]);
-        });
-        it("when removing the interval does not exist in the index", () => {
-            const interval3 = createTestInterval(1, 1);
-            endpointInRangeIndex.remove(interval3);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);
-            results.sort(compareFn);
-            assertPlainNumberIntervals(results, [
-                { start: 1, end: 1 },
-                { start: 1, end: 3 },
-            ]);
-        });
-        it("when removing the interval within the target range", () => {
-            endpointInRangeIndex.remove(interval2);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);
-            assertPlainNumberIntervals(results, [{ start: 1, end: 1 }]);
-            const interval3 = createTestInterval(2, 4);
-            endpointInRangeIndex.add(interval3);
-            const interval4 = createTestInterval(3, 4);
-            endpointInRangeIndex.add(interval4);
-            endpointInRangeIndex.remove(interval3);
-            results = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 5);
-            results.sort(compareFn);
-            assertPlainNumberIntervals(results, [
-                { start: 1, end: 1 },
-                { start: 3, end: 4 },
-            ]);
-        });
-    });
-    describe("find exactly the same intervals as those obtained by `brute-force` method", () => {
-        it("when given massive random inputs", () => {
-            const testIndex = new TestEndpointInRangeIndex();
-            const random = makeRandom(0);
-            const count = 800;
-            const min = 1;
-            const max = 1500;
-            // Generate intervals randomly and add them to both index
-            const intervals = generateRandomIntervals({ random, count, min, max });
-            for (const interval of intervals) {
-                testIndex.add(interval);
-                endpointInRangeIndex.add(interval);
-            }
-            // Test with running 1000 random queries
-            for (let i = 0; i < 1000; ++i) {
-                const start = random.integer(min, max);
-                const end = random.integer(start, max);
-                // Query intervals using both index
-                results = endpointInRangeIndex.findIntervalsWithEndpointInRange(start, end);
-                const expected = testIndex.findIntervalsWithEndpointInRange(start, end);
-                results.sort(compareFn);
-                expected.sort(compareFn);
-                assertPlainNumberIntervals(results, expected);
-            }
-        });
-    });
-});
-//# sourceMappingURL=endpointInRangeIndex.spec.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"endpointInRangeIndex.spec.js","sourceRoot":"","sources":["../../src/test/endpointInRangeIndex.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAElE,OAAO,EAAE,oBAAoB,EAAyB,MAAM,2BAA2B,CAAC;AACxF,OAAO,EAAY,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAClE,OAAO,EACN,0BAA0B,EAC1B,kBAAkB,EAClB,uBAAuB,GACvB,MAAM,6BAA6B,CAAC;AAErC,MAAM,wBAAwB;IAG7B;QACC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,GAAG,CAAC,QAAkB;QACrB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,CAAC,QAAkB;QACxB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC;QAC9D,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE;YACjB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;SAChC;IACF,CAAC;IAED,gCAAgC,CAAC,KAAa,EAAE,GAAW;QAC1D,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,IAAI,KAAK,IAAI,QAAQ,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IAC1F,CAAC;CACD;AAED,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IACjD,MAAM,OAAO,GAAG,eAAe,CAAC;IAChC,uDAAuD;IACvD,MAAM,SAAS,GAAG,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE;QAC9C,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE;YACpB,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;SACzB;QACD,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;IACtB,CAAC,CAAC;IACF,IAAI,oBAAoB,CAAC;IACzB,IAAI,OAAO,CAAC;IAEZ,UAAU,CAAC,GAAG,EAAE;QACf,oBAAoB,GAAG,IAAI,oBAAoB,CAAC,SAA0B,EAAE,OAAO,CAAC,CAAC;IACtF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QACnC,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;YAC5C,UAAU,CAAC,GAAG,EAAE;gBACf,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnD,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACpD,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;gBAC/C,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;gBAC9C,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;gBAC3D,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACxE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAChC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;gBACvD,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;gBACvD,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtE,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,0EAA0E,EAAE,GAAG,EAAE;QACzF,UAAU,CAAC,GAAG,EAAE;YACf,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;YAC9F,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,0BAA0B,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAE5D,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,0BAA0B,CAAC,OAAO,EAAE;gBACnC,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,2DAA2D,EAAE,GAAG,EAAE;YACpE,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACnD,oBAAoB,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;YAEzE,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,0BAA0B,CAAC,OAAO,EAAE;gBACnC,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;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kEAAkE,EAAE,GAAG,EAAE;QACjF,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QAEd,UAAU,CAAC,GAAG,EAAE;YACf,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrC,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACpC,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;YAC1E,MAAM,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACpC,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAEvC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,0BAA0B,CAAC,OAAO,EAAE;gBACnC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;gBACpB,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;aACpB,CAAC,CAAC;YAEH,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YACvC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,0BAA0B,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;YACjE,MAAM,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAEvC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,0BAA0B,CAAC,OAAO,EAAE;gBACnC,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,oDAAoD,EAAE,GAAG,EAAE;YAC7D,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAEvC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,0BAA0B,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAE5D,MAAM,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEpC,MAAM,SAAS,GAAG,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3C,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAEpC,oBAAoB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAEvC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxB,0BAA0B,CAAC,OAAO,EAAE;gBACnC,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;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2EAA2E,EAAE,GAAG,EAAE;QAC1F,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,SAAS,GAAG,IAAI,wBAAwB,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,KAAK,GAAG,GAAG,CAAC;YAClB,MAAM,GAAG,GAAG,CAAC,CAAC;YACd,MAAM,GAAG,GAAG,IAAI,CAAC;YAEjB,yDAAyD;YACzD,MAAM,SAAS,GAAG,uBAAuB,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACvE,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBACjC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBACxB,oBAAoB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;aACnC;YAED,wCAAwC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;gBAC9B,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,mCAAmC;gBACnC,OAAO,GAAG,oBAAoB,CAAC,gCAAgC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAC5E,MAAM,QAAQ,GAAG,SAAS,CAAC,gCAAgC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBACxE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAEzB,0BAA0B,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;aAC9C;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\nimport { strict as assert } from \"assert\";\nimport { makeRandom } from \"@fluid-private/stochastic-test-utils\";\nimport { Client } from \"@fluidframework/merge-tree\";\nimport { EndpointInRangeIndex, IEndpointInRangeIndex } from \"../intervalIndex/index.js\";\nimport { Interval, intervalHelpers } from \"../intervals/index.js\";\nimport {\n\tassertPlainNumberIntervals,\n\tcreateTestInterval,\n\tgenerateRandomIntervals,\n} from \"./intervalIndexTestUtils.js\";\n\nclass TestEndpointInRangeIndex implements IEndpointInRangeIndex<Interval> {\n\tprivate readonly intervals: Interval[];\n\n\tconstructor() {\n\t\tthis.intervals = [];\n\t}\n\n\tadd(interval: Interval) {\n\t\tthis.intervals.push(interval);\n\t}\n\n\tremove(interval: Interval) {\n\t\tconst index = this.intervals.findIndex((i) => i === interval);\n\t\tif (index !== -1) {\n\t\t\tthis.intervals.splice(index, 1);\n\t\t}\n\t}\n\n\tfindIntervalsWithEndpointInRange(start: number, end: number): Interval[] {\n\t\treturn this.intervals.filter((interval) => interval.end >= start && interval.end <= end);\n\t}\n}\n\ndescribe(\"findIntervalsWithEndpointInRange\", () => {\n\tconst helpers = intervalHelpers;\n\t// sort the query result by the interval endpoint value\n\tconst compareFn = (a: Interval, b: Interval) => {\n\t\tif (a.end === b.end) {\n\t\t\treturn a.start - b.start;\n\t\t}\n\t\treturn a.end - b.end;\n\t};\n\tlet endpointInRangeIndex;\n\tlet results;\n\n\tbeforeEach(() => {\n\t\tendpointInRangeIndex = new EndpointInRangeIndex(undefined as any as Client, helpers);\n\t});\n\n\tdescribe(\"finds no intervals\", () => {\n\t\tit(\"when the index is empty\", () => {\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);\n\t\t\tassert.equal(results.length, 0);\n\t\t});\n\n\t\tdescribe(\"with intervals in the index\", () => {\n\t\t\tbeforeEach(() => {\n\t\t\t\tendpointInRangeIndex.add(createTestInterval(1, 2));\n\t\t\t\tendpointInRangeIndex.add(createTestInterval(2, 3));\n\t\t\t});\n\n\t\t\tit(\"when start > end for the query range\", () => {\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(2, 1);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t});\n\n\t\t\tit(\"when start is 0 for the query range\", () => {\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(0, 1);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t});\n\n\t\t\tit(\"when endpoint(s) of the query range are negative\", () => {\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(-2, -1);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(-1, 1);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t});\n\n\t\t\tit(\"when all intervals are above the query range\", () => {\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t});\n\n\t\t\tit(\"when all intervals are below the query range\", () => {\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(4, 5);\n\t\t\t\tassert.equal(results.length, 0);\n\t\t\t});\n\t\t});\n\t});\n\n\tdescribe(\"finds intervals while performing multiple adding operations on the index\", () => {\n\t\tbeforeEach(() => {\n\t\t\tendpointInRangeIndex.add(createTestInterval(1, 1));\n\t\t\tendpointInRangeIndex.add(createTestInterval(1, 3));\n\t\t});\n\n\t\tit(\"when quering the intervals which the startpoints exactly fall on the range boundary\", () => {\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 1);\n\t\t\tassertPlainNumberIntervals(results, [{ start: 1, end: 1 }]);\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);\n\t\t\tassertPlainNumberIntervals(results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when querying various kinds of intervals within the range\", () => {\n\t\t\tendpointInRangeIndex.add(createTestInterval(2, 4));\n\t\t\tendpointInRangeIndex.add(createTestInterval(3, 5));\n\t\t\tendpointInRangeIndex.add(createTestInterval(3, 4));\n\t\t\tendpointInRangeIndex.add(createTestInterval(3, 4)); // duplicate interval\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(3, 6);\n\t\t\tresults.sort(compareFn);\n\t\t\tassertPlainNumberIntervals(results, [\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t\t{ start: 2, end: 4 },\n\t\t\t\t{ start: 3, end: 4 },\n\t\t\t\t{ start: 3, end: 4 },\n\t\t\t\t{ start: 3, end: 5 },\n\t\t\t]);\n\t\t});\n\t});\n\n\tdescribe(\"find intervals while performing removing operations on the index\", () => {\n\t\tlet interval1;\n\t\tlet interval2;\n\n\t\tbeforeEach(() => {\n\t\t\tinterval1 = createTestInterval(1, 1);\n\t\t\tinterval2 = createTestInterval(1, 3);\n\t\t\tendpointInRangeIndex.add(interval1);\n\t\t\tendpointInRangeIndex.add(interval2);\n\t\t});\n\n\t\tit(\"when removing the interval with duplicate startpoints/endpoints\", () => {\n\t\t\tconst interval3 = createTestInterval(1, 1);\n\t\t\tendpointInRangeIndex.add(interval3);\n\t\t\tendpointInRangeIndex.remove(interval1);\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);\n\t\t\tresults.sort(compareFn);\n\t\t\tassertPlainNumberIntervals(results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t]);\n\n\t\t\tendpointInRangeIndex.remove(interval3);\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);\n\t\t\tassertPlainNumberIntervals(results, [{ start: 1, end: 3 }]);\n\t\t});\n\n\t\tit(\"when removing the interval does not exist in the index\", () => {\n\t\t\tconst interval3 = createTestInterval(1, 1);\n\t\t\tendpointInRangeIndex.remove(interval3);\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);\n\t\t\tresults.sort(compareFn);\n\t\t\tassertPlainNumberIntervals(results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 1, end: 3 },\n\t\t\t]);\n\t\t});\n\n\t\tit(\"when removing the interval within the target range\", () => {\n\t\t\tendpointInRangeIndex.remove(interval2);\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 3);\n\t\t\tassertPlainNumberIntervals(results, [{ start: 1, end: 1 }]);\n\n\t\t\tconst interval3 = createTestInterval(2, 4);\n\t\t\tendpointInRangeIndex.add(interval3);\n\n\t\t\tconst interval4 = createTestInterval(3, 4);\n\t\t\tendpointInRangeIndex.add(interval4);\n\n\t\t\tendpointInRangeIndex.remove(interval3);\n\n\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(1, 5);\n\t\t\tresults.sort(compareFn);\n\t\t\tassertPlainNumberIntervals(results, [\n\t\t\t\t{ start: 1, end: 1 },\n\t\t\t\t{ start: 3, end: 4 },\n\t\t\t]);\n\t\t});\n\t});\n\n\tdescribe(\"find exactly the same intervals as those obtained by `brute-force` method\", () => {\n\t\tit(\"when given massive random inputs\", () => {\n\t\t\tconst testIndex = new TestEndpointInRangeIndex();\n\t\t\tconst random = makeRandom(0);\n\t\t\tconst count = 800;\n\t\t\tconst min = 1;\n\t\t\tconst max = 1500;\n\n\t\t\t// Generate intervals randomly and add them to both index\n\t\t\tconst intervals = generateRandomIntervals({ random, count, min, max });\n\t\t\tfor (const interval of intervals) {\n\t\t\t\ttestIndex.add(interval);\n\t\t\t\tendpointInRangeIndex.add(interval);\n\t\t\t}\n\n\t\t\t// Test with running 1000 random queries\n\t\t\tfor (let i = 0; i < 1000; ++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\t// Query intervals using both index\n\t\t\t\tresults = endpointInRangeIndex.findIntervalsWithEndpointInRange(start, end);\n\t\t\t\tconst expected = testIndex.findIntervalsWithEndpointInRange(start, end);\n\t\t\t\tresults.sort(compareFn);\n\t\t\t\texpected.sort(compareFn);\n\n\t\t\t\tassertPlainNumberIntervals(results, expected);\n\t\t\t}\n\t\t});\n\t});\n});\n"]}