| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
| Name: perl-Tree-Trie | Distribution: Mageia |
| Version: 1.900.0 | Vendor: Mageia.Org |
| Release: 14.mga9 | Build date: Mon Mar 21 03:21:31 2022 |
| Group: Development/Perl | Build host: localhost |
| Size: 49315 | Source RPM: perl-Tree-Trie-1.900.0-14.mga9.src.rpm |
| Packager: umeabot <umeabot> | |
| Url: https://metacpan.org/release/Tree-Trie | |
| Summary: A data structure optimized for prefix lookup | |
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.
GPL
* Mon Mar 21 2022 umeabot <umeabot> 1.900.0-14.mga9 + Revision: 1810561 - Mageia 9 Mass Rebuild
/usr/share/doc/perl-Tree-Trie /usr/share/doc/perl-Tree-Trie/Changes /usr/share/doc/perl-Tree-Trie/META.yml /usr/share/doc/perl-Tree-Trie/MYMETA.yml /usr/share/doc/perl-Tree-Trie/README /usr/share/man/man3/Tree::Trie.3pm.xz /usr/share/perl5/vendor_perl/Tree /usr/share/perl5/vendor_perl/Tree/Trie.pm
Generated by rpm2html 1.8.1
Fabrice Bellet, Wed Jan 22 09:05:03 2025