- Name: perl-Tree-Interval
- Version: 0.300.0
- Release: 2.mga3
- Epoch:
- Group: Development/Perl
- License: GPL+ or Artistic
- Url: http://search.cpan.org/dist/Tree-Interval
- Summary: Perl implementation of an interval tree
- Architecture: noarch
- Size: 6154
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: umeabot <umeabot>
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.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: ecosse.mageia.org 1358088976
- Buildhost: ecosse.mageia.org
Generated packages:
Other version of this rpm:
