%define pkg_name        Algorithm-Combinatorics
%define pkg_version     0.24
%define rpm_pkg_version 0.24
%define rpm_pkg_release 1.n0i.6


Summary:       Efficient generation of combinatorial sequences
Name:          perl-%{pkg_name}
Version:       %{rpm_pkg_version}
Release:       %{rpm_pkg_release}%{?cpan_version}%{?dist}

Group:         Development/Libraries
License:       Artistic
URL:           http://search.cpan.org/dist/%{pkg_name}/
Source0:       http://www.cpan.org/authors/id/F/FX/FXN/%{pkg_name}-%{pkg_version}.tar.gz


BuildRoot:     %{_tmppath}/%{name}-%{version}-%{release}-root-%(%{__id_u} -n)
BuildRequires: reb00t-rpmdevtools

BuildRequires: perl(ExtUtils::MakeMaker)
%{!?_without_test:BuildRequires: perl(FindBin)}
%{!?_without_test:BuildRequires: perl(Scalar::Util)}
%{!?_without_test:BuildRequires: perl(Test::More)}
%{!?_without_test:BuildRequires: perl(XSLoader)}


%description
Algorithm::Combinatorics is an efficient generator of combinatorial
sequences. Algorithms are selected from the literature. Iterators do not
use recursion, nor stacks, and are written in C. Tuples are generated in
lexicographic order.


%prep
%setup -q -n %{pkg_name}-%{pkg_version}
%{fix_perl_path benchmarks/}


%build
%{perl_build}
%{!?_without_test:%{__make} test}


%install
%{__rm} -rf $RPM_BUILD_ROOT
%{perl_install}


%clean
%{__rm} -rf $RPM_BUILD_ROOT


%files
%defattr(-,root,root,-)
%{perl_files}
%doc benchmarks/ Changes README


%changelog
* Wed Aug 01 2007 Marius Feraru <altblue@n0i.net> - 0.24-1.n0i.6
- version 0.24

* Tue May 22 2007 Marius Feraru <altblue@n0i.net> - 0.23-1.n0i.5
- version 0.23

* Wed Jun 28 2006 Marius Feraru <altblue@n0i.net> - 0.20-1.n0i.4
- version 0.20

* Tue Jun 06 2006 Marius Feraru <altblue@n0i.net> - 0.16-1.n0i.3
- version 0.16

* Wed May 24 2006 Marius Feraru <altblue@n0i.net> - 0.15-1.n0i.2
- version 0.15

* Wed May 03 2006 Marius Feraru <altblue@n0i.net> 0.14-1.n0i.1
- spec file (re)created using N0i::CPAN::RPMizer v1.12.1
- rebuild on perl 5.8.8