| 1 |
Source: libtree-redblack-perl |
| 2 |
Maintainer: Debian Perl Group <[email protected]> |
| 3 |
Uploaders: gregor herrmann <[email protected]>, |
| 4 |
Damyan Ivanov <[email protected]> |
| 5 |
Section: perl |
| 6 |
Priority: optional |
| 7 |
Build-Depends: debhelper-compat (= 13) |
| 8 |
Build-Depends-Indep: perl |
| 9 |
Standards-Version: 4.1.3 |
| 10 |
Vcs-Browser: https://salsa.debian.org/perl-team/modules/packages/libtree-redblack-perl |
| 11 |
Vcs-Git: https://salsa.debian.org/perl-team/modules/packages/libtree-redblack-perl.git |
| 12 |
Homepage: https://metacpan.org/release/Tree-RedBlack |
| 13 |
Testsuite: autopkgtest-pkg-perl |
| 14 |
Rules-Requires-Root: no |
| 15 |
|
| 16 |
Package: libtree-redblack-perl |
| 17 |
Architecture: all |
| 18 |
Depends: ${misc:Depends}, |
| 19 |
${perl:Depends} |
| 20 |
Multi-Arch: foreign |
| 21 |
Description: Perl implementation of Red/Black tree, a balanced tree |
| 22 |
Tree::RedBlack is a demonstration package, showing the performance |
| 23 |
differences between different methods of data storage and |
| 24 |
accessing. It contains a perl implementation of the Red/Black tree |
| 25 |
algorithm found in the book "Algorithms", by Cormen, Leiserson & |
| 26 |
Rivest (more commonly known as "CLR" or "The White Book"). A |
| 27 |
Red/Black tree is a binary tree which remains "balanced"- that is, |
| 28 |
the longest length from root to a node is at most one more than the |
| 29 |
shortest such length. It is fairly efficient; no operation takes |
| 30 |
more than O(lg(n)) time. |
| 31 |
. |
| 32 |
An example perl script is contained in the documentation directory, |
| 33 |
which would show the different run times using hash table, linear or |
| 34 |
tree structure. |