%global pkg_name        String-LCSS_XS
%global pkg_version     0.4
%global rpm_pkg_version 0.4
%global rpm_pkg_release 1.n0i.3

Summary:       Find The Longest Common Substring of Two Strings
Name:          perl-%{pkg_name}
Version:       %{rpm_pkg_version}
Release:       %{rpm_pkg_release}%{?cpan_version}%{?dist}

Group:         Development/Libraries
License:       GPL+ or Artistic
URL:           http://search.cpan.org/dist/%{pkg_name}/
Source0:       http://www.cpan.org/modules/by-module/String/%{pkg_name}-%{pkg_version}.tar.gz

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


%description
String::LCSS_XS computes the Longest Common Substring of two strings.

It is a C implementation of String::LCSS and uses a dynamic programming
algorithm with both runtime and memory usage of O(mn).


%prep
%setup -q -n %{pkg_name}-%{pkg_version}


%build
%{perl_build}


%install
%{__rm} -rf %{buildroot}
%{perl_install}


%clean
%{__rm} -rf %{buildroot}


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


%changelog
* Sun Nov 25 2007 Marius Feraru <altblue@n0i.net> - 0.4-1.n0i.3
- version 0.4

* Sat Nov 24 2007 Marius Feraru <altblue@n0i.net> - 0.3-1.n0i.2
- version 0.3

* Thu Nov 22 2007 Marius Feraru <altblue@n0i.net> - 0.2-1.n0i.1
- initial packaging