| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: perl-Tree-Interval | Distribution: Mageia |
| Version: 0.300.0 | Vendor: Mageia.Org |
| Release: 12.mga10 | Build date: Fri Jun 27 06:30:20 2025 |
| Group: Development/Perl | Build host: localhost |
| Size: 17749 | Source RPM: perl-Tree-Interval-0.300.0-12.mga10.src.rpm |
| Packager: umeabot <umeabot> | |
| Url: https://metacpan.org/release/Tree-Interval | |
| Summary: Perl implementation of an interval tree | |
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.
GPL+ or Artistic
* Fri Jun 27 2025 umeabot <umeabot> 0.300.0-12.mga10 + Revision: 2208028 - Mageia 10 Mass Rebuild
/usr/share/doc/perl-Tree-Interval /usr/share/doc/perl-Tree-Interval/META.yml /usr/share/doc/perl-Tree-Interval/MYMETA.yml /usr/share/man/man3/Tree::Interval.3pm.xz /usr/share/perl5/vendor_perl/Tree /usr/share/perl5/vendor_perl/Tree/Interval /usr/share/perl5/vendor_perl/Tree/Interval.pm /usr/share/perl5/vendor_perl/Tree/Interval/Node.pm /usr/share/perl5/vendor_perl/Tree/Interval/Test.pm
Generated by rpm2html 1.8.1
Fabrice Bellet, Sat Jun 28 07:01:29 2025