1 |
slords |
1.5 |
# $Id$ |
2 |
|
|
# # Authority: slords |
3 |
|
|
# Name: Shad L. Lords |
4 |
|
|
|
5 |
slords |
1.1 |
%define name python-Levenshtein |
6 |
|
|
%define version 0.10.1 |
7 |
|
|
%define release 1 |
8 |
|
|
|
9 |
|
|
Summary: Python extension computing string distances and similarities. |
10 |
|
|
Name: %{name} |
11 |
|
|
Version: %{version} |
12 |
|
|
Release: %{release}%{?dist} |
13 |
|
|
Source0: %{name}-%{version}.tar.gz |
14 |
|
|
License: GNU GPL |
15 |
|
|
Group: Development/Libraries |
16 |
|
|
BuildRoot: %{_tmppath}/%{name}-buildroot |
17 |
|
|
Prefix: %{_prefix} |
18 |
|
|
Vendor: Trific soft. |
19 |
|
|
Url: http://trific.ath.cx/python/levenshtein/ |
20 |
slords |
1.4 |
BuildRequires: python-devel |
21 |
slords |
1.1 |
|
22 |
|
|
%description |
23 |
|
|
|
24 |
|
|
Levenshtein computes Levenshtein distances, similarity ratios, generalized |
25 |
|
|
medians and set medians of Strings and Unicodes. Becuase it's implemented |
26 |
|
|
in C, it's much faster than corresponding Python library functions and |
27 |
|
|
methods. |
28 |
|
|
|
29 |
|
|
|
30 |
|
|
%prep |
31 |
|
|
%setup |
32 |
|
|
|
33 |
|
|
%build |
34 |
|
|
env CFLAGS="$RPM_OPT_FLAGS" python setup.py build |
35 |
|
|
|
36 |
|
|
%install |
37 |
|
|
python setup.py install --root=$RPM_BUILD_ROOT --record=INSTALLED_FILES |
38 |
|
|
|
39 |
|
|
%clean |
40 |
|
|
rm -rf $RPM_BUILD_ROOT |
41 |
|
|
|
42 |
|
|
%files -f INSTALLED_FILES |
43 |
|
|
%defattr(-,root,root) |
44 |
|
|
%doc README COPYING NEWS |