- Name: perl-Tree-Trie
- Version: 1.1
- Release: 1
- Epoch: 0
- Group: Development/Languages/Perl
- License: GPL v1+ or Artistic
- Url:
- Summary: Tree::Trie - an implementation of the Trie data structure in Perl
- Architecture: noarch
- Size: 21157
- Distribution: PLD 2.0 (Ac)
- Vendor: PLD
- Packager: PLD bug tracking system ( http://bugs.pld-linux.org/ )
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-pld 1115253641
- Buildhost: ep09-pld
Generated packages:
Other version of this rpm:
