A data structure for efficient manipulation of sets of intervals
40 Stars
Updated Last
1 Year Ago
Started In
April 2014


Latest Release DOI MIT License Stable documentation Lifecycle


IntervalTrees provides the type: IntervalTree{K, V}. It implements an associative container mapping (K, K) pairs to to values of type V. K may be any ordered type, but only pairs (a, b) where a ≤ b can be stored. In other words they are associative contains that map intervals to values.


You can install the IntervalTrees package from the Julia REPL. Press ] to enter pkg mode, then enter the following command:

add IntervalTrees

If you are interested in the cutting edge of the development, please check out the master branch to try new features before release.


IntervalTrees is tested against Julia 0.7-1.X on Linux, OS X, and Windows.

Latest build status:

Unit Tests Documentation codecov Downstream


We appreciate contributions from users including reporting bugs, fixing issues, improving performance and adding new features.

Take a look at the contributing files detailed contributor and maintainer guidelines, and code of conduct.

Financial contributions

We also welcome financial contributions in full transparency on our open collective. Anyone can file an expense. If the expense makes sense for the development of the community, it will be "merged" in the ledger of our open collective by the core contributors and the person who filed the expense will be reimbursed.

Backers & Sponsors

Thank you to all our backers and sponsors!

Love our work and community? Become a backer.


Does your company use BioJulia? Help keep BioJulia feature rich and healthy by sponsoring the project Your logo will show up here with a link to your website.


If you have a question about contributing or using BioJulia software, come on over and chat to us on the Julia Slack workspace, or you can try the Bio category of the Julia discourse site.

Required Packages

No packages found.