Summary: Perl implementation of an interval tree

Description:
This is a perl implementation of an interval tree for non-overlapping intervals, based on Tree::RedBlack by Benjamin Holzman <bholzman@earthlink.net>. An interval tree is a binary tree which remains "balanced" i.e. the longest length from root to a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(log(N)) time.

URL: https://metacpan.org/release/Tree-Interval
License: GPL+ or Artistic

Maintainer: nobody