Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: perl-Tree-RedBlack | Distribution: Unknown |
Version: 0.3 | Vendor: Dag Apt Repository, http://dag.wieers.com/apt/ |
Release: 1.2.el5.rf | Build date: Thu Mar 8 17:09:44 2007 |
Group: Applications/CPAN | Build host: lisse.leuven.wieers.com |
Size: 21625 | Source RPM: perl-Tree-RedBlack-0.3-1.2.el5.rf.src.rpm |
Packager: Dries Verachtert <dries@ulyssis.org> | |
Url: http://search.cpan.org/dist/Tree-RedBlack/ | |
Summary: Perl implementation of Red/Black tree, a type of balanced tree |
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.
Artistic/GPL
* Wed Mar 22 2006 Dries Verachtert <dries@ulyssis.org> - 0.3-1.2 - 4256/thias - Rebuild for Fedora Core 5. * Sat Apr 09 2005 Dries Verachtert <dries@ulyssis.org> - 0.3-1 - Initial package.
/usr/lib/perl5/vendor_perl/5.8.8/Tree/RedBlack /usr/lib/perl5/vendor_perl/5.8.8/Tree/RedBlack.pm /usr/lib/perl5/vendor_perl/5.8.8/Tree/RedBlack/Node.pm /usr/share/doc/perl-Tree-RedBlack-0.3 /usr/share/doc/perl-Tree-RedBlack-0.3/Changes /usr/share/doc/perl-Tree-RedBlack-0.3/README /usr/share/man/man3/Tree::Node.3pm.gz /usr/share/man/man3/Tree::RedBlack.3pm.gz
Generated by rpm2html 1.8.1
Fabrice Bellet, Tue Jul 9 08:35:59 2024