Package : perl-Tree-Trie > RPM : perl-Tree-Trie-1.900.0-12.mga7.src.rpm
Basic items
| Name | perl-Tree-Trie |
| Version | 1.900.0 |
| Release | 12.mga7 |
| URL | http://search.cpan.org/dist/Tree-Trie |
| Group | Development/Perl |
| Summary | A data structure optimized for prefix lookup |
| Size | 46KB |
| Arch | noarch |
| License | GPL |
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.
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.
Media information
| Distribution release | Mageia 7 |
| Media name | core-release |
| Media arch | i586 |
Advanced items
| Source RPM | NOT IN DATABASE ?! |
| Build time | 2018-09-20 16:17:26 |
| Changelog | View in Sophie |
| Files | View in Sophie |
| Dependencies | View in Sophie |