パッケージ: libtree-redblack-perl (0.5-2)
libtree-redblack-perl に関するリンク
Trisquel の資源:
libtree-redblack-perl ソースパッケージをダウンロード:
- [libtree-redblack-perl_0.5-2.dsc]
- [libtree-redblack-perl_0.5.orig.tar.gz]
- [libtree-redblack-perl_0.5-2.debian.tar.xz]
メンテナ:
Original Maintainers:
- Debian Perl Group (メールアーカイブ)
- gregor herrmann
- Damyan Ivanov
外部の資源:
- ホームページ [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