Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help | Search |
Name: perl-data-trie | Distribution: Mageia |
Version: 0.10.0 | Vendor: Mageia.Org |
Release: 10.mga8 | Build date: Wed Feb 12 05:26:11 2020 |
Group: Development/Perl | Build host: localhost |
Size: 6313 | Source RPM: perl-data-trie-0.10.0-10.mga8.src.rpm |
Packager: umeabot <umeabot> | |
Url: http://search.cpan.org/dist/data-trie | |
Summary: An implementation of a letter trie |
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.
GPL
* Wed Feb 12 2020 umeabot <umeabot> 0.10.0-10.mga8 + Revision: 1493794 - Mageia 8 Mass Rebuild + wally <wally> - replace deprecated %makeinstall_std * Wed Sep 19 2018 umeabot <umeabot> 0.10.0-9.mga7 + Revision: 1267019 - Mageia 7 Mass Rebuild
/usr/share/doc/perl-data-trie /usr/share/doc/perl-data-trie/README /usr/share/man/man3/Data::Trie.3pm.xz /usr/share/perl5/vendor_perl/Data /usr/share/perl5/vendor_perl/Data/Trie.pm
Generated by rpm2html 1.8.1
Fabrice Bellet, Sun Mar 9 11:24:54 2025