Bug#279808: O: libtree-redblack-perl -- Perl implementation of Red/Black tree, a balanced tree.
Package: wnpp
Severity: normal
The current maintainer of libtree-redblack-perl, Stephen Zander <gibreel@debian.org>,
is apparently not active anymore. Therefore, I orphan this package
now. If you want to be the new maintainer, please take it -- see
http://www.debian.org/devel/wnpp/index.html#howto-o for detailed
instructions how to adopt a package properly.
Some information about this package:
Package: libtree-redblack-perl
Binary: libtree-redblack-perl
Version: 0.3-4
Priority: optional
Section: perl
Maintainer: Stephen Zander <gibreel@debian.org>
Build-Depends: debhelper (>= 3.0.5), perl (>= 5.6.0-20)
Architecture: all
Standards-Version: 3.5.4
Format: 1.0
Directory: pool/main/libt/libtree-redblack-perl
Files: 67310bcc0fdd851b1be50c2c75338ee6 781 libtree-redblack-perl_0.3-4.dsc
b0eb38ffd7ced50d52cdf7244365d3a2 5159 libtree-redblack-perl_0.3.orig.tar.gz
68923345a274aed7d5b67fdc54f6f108 2381 libtree-redblack-perl_0.3-4.diff.gz
Package: libtree-redblack-perl
Priority: optional
Section: perl
Installed-Size: 100
Maintainer: Stephen Zander <gibreel@debian.org>
Architecture: all
Version: 0.3-4
Depends: perl (>= 5.6.0-16)
Filename: pool/main/libt/libtree-redblack-perl/libtree-redblack-perl_0.3-4_all.deb
Size: 13624
MD5sum: 139586b354f17b3c9d62e47aedaae089
Description: Perl implementation of Red/Black tree, a balanced tree.
This is a demonstration package, showing the performance differences
between different methods of data storage and accessing. It contains
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.
.
An example perl script is contained in the documentation directory,
which would show the different run times using hash table, linear or
tree structure.
Justification: Mail bouncing for 3 months, last upload half a year ago
Reply to: