Paquet : libtree-redblack-perl (0.5-4)
Liens pour libtree-redblack-perl
Ressources Debian :
- Rapports de bogues
- Developer Information
- Journal des modifications Debian
- Fichier de licence
- Suivis des correctifs pour Debian
Télécharger le paquet source 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]
Responsables :
- Debian Perl Group (Page QA, Archive du courrier électronique)
- gregor herrmann (Page QA)
- Damyan Ivanov (Page QA)
Ressources externes :
- Page d'accueil [metacpan.org]
Paquets similaires :
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.
Autres paquets associés à libtree-redblack-perl
|
|
|
|
-
- dep: perl
- langage de rapports et d'extractions pratiques de Larry Wall
Télécharger libtree-redblack-perl
Architecture | Taille du paquet | Espace occupé une fois installé | Fichiers |
---|---|---|---|
all | 12,3 ko | 40,0 ko | [liste des fichiers] |