Package : perl-Tree-Interval > RPM : perl-Tree-Interval-0.300.0-11.mga9.src.rpm
Basic items
| Name |
perl-Tree-Interval |
| Version |
0.300.0 |
| Release |
11.mga9 |
| URL |
https://metacpan.org/release/Tree-Interval |
| Group |
Development/Perl |
| Summary |
Perl implementation of an interval tree |
| Size |
7KB |
| Arch |
noarch |
| License |
GPL+ or Artistic |
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.
Media information
| Distribution release |
Mageia cauldron |
| Media name |
core-release |
| Media arch |
i586 |
Advanced items