]>
Commit | Line | Data |
---|---|---|
4eef7744 | 1 | %include /usr/lib/rpm/macros.perl |
c1d5c9a3 | 2 | %define pdir Tree |
3 | %define pnam Trie | |
e00e16ae | 4 | Summary: Tree::Trie - An implementation of the Trie data structure in Perl |
c2c4c98d | 5 | Summary(pl): Tree::Trie - perlowa implementacja struktury danych Trie |
fe4f5817 | 6 | Name: perl-Tree-Trie |
6d81625c | 7 | Version: 0.4 |
8a2d8bad | 8 | Release: 4 |
8bbfd769 | 9 | License: GPL |
fe4f5817 | 10 | Group: Development/Languages/Perl |
41e8dd60 | 11 | Source0: http://www.cpan.org/modules/by-module/%{pdir}/%{pdir}-%{pnam}-%{version}.tar.gz |
fcdb3eaa | 12 | # Source0-md5: b57755b32921ee3ccf10869be8cc4b5e |
58cc7a13 | 13 | BuildRequires: perl-devel >= 5.6 |
8a2d8bad | 14 | BuildRequires: rpm-perlprov >= 4.1-13 |
e5d9bc5a | 15 | BuildArch: noarch |
550d67c8 | 16 | BuildRoot: %{tmpdir}/%{name}-%{version}-root-%(id -u -n) |
fe4f5817 | 17 | |
18 | %description | |
c2c4c98d JB |
19 | This module implements a trie data structure. The term "trie" comes |
20 | from the word re*trie*val, but is generally pronounced like "try". A | |
21 | trie is a tree structure (or directed acyclic graph), the nodes of | |
22 | which represent letters in a word. For example, the final lookup for | |
23 | the word 'bob' would look something like | |
24 | $ref->{'b'}{'o'}{'b'}{HASH(0x80c6bbc)} (the HASH being an end | |
25 | marker). Only nodes which would represent words in the trie exist, | |
26 | making the structure slightly smaller than a hash of the same data | |
27 | set. | |
28 | ||
29 | %description -l pl | |
30 |