projects / packages / perl-Algorithm-Huffman.git / blame
| Commit | Line | Data |
|---|---|---|
| ba5ab7fb | 1 | # |
| 2 | # Conditional build: | |
| 3 | # _without_tests - do not perform "make test" | |
| 4 | %include /usr/lib/rpm/macros.perl | |
| 5 | %define pdir Algorithm | |
| 6 | %define pnam Huffman | |
| 7 | Summary: Algorithm::Huffman - Implementation of the Huffman algorithm | |
| 8 | Summary(pl): Algorithm::Huffman - Implementacja algorytmu Huffmana | |
| 9 | Name: perl-Algorithm-Huffman | |
| 1ae46610 | 10 | Version: 0.09 |
| 2a8a7f7d | 11 | Release: 2 |
| ba5ab7fb | 12 | License: GPL/Artistic |
| 13 | Group: Development/Languages/Perl | |
| 866e6d14 | 14 | Source0: http://www.cpan.org/modules/by-module/%{pdir}/%{pdir}-%{pnam}-%{version}.tar.gz |
| 18f8b316 | 15 | # Source0-md5: dd5c0360357dcb0807e9ac2e49b2e746 |
| 8da9d036 | 16 | BuildRequires: perl-devel >= 5.6 |
| ba5ab7fb | 17 | %if %{?_without_tests:0}%{!?_without_tests:1} |
| 18 | BuildRequires: perl-Heap | |
| 19 | BuildRequires: perl-Scalar-List-Utils | |
| 20 | BuildRequires: perl-String-Random | |
| 21 | BuildRequires: perl-Test-Exception | |
| 22 | BuildRequires: perl-Test-ManyParams | |
| 23 | BuildRequires: perl-Test-Simple | |
| 24 | BuildRequires: perl-Tree-DAG_Node | |
| 25 | %endif | |
| 2a8a7f7d | 26 | BuildRequires: rpm-perlprov >= 4.1-13 |
| ba5ab7fb | 27 | BuildArch: noarch |
| 28 | BuildRoot: %{tmpdir}/%{name}-%{version}-root-%(id -u -n) | |
| 29 | ||
| 30 | %description | |
| 31 | This modules implements the huffman algorithm. The aim is to create | |
| 32 | a good coding scheme for a given list of different characters (or even | |
| 33 | strings) and their occurence numbers. | |
| 34 | ||
| 399ba7aa JB |
35 | %description -l pl |
| 36 |