interval_tree 0.2.0

A non-overlapping interval tree with support for calculating unions, intersections, and differences between individual intervals and entire trees. The interval tree automatically joins and splits appr [...]

[0.2.0] - 2020-04-27

• Re-wrote IntervalTree based on AvlTreeSet from quiver.collection
• Made IntervalTree automatically join and split appropriate intervals at insertion and removal, respectively
• Added IntervalTree.of() and from() factory and named constructors
• Added IntervalTree.add(), addAll(), remove(), removeAll(), and clear() methods for managing intervals in the tree
• Added IntervalTree.union(), intersection() and difference() methods
• Made IntervalTree accept array literals like [a,b] in place of Interval objects
• Made IntervalTree inherit IterableMixin
• Made Interval immutable
• Renamed Interval.stop to end
• Added Interval.length property
• Added Interval.union(), intersection() and difference() methods

[0.1.0] - 2020-04-23

• Initial Dart port of a minimal C++ interval tree implementation by Erik Garrison: https://github.com/ekg/intervaltree