- Name: perl-Tree-Trie
- Version: 1.900.0
- Release: 3.mga3
- Epoch:
- Group: Development/Perl
- License: GPL
- Url: http://search.cpan.org/dist/Tree-Trie
- Summary: A data structure optimized for prefix lookup
- Architecture: noarch
- Size: 43518
- Distribution: Mageia
- Vendor: Mageia.Org
- Packager: umeabot <umeabot>
Description:
This module implements a trie data structure. The term "trie"
comes from the word retrieval, 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: rabbit.mageia.org 1358089036
- Buildhost: rabbit.mageia.org
Generated packages:
Other version of this rpm:
