%global _empty_manifest_terminate_build 0 Name: python-edit-distance Version: 1.0.6 Release: 1 Summary: Computing edit distance on arbitrary Python sequences. License: LICENSE.txt URL: https://github.com/belambert/editdistance Source0: https://mirrors.aliyun.com/pypi/web/packages/16/b2/27b30ff8c251012789f0976de74a5b497a03ab259c7ae2b08502b81618bb/edit_distance-1.0.6.tar.gz BuildArch: noarch %description ![build](https://github.com/belambert/edit-distance/actions/workflows/build.yml/badge.svg) [![PyPI version](https://badge.fury.io/py/Edit_Distance.svg)](https://badge.fury.io/py/Edit_Distance) [![codecov](https://codecov.io/gh/belambert/edit-distance/branch/main/graph/badge.svg?token=43c8bYhWeL)](https://codecov.io/gh/belambert/edit-distance) Python module for computing edit distances and alignments between sequences. I needed a way to compute edit distances between sequences in Python. I wasn't able to find any appropriate libraries that do this so I wrote my own. There appear to be numerous edit distance libraries available for computing edit distances between two strings, but not between two sequences. This is written entirely in Python. This implementation could likely be optimized to be faster within Python. And could probably be much faster if implemented in C. The library API is modeled after difflib.SequenceMatcher. This is very similar to difflib, except that this module computes edit distance (Levenshtein distance) rather than the Ratcliff and Oberhelp method that Python's difflib uses. difflib "does not yield minimal edit sequences, but does tend to yield matches that 'look right' to people." If you find this library useful or have any suggestions, please send me a message. %package -n python3-edit-distance Summary: Computing edit distance on arbitrary Python sequences. Provides: python-edit-distance BuildRequires: python3-devel BuildRequires: python3-setuptools BuildRequires: python3-pip %description -n python3-edit-distance ![build](https://github.com/belambert/edit-distance/actions/workflows/build.yml/badge.svg) [![PyPI version](https://badge.fury.io/py/Edit_Distance.svg)](https://badge.fury.io/py/Edit_Distance) [![codecov](https://codecov.io/gh/belambert/edit-distance/branch/main/graph/badge.svg?token=43c8bYhWeL)](https://codecov.io/gh/belambert/edit-distance) Python module for computing edit distances and alignments between sequences. I needed a way to compute edit distances between sequences in Python. I wasn't able to find any appropriate libraries that do this so I wrote my own. There appear to be numerous edit distance libraries available for computing edit distances between two strings, but not between two sequences. This is written entirely in Python. This implementation could likely be optimized to be faster within Python. And could probably be much faster if implemented in C. The library API is modeled after difflib.SequenceMatcher. This is very similar to difflib, except that this module computes edit distance (Levenshtein distance) rather than the Ratcliff and Oberhelp method that Python's difflib uses. difflib "does not yield minimal edit sequences, but does tend to yield matches that 'look right' to people." If you find this library useful or have any suggestions, please send me a message. %package help Summary: Development documents and examples for edit-distance Provides: python3-edit-distance-doc %description help ![build](https://github.com/belambert/edit-distance/actions/workflows/build.yml/badge.svg) [![PyPI version](https://badge.fury.io/py/Edit_Distance.svg)](https://badge.fury.io/py/Edit_Distance) [![codecov](https://codecov.io/gh/belambert/edit-distance/branch/main/graph/badge.svg?token=43c8bYhWeL)](https://codecov.io/gh/belambert/edit-distance) Python module for computing edit distances and alignments between sequences. I needed a way to compute edit distances between sequences in Python. I wasn't able to find any appropriate libraries that do this so I wrote my own. There appear to be numerous edit distance libraries available for computing edit distances between two strings, but not between two sequences. This is written entirely in Python. This implementation could likely be optimized to be faster within Python. And could probably be much faster if implemented in C. The library API is modeled after difflib.SequenceMatcher. This is very similar to difflib, except that this module computes edit distance (Levenshtein distance) rather than the Ratcliff and Oberhelp method that Python's difflib uses. difflib "does not yield minimal edit sequences, but does tend to yield matches that 'look right' to people." If you find this library useful or have any suggestions, please send me a message. %prep %autosetup -n edit_distance-1.0.6 %build %py3_build %install %py3_install install -d -m755 %{buildroot}/%{_pkgdocdir} if [ -d doc ]; then cp -arf doc %{buildroot}/%{_pkgdocdir}; fi if [ -d docs ]; then cp -arf docs %{buildroot}/%{_pkgdocdir}; fi if [ -d example ]; then cp -arf example %{buildroot}/%{_pkgdocdir}; fi if [ -d examples ]; then cp -arf examples %{buildroot}/%{_pkgdocdir}; fi pushd %{buildroot} if [ -d usr/lib ]; then find usr/lib -type f -printf "\"/%h/%f\"\n" >> filelist.lst fi if [ -d usr/lib64 ]; then find usr/lib64 -type f -printf "\"/%h/%f\"\n" >> filelist.lst fi if [ -d usr/bin ]; then find usr/bin -type f -printf "\"/%h/%f\"\n" >> filelist.lst fi if [ -d usr/sbin ]; then find usr/sbin -type f -printf "\"/%h/%f\"\n" >> filelist.lst fi touch doclist.lst if [ -d usr/share/man ]; then find usr/share/man -type f -printf "\"/%h/%f.gz\"\n" >> doclist.lst fi popd mv %{buildroot}/filelist.lst . mv %{buildroot}/doclist.lst . %files -n python3-edit-distance -f filelist.lst %dir %{python3_sitelib}/* %files help -f doclist.lst %{_docdir}/* %changelog * Thu Jun 08 2023 Python_Bot - 1.0.6-1 - Package Spec generated