interval_tree 0.2.2

Dart native js
Flutter Android iOS web

A non-overlapping interval tree with support for calculating unions, intersections, and differences between individual intervals and entire trees.

pub license: MIT build codecov

interval_tree #

A Dart implementation of an interval tree, with support for calculating unions, intersections, and differences between individual intervals, or entire iterable collections of intervals, such as other interval trees.

Mutable #

IntervalTree has support for adding and removing intervals, or entire iterable collections of intervals, such as other interval trees.

Non-overlapping #

IntervalTree automatically joins and splits appropriate intervals at insertions and removals, respectively, whilst maintaining a collection of non-overlapping intervals.

Iterable #

IntervalTree is an iterable collection offering all standard iterable operations, such as easily accessing the first and last interval.

History #

IntervalTree started off as a quick and dirty Dart port of Erik Garrison's simple C++ interval tree implementation, but was soon re-written and based on quiver.collection's AVL implementation of a self-balancing binary tree AvlTreeSet.

2
likes
100
pub points
58%
popularity

A non-overlapping interval tree with support for calculating unions, intersections, and differences between individual intervals and entire trees.

Repository (GitHub)
View/report issues

Documentation

API reference

Uploader

jpnurmi@gmail.com

License

MIT (LICENSE)

Dependencies

meta, quiver

More

Packages that depend on interval_tree