Jason W. Bacon 03b4820d4c devel/intervaltree: Minimal C++ interval tree implementation
An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval.  This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.

Unbundled from biology/freebayes
2025-02-18 08:56:30 -06:00

5 lines
264 B
Plaintext

An interval tree can be used to efficiently find a set of numeric
intervals overlapping or containing another interval. This library
provides a basic implementation of an interval tree using C++
templates, allowing the insertion of arbitrary types into the tree.