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