| Name : perl-Tree-Interval
| |
| Version : 0.300.0
| Vendor : (none)
|
| Release : 9pclos2017
| Date : 2017-07-12 18:54:55
|
| Group : Development/Perl
| Source RPM : perl-Tree-Interval-0.300.0-9pclos2017.src.rpm
|
| Size : 0.02 MB
| |
| Packager : bb2 < bb2>
| |
| 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 < bholzmanAATTearthlink.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.
|
RPM found in directory: /vol/rzm3/linux-pclinuxos/pclinuxos/apt/pclinuxos/64bit/RPMS.x86_64 |
