summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCoprDistGit <infra@openeuler.org>2023-05-18 05:03:01 +0000
committerCoprDistGit <infra@openeuler.org>2023-05-18 05:03:01 +0000
commitbdfa959521725642739d98cf57fca7e4e75fc560 (patch)
tree3abc405e6336f93bc5fb9488d35bd87a6d0adb1e
parent0e4d6a67f018c70d90374f7aad91f85077a5a545 (diff)
automatic import of python-hash-ring
-rw-r--r--.gitignore1
-rw-r--r--python-hash-ring.spec108
-rw-r--r--sources1
3 files changed, 110 insertions, 0 deletions
diff --git a/.gitignore b/.gitignore
index e69de29..e2c7c95 100644
--- a/.gitignore
+++ b/.gitignore
@@ -0,0 +1 @@
+/hash_ring-1.3.1.tar.gz
diff --git a/python-hash-ring.spec b/python-hash-ring.spec
new file mode 100644
index 0000000..afae742
--- /dev/null
+++ b/python-hash-ring.spec
@@ -0,0 +1,108 @@
+%global _empty_manifest_terminate_build 0
+Name: python-hash_ring
+Version: 1.3.1
+Release: 1
+Summary: Implements consistent hashing in Python (using md5 as hashing function).
+License: BSD
+URL: http://www.amix.dk/
+Source0: https://mirrors.nju.edu.cn/pypi/web/packages/32/f1/798501920f7043d93707ccd902e7d9a0cfb68efc8d8051c16a3f8ee6c64f/hash_ring-1.3.1.tar.gz
+BuildArch: noarch
+
+
+%description
+Implements consistent hashing that can be used when
+the number of server nodes can increase or decrease (like in memcached).
+The hashing ring is built using the same algorithm as libketama.
+Consistent hashing is a scheme that provides a hash table functionality
+in a way that the adding or removing of one slot
+does not significantly change the mapping of keys to slots.
+More about hash_ring can be read in a blog post (that explains the idea in greater details):
+* Consistent hashing implemented simply in python <http://amix.dk/blog/viewEntry/19367>
+More information about consistent hashing can be read in these articles:
+* Web Caching with Consistent Hashing <http://www8.org/w8-papers/2a-webserver/caching/paper2.html>
+* Consistent hashing and random trees <http://citeseerx.ist.psu.edu/legacymapper?did=38148>
+There is also a wrapper MemcacheRing that extends python-memcache to use consistent hashing
+for key distribution.
+
+%package -n python3-hash_ring
+Summary: Implements consistent hashing in Python (using md5 as hashing function).
+Provides: python-hash_ring
+BuildRequires: python3-devel
+BuildRequires: python3-setuptools
+BuildRequires: python3-pip
+%description -n python3-hash_ring
+Implements consistent hashing that can be used when
+the number of server nodes can increase or decrease (like in memcached).
+The hashing ring is built using the same algorithm as libketama.
+Consistent hashing is a scheme that provides a hash table functionality
+in a way that the adding or removing of one slot
+does not significantly change the mapping of keys to slots.
+More about hash_ring can be read in a blog post (that explains the idea in greater details):
+* Consistent hashing implemented simply in python <http://amix.dk/blog/viewEntry/19367>
+More information about consistent hashing can be read in these articles:
+* Web Caching with Consistent Hashing <http://www8.org/w8-papers/2a-webserver/caching/paper2.html>
+* Consistent hashing and random trees <http://citeseerx.ist.psu.edu/legacymapper?did=38148>
+There is also a wrapper MemcacheRing that extends python-memcache to use consistent hashing
+for key distribution.
+
+%package help
+Summary: Development documents and examples for hash_ring
+Provides: python3-hash_ring-doc
+%description help
+Implements consistent hashing that can be used when
+the number of server nodes can increase or decrease (like in memcached).
+The hashing ring is built using the same algorithm as libketama.
+Consistent hashing is a scheme that provides a hash table functionality
+in a way that the adding or removing of one slot
+does not significantly change the mapping of keys to slots.
+More about hash_ring can be read in a blog post (that explains the idea in greater details):
+* Consistent hashing implemented simply in python <http://amix.dk/blog/viewEntry/19367>
+More information about consistent hashing can be read in these articles:
+* Web Caching with Consistent Hashing <http://www8.org/w8-papers/2a-webserver/caching/paper2.html>
+* Consistent hashing and random trees <http://citeseerx.ist.psu.edu/legacymapper?did=38148>
+There is also a wrapper MemcacheRing that extends python-memcache to use consistent hashing
+for key distribution.
+
+%prep
+%autosetup -n hash_ring-1.3.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-hash_ring -f filelist.lst
+%dir %{python3_sitelib}/*
+
+%files help -f doclist.lst
+%{_docdir}/*
+
+%changelog
+* Thu May 18 2023 Python_Bot <Python_Bot@openeuler.org> - 1.3.1-1
+- Package Spec generated
diff --git a/sources b/sources
new file mode 100644
index 0000000..ee6b396
--- /dev/null
+++ b/sources
@@ -0,0 +1 @@
+16905a5bc16927a03a1ec29f7f762649 hash_ring-1.3.1.tar.gz