blob: 4a4d8f49afa603b4fdabc827c59df2c65eeeaed3 (
plain) (
blame)
1
2
3
4
5
6
|
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.
WWW: https://github.com/ekg/intervaltree
|
