Package : perl-Tree-Interval
Package details
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: http://search.cpan.org/dist/Tree-Interval
License: GPL+ or Artistic
Maintainer: nobody
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: http://search.cpan.org/dist/Tree-Interval
License: GPL+ or Artistic
Maintainer: nobody
List of RPMs
- perl-Tree-Interval-0.300.0-8.mga6.src.rpm (Mageia 6, x86_64 media, core-release)