| Name : perl-Tree-Trie
| |
| Version : 1.900.0
| Vendor : Mageia_Org
|
| Release : 13.mga8
| Date : 2020-02-12 15:24:12
|
| Group : Development/Perl
| Source RPM : perl-Tree-Trie-1.900.0-13.mga8.src.rpm
|
| Size : 0.05 MB
| |
| Packager : umeabot < umeabot>
| |
| 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.
|
RPM found in directory: /vol/rzm3/linux-mageia/distrib/8/i586/media/core/release |
