[ 原始碼： libtree-redblack-perl ]
套件：libtree-redblack-perl（0.5-4）
libtree-redblack-perl 的相關連結
Debian 的資源：
下載原始碼套件 libtree-redblack-perl：
- [libtree-redblack-perl_0.5-4.dsc]
- [libtree-redblack-perl_0.5.orig.tar.gz]
- [libtree-redblack-perl_0.5-4.debian.tar.xz]
維護小組：
外部的資源：
- 主頁 [metacpan.org]
相似套件：
Perl implementation of Red/Black tree, a balanced tree
Tree::RedBlack 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.
其他與 libtree-redblack-perl 有關的套件
|
|
|
|
-
- dep: perl
- Larry Wall's Practical Extraction and Report Language