A data structure for efficient manipulation of sets of intervals
Clone or download
Latest commit 2f63a6c Aug 20, 2018

README.md

IntervalTrees

Latest Release MIT License Stable documentation Lifecycle Chat on Discord

Description

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.

Installation

Install IntervalTrees from the Julia REPL:

using Pkg
add("IntervalTrees")
# Pkg.add("IntervalTrees") for julia prior to v0.7

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

Testing

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

PackageEvaluator Latest Build Status
Build status

Contributing

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

Take a look at the CONTRIBUTING file provided with every BioJulia package package for detailed contributor and maintainer guidelines.

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.

backers

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.

Questions?

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