| Name : perl-Tree-RedBlack
| |
| Version : 0.5
| Vendor : RPMForge
|
| Release : 1.el4.rf
| Date : 2009-06-12 11:19:07
|
| Group : Applications/CPAN
| Source RPM : perl-Tree-RedBlack-0.5-1.el4.rf.src.rpm
|
| Size : 0.02 MB
| |
| Packager : Fabian Arrotin < fabian_arrotin_arrfab_net>
| |
| Summary : Perl implementation of Red/Black tree, a type of balanced tree
|
Description :
Tree::RedBlack is a pure perl implementation of the Red/Black balanced tree
algorithm from the book \"Algorithms\" by Cormen, Leiserson & Rivest. It
supports insertion, searching, finding minima, maxima, predecessors and
successors, and deletion (deletion definitely has bugs right now). Each node
in the tree consists of a key and a value. Both can be any Perl scalar, even a
complex structure. By default, keys in the tree are ordered lexically, but the
ordering can be overriden by providing the tree with a comparison subroutine.
|
RPM found in directory: /vol/rzm3/linux-dag/dag/redhat/el4/en/ppc/fabian/RPMS |
