@tanishiking/aho-corasick/dist/interval/interval-tree.test.js

TypeScript implementation of the Aho-Corasick algorithm for efficient string matching

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
var interval_1 = require("./interval");
var interval_tree_1 = require("./interval-tree");
describe('IntervalTree', function () {
    describe('removeOverlaps', function () {
        test('remove all overlaps', function () {
            var intervals = [
                new interval_1.Interval(0, 2),
                new interval_1.Interval(4, 5),
                new interval_1.Interval(2, 10),
                new interval_1.Interval(6, 13),
                new interval_1.Interval(9, 15),
                new interval_1.Interval(12, 16),
            ];
            var intervalTree = new interval_tree_1.IntervalTree(intervals);
            var filtered = intervalTree.removeOverlaps(intervals);
            expect(filtered).toHaveLength(2);
            expect(filtered[0]).toEqual(new interval_1.Interval(2, 10));
            expect(filtered[1]).toEqual(new interval_1.Interval(12, 16));
        });
    });
});