Package : perl-Tree-Trie
Package details
Summary: A data structure optimized for prefix lookup
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.
URL: http://search.cpan.org/dist/Tree-Trie
License: GPL
Maintainer: nobody
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.
URL: http://search.cpan.org/dist/Tree-Trie
License: GPL
Maintainer: nobody
List of RPMs
- perl-Tree-Trie-1.900.0-9.mga6.src.rpm (Mageia 6, x86_64 media, core-release)