%global _empty_manifest_terminate_build 0 Name: python-simplebloom Version: 1.0.4 Release: 1 Summary: A dumb but fast bloom filter. License: MIT URL: https://pypi.org/project/simplebloom/ Source0: https://mirrors.nju.edu.cn/pypi/web/packages/ee/dc/010b6cb1262b2f223acdf7262130857b64c2711dd85935459762b739adda/simplebloom-1.0.4.tar.gz %description simplebloom is a (probably) dumb but fast bloom filter. To quote `Wikipedia `_: A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed [...]; the more items added, the larger the probability of false positives. The included ``BloomFilter`` class is quite dumb as it's fixed size, only supports strings, and always uses the blake2s hash function included with Python 3.6+. But at least it's fast, hey? %package -n python3-simplebloom Summary: A dumb but fast bloom filter. Provides: python-simplebloom BuildRequires: python3-devel BuildRequires: python3-setuptools BuildRequires: python3-pip BuildRequires: python3-cffi BuildRequires: gcc BuildRequires: gdb %description -n python3-simplebloom simplebloom is a (probably) dumb but fast bloom filter. To quote `Wikipedia `_: A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed [...]; the more items added, the larger the probability of false positives. The included ``BloomFilter`` class is quite dumb as it's fixed size, only supports strings, and always uses the blake2s hash function included with Python 3.6+. But at least it's fast, hey? %package help Summary: Development documents and examples for simplebloom Provides: python3-simplebloom-doc %description help simplebloom is a (probably) dumb but fast bloom filter. To quote `Wikipedia `_: A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed [...]; the more items added, the larger the probability of false positives. The included ``BloomFilter`` class is quite dumb as it's fixed size, only supports strings, and always uses the blake2s hash function included with Python 3.6+. But at least it's fast, hey? %prep %autosetup -n simplebloom-1.0.4 %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-simplebloom -f filelist.lst %dir %{python3_sitearch}/* %files help -f doclist.lst %{_docdir}/* %changelog * Fri May 05 2023 Python_Bot - 1.0.4-1 - Package Spec generated