- Name: perl-Tree-Interval
- Version: 0.300.0
- Release: 3.mga4
- 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: 18571
- 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.
- OptFlags: -O2 -g -pipe -Wformat -Werror=format-security -Wp,-D_FORTIFY_SOURCE=2 -fstack-protector --param=ssp-buffer-size=4 -fomit-frame-pointer -march=i586 -mtune=generic -fasynchronous-unwind-tables
- Cookie: sucuk.mageia.org 1382104096
- Buildhost: sucuk.mageia.org
