- Name: perl-Tree-RedBlack
- Version: 0.3
- Release: 10
- Epoch: 0
- Group: Development/Languages/Perl
- License: Artistic
- Url:
- Summary: Tree::RedBlack - Perl implementation of Red/Black tree, a type of balanced tree
- Architecture: noarch
- Size: 20587
- Distribution: PLD 2.0 (Ac)
- Vendor: PLD
- Packager: PLD bug tracking system ( http://bugs.pld-linux.org/ )
Description:
This is a Perl implementation of the Red/Black tree algorithm found in
the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly
known as "CLR" or "The White Book"). A Red/Black tree is a binary tree
which remains "balanced" - that is, 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(lg(n)) time.
- OptFlags: -O2 -march=i386
- Cookie:
- Buildhost: i386.ac.pld-linux.org
Sources packages:
Other version of this rpm:
