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.
| Linter | Message | Location |
|---|---|---|
| No lint warnings ✓ | ||