- Name: perl-data-trie
- Version: 0.01
- Release: 2mdv2007.0
- Epoch:
- Group: Development/Perl
- License: GPL
- Url: http://search.cpan.org/dist/data-trie
- Summary: An implementation of a letter trie
- Architecture: noarch
- Size: 6958
- Distribution: Mandriva Linux
- Vendor: Mandriva
- Packager: Guillaume Rousse <guillomovitch@mandriva.org>
Description:
This module implements a letter trie data structure. This is a linked set of
nodes representing a set of words. Starting from the root, each letter of an
included word is a daughter node of the trie. Hence, if a word is in the trie,
there will be a path from root to leaf for that word. If a word is not in the
trie, there will be no such path.
This structure allows for a relatively compact representation of a set of
words. This particular implementation allows each word to be stored alone or
with some associated data item.
Note that the remove() method does not prune nodes and thus a Trie can only
grow in size.
- OptFlags: -O2 -g -pipe -Wp,-D_FORTIFY_SOURCE=2 -fexceptions -fomit-frame-pointer -march=i586 -mtune=pentiumpro -fasynchronous-unwind-tables
- Cookie: n2.mandriva.com 1157017413
- Buildhost: n2.mandriva.com
