From 1b93fa6644c85f524fd463fd19a45260f502e24c Mon Sep 17 00:00:00 2001 From: CoprDistGit Date: Mon, 10 Apr 2023 22:52:54 +0000 Subject: automatic import of python-pyxdameraulevenshtein --- .gitignore | 1 + python-pyxdameraulevenshtein.spec | 75 +++++++++++++++++++++++++++++++++++++++ sources | 1 + 3 files changed, 77 insertions(+) create mode 100644 python-pyxdameraulevenshtein.spec create mode 100644 sources diff --git a/.gitignore b/.gitignore index e69de29..ec56708 100644 --- a/.gitignore +++ b/.gitignore @@ -0,0 +1 @@ +/pyxDamerauLevenshtein-1.7.1.tar.gz diff --git a/python-pyxdameraulevenshtein.spec b/python-pyxdameraulevenshtein.spec new file mode 100644 index 0000000..b1d1218 --- /dev/null +++ b/python-pyxdameraulevenshtein.spec @@ -0,0 +1,75 @@ +%global _empty_manifest_terminate_build 0 +Name: python-pyxDamerauLevenshtein +Version: 1.7.1 +Release: 1 +Summary: pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. +License: BSD 3-Clause License +URL: https://github.com/lanl/pyxDamerauLevenshtein +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/4c/37/fefa8524e61f513a26e2aa7224c5bbed0e4ff1b1bd713e69d5866550d170/pyxDamerauLevenshtein-1.7.1.tar.gz +BuildArch: noarch + + +%description +pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. Courtesy `Wikipedia `_: In information theory and computer science, the Damerau-Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters. This implementation is based on `Michael Homer's pure Python implementation `_, which implements the `optimal string alignment distance algorithm `_. It runs in ``O(N*M)`` time using ``O(M)`` space. It supports unicode characters. For more information on pyxDamerauLevenshtein, visit the `GitHub project page `_. + + +%package -n python3-pyxDamerauLevenshtein +Summary: pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. +Provides: python-pyxDamerauLevenshtein +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-pyxDamerauLevenshtein +pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. Courtesy `Wikipedia `_: In information theory and computer science, the Damerau-Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters. This implementation is based on `Michael Homer's pure Python implementation `_, which implements the `optimal string alignment distance algorithm `_. It runs in ``O(N*M)`` time using ``O(M)`` space. It supports unicode characters. For more information on pyxDamerauLevenshtein, visit the `GitHub project page `_. + + +%package help +Summary: Development documents and examples for pyxDamerauLevenshtein +Provides: python3-pyxDamerauLevenshtein-doc +%description help +pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance. Courtesy `Wikipedia `_: In information theory and computer science, the Damerau-Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a "distance" (string metric) between two strings, i.e., finite sequence of symbols, given by counting the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters. This implementation is based on `Michael Homer's pure Python implementation `_, which implements the `optimal string alignment distance algorithm `_. It runs in ``O(N*M)`` time using ``O(M)`` space. It supports unicode characters. For more information on pyxDamerauLevenshtein, visit the `GitHub project page `_. + + +%prep +%autosetup -n pyxDamerauLevenshtein-1.7.1 + +%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-pyxDamerauLevenshtein -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Mon Apr 10 2023 Python_Bot - 1.7.1-1 +- Package Spec generated diff --git a/sources b/sources new file mode 100644 index 0000000..8bbf1d2 --- /dev/null +++ b/sources @@ -0,0 +1 @@ +159447e01435c0fb1fe40232be983573 pyxDamerauLevenshtein-1.7.1.tar.gz -- cgit v1.2.3