- Name: perl-Tree-Trie
- Version: 0.4
- Release: 3
- Epoch:
- Group: Development/Languages/Perl
- License: GPL
- Url:
- Summary: Tree::Trie - An implementation of the Trie data structure in Perl
- Architecture: noarch
- Size: 12524
- Distribution: PLD 1.0 (Ra)
- Vendor: PLD
- Packager: PLD bug tracking system ( http://bugs.pld.org.pl/ )
Description:
This module implements a trie data structure. The term "trie" comes
from the word re*trie*val, but is generally pronounced like "try". A
trie is a tree structure (or directed acyclic graph), the nodes of
which represent letters in a word. For example, the final lookup for
the word 'bob' would look something like
$ref->{'b'}{'o'}{'b'}{HASH(0x80c6bbc)} (the HASH being an end
marker). Only nodes which would represent words in the trie exist,
making the structure slightly smaller than a hash of the same data
set.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: ep09.kernel.pl 1029571035
- Buildhost: ep09.kernel.pl
Generated packages:
- perl-Tree-Trie-0.4-3.noarch
- perl-Tree-Trie-0.4-3.noarch
- perl-Tree-Trie-0.4-3.noarch
- perl-Tree-Trie-0.4-3.noarch
- perl-Tree-Trie-0.4-3.noarch
- perl-Tree-Trie-0.4-3.noarch
Other version of this rpm:
