automatic import of python-inexactsearchopeneuler20.03

3 files changed, 164 insertions, 0 deletions

diff --git a/.gitignore b/.gitignore
index e69de29..b1f372c 100644
--- a/.gitignore
+++ b/.gitignore
@@ -0,0 +1 @@
+/inexactsearch-1.0.2.tar.gz
diff --git a/python-inexactsearch.spec b/python-inexactsearch.spec
new file mode 100644
index 0000000..c2aa3ba
--- /dev/null
+++ b/python-inexactsearch.spec
@@ -0,0 +1,162 @@
+%global _empty_manifest_terminate_build 0
+Name:		python-inexactsearch
+Version:	1.0.2
+Release:	1
+Summary:	Fuzzy String search algorithm using Soundex for Indian language
+License:	LGPL-2.1+
+URL:		https://github.com/Project-SILPA/inexactsearch
+Source0:	https://mirrors.nju.edu.cn/pypi/web/packages/45/23/0b398af4295da99c5ab69d7b0bff36a2cb68e260a65f64717c17f6a20035/inexactsearch-1.0.2.tar.gz
+BuildArch:	noarch
+
+
+%description
+Approximate String Search
+###########################
+
+.. image::
+   https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
+   :target: https://travis-ci.org/Project-SILPA/inexactsearch
+
+	    
+.. image::
+   https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
+  :target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
+
+
+This is a `Fuzzy string search
+<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
+application. This application illustrates the combined use of `Edit
+distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
+`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
+
+By mixing both written like(edit distance) and sounds like(soundex),
+we achieve an efficient aproximate string searching. This application
+is capable of cross language string search too. That means, you can
+search Hindi words in Malayalam text. If there is any Malayalam word,
+which is approximate transliteration of hindi word, or sounds alike
+the hindi words, it will be returned as an approximate match. The
+"written like" algorithm used here is a bigram average algorithm.  The
+ratio of common bigrams in two strings and average number of bigrams
+will give a factor which is greater than zero and less
+than 1. Similarly the soundex algorithm also gives a weight. By
+selecting words which has comparison weight more than the threshold
+weight(which 0.6), we get the search results.
+
+%package -n python3-inexactsearch
+Summary:	Fuzzy String search algorithm using Soundex for Indian language
+Provides:	python-inexactsearch
+BuildRequires:	python3-devel
+BuildRequires:	python3-setuptools
+BuildRequires:	python3-pip
+%description -n python3-inexactsearch
+Approximate String Search
+###########################
+
+.. image::
+   https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
+   :target: https://travis-ci.org/Project-SILPA/inexactsearch
+
+	    
+.. image::
+   https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
+  :target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
+
+
+This is a `Fuzzy string search
+<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
+application. This application illustrates the combined use of `Edit
+distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
+`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
+
+By mixing both written like(edit distance) and sounds like(soundex),
+we achieve an efficient aproximate string searching. This application
+is capable of cross language string search too. That means, you can
+search Hindi words in Malayalam text. If there is any Malayalam word,
+which is approximate transliteration of hindi word, or sounds alike
+the hindi words, it will be returned as an approximate match. The
+"written like" algorithm used here is a bigram average algorithm.  The
+ratio of common bigrams in two strings and average number of bigrams
+will give a factor which is greater than zero and less
+than 1. Similarly the soundex algorithm also gives a weight. By
+selecting words which has comparison weight more than the threshold
+weight(which 0.6), we get the search results.
+
+%package help
+Summary:	Development documents and examples for inexactsearch
+Provides:	python3-inexactsearch-doc
+%description help
+Approximate String Search
+###########################
+
+.. image::
+   https://travis-ci.org/Project-SILPA/inexactsearch.svg?branch=master
+   :target: https://travis-ci.org/Project-SILPA/inexactsearch
+
+	    
+.. image::
+   https://coveralls.io/repos/Project-SILPA/inexactsearch/badge.png?branch=master
+  :target: https://coveralls.io/r/Project-SILPA/inexactsearch?branch=master
+
+
+This is a `Fuzzy string search
+<http://en.wikipedia.org/wiki/Fuzzy_string_searching>`_
+application. This application illustrates the combined use of `Edit
+distance <http://en.wikipedia.org/wiki/Levenshtein_distance>`_ and
+`Indic Soundex <http://silpa.org.in/Soundex>`_ algorithm.
+
+By mixing both written like(edit distance) and sounds like(soundex),
+we achieve an efficient aproximate string searching. This application
+is capable of cross language string search too. That means, you can
+search Hindi words in Malayalam text. If there is any Malayalam word,
+which is approximate transliteration of hindi word, or sounds alike
+the hindi words, it will be returned as an approximate match. The
+"written like" algorithm used here is a bigram average algorithm.  The
+ratio of common bigrams in two strings and average number of bigrams
+will give a factor which is greater than zero and less
+than 1. Similarly the soundex algorithm also gives a weight. By
+selecting words which has comparison weight more than the threshold
+weight(which 0.6), we get the search results.
+
+%prep
+%autosetup -n inexactsearch-1.0.2
+
+%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-inexactsearch -f filelist.lst
+%dir %{python3_sitelib}/*
+
+%files help -f doclist.lst
+%{_docdir}/*
+
+%changelog
+* Fri May 05 2023 Python_Bot <Python_Bot@openeuler.org> - 1.0.2-1
+- Package Spec generated
diff --git a/sources b/sources
new file mode 100644
index 0000000..fc75cd1
--- /dev/null
+++ b/sources
@@ -0,0 +1 @@
+99d81c289383751922ff5c3155b2f219  inexactsearch-1.0.2.tar.gz