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.
- Versions: 0.0.0-1.b90527f
- Website: https://github.com/ekg/intervaltree
- Licenses: Expat
- Package source: gnu/packages/bioinformatics.scm
- Builds: See build status
- Issues: See known issues
Installation
Install the latest version of intervaltree as follows:
guix install intervaltree
Or install a particular version:
guix install intervaltree@0.0.0-1.b90527f
You can also install packages in augmented, pure or containerized environments for development or simply to try them out without polluting your user profile. See the guix shell documentation for more information.
Badge code
You can use the following badge to inform users of intervaltree about the latest version available in Guix.
Example HTML:
<a href='https://packages.guix.gnu.org/packages/intervaltree'><img src='https://packages.guix.gnu.org/packages/intervaltree/badges/latest-version.svg' alt='Version in GNU Guix'></a>
Example Markdown:
[](https://packages.guix.gnu.org/packages/intervaltree)
Example Org:
[[https://packages.guix.gnu.org/packages/intervaltree][https://packages.guix.gnu.org/packages/intervaltree/badges/latest-version.svg]]