| Name : perl-Tree-Trie
| |
| Version : 0.4
| Vendor : PLD
|
| Release : 3
| Date : 2002-08-17 09:57:15
|
| Group : Development/Languages/perl
| Source RPM : perl-Tree-Trie-0.4-3.src.rpm
|
| Size : 0.02 MB
| |
| Packager : PLD bug tracking system ( http://bugs_pld_org_pl/ )
| |
| Summary : Tree::Trie - An implementation of the Trie data structure in Perl
|
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.
|
RPM found in directory: /vol/rzm3/linux-pld/dists/ra/PLD/i386/PLD/RPMS |
