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.
$
pkg install intervaltreeOrigin
devel/intervaltree
Size
423KiB
License
MIT
Maintainer
jwb@FreeBSD.org
Dependencies
0 packages
Required by
0 packages