UNPKG

@tanishiking/aho-corasick

Version:

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

8 lines (7 loc) 230 B
import { Interval } from './interval'; export declare class IntervalTree { private rootNode; constructor(intervals: Interval[]); removeOverlaps<T extends Interval>(intervals: T[]): T[]; private containsInterval; }