Pakiet: libtree-redblack-perl (0.5-2)
Odnośniki dla libtree-redblack-perl
Zasoby systemu Debian:
- Raporty o błędach
- Developer Information
- Dziennik zmian w systemie Debian
- Informacje nt. praw autorskich
- Śledzenie łatek systemu Debian
Pobieranie pakietu źródłowego 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]
Opiekunowie:
- Debian Perl Group (Strona QA, Archiwum e-mail)
- gregor herrmann (Strona QA)
- Damyan Ivanov (Strona QA)
Zasoby zewnętrzne:
- Strona internetowa [metacpan.org]
Podobne pakiety:
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.
Inne pakiety związane z libtree-redblack-perl
|
|
|
|
-
- dep: perl
- praktyczny język ekstrakcji i raportowania Larry'ego Walla
Pobieranie libtree-redblack-perl
Architektura | Rozmiar pakietu | Rozmiar po instalacji | Pliki |
---|---|---|---|
all | 13,5 KiB | 41,0 KiB | [lista plików] |