Пакет: libtree-redblack-perl (0.5-4)
Връзки за libtree-redblack-perl
Ресурси за Debian:
- Доклади за грешки
- Developer Information
- Журнал на промените в Debian
- Авторски права
- Управление на кръпките в 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]
Отговорници:
- Debian Perl Group (Страница за QA, Пощенски архив)
- gregor herrmann (Страница за QA)
- Damyan Ivanov (Страница за QA)
Външни препратки:
- Начална страница [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
Изтегляне на libtree-redblack-perl
Архитектура | Големина на пакета | Големина след инсталиране | Файлове |
---|---|---|---|
all | 12,3 кБ | 40,0 кБ | [списък на файловете] |