diff options
| -rw-r--r-- | .gitignore | 1 | ||||
| -rw-r--r-- | python-bitsets.spec | 124 | ||||
| -rw-r--r-- | sources | 1 |
3 files changed, 126 insertions, 0 deletions
@@ -0,0 +1 @@ +/bitsets-0.8.4.zip diff --git a/python-bitsets.spec b/python-bitsets.spec new file mode 100644 index 0000000..598b3e7 --- /dev/null +++ b/python-bitsets.spec @@ -0,0 +1,124 @@ +%global _empty_manifest_terminate_build 0 +Name: python-bitsets +Version: 0.8.4 +Release: 1 +Summary: Ordered subsets over a predefined domain +License: MIT +URL: https://github.com/xflr6/bitsets +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/4d/a8/8934a8201288c12d4fbae78d0adb5f39255ba781ba4bf83e18abbf566786/bitsets-0.8.4.zip +BuildArch: noarch + +Requires: python3-tox +Requires: python3-flake8 +Requires: python3-pep8-naming +Requires: python3-wheel +Requires: python3-twine +Requires: python3-sphinx +Requires: python3-sphinx-rtd-theme +Requires: python3-pytest +Requires: python3-pytest-cov +Requires: python3-graphviz + +%description +|PyPI version| |License| |Supported Python| |Wheel| +|Build| |Codecov| |Readthedocs-stable| |Readthedocs-latest| +This package provides a memory-efficient pure-python **immutable ordered set +data type** for working with large numbers of subsets from a predetermined pool +of objects. +Given a name and a tuple of hashable objects, the ``bitset()``-function returns +a custom integer subclass for creating ordered subsets from the object pool. +Each instance is a Python integer where the presence/absence of the *nth* pool +item is its *nth* bit being set/unset (a.k.a. bit strings, powers of two, rank +in *colexicographical* order). +Being just a regular (arbitrary precision) integer with some convenience +methods for translating between unique object collections and bit patterns +allows to perform certain tasks in a more natural way, e.g. sorting a +collection of sets lexicographically, or enumerating possible combinations in +an ordered fashion. + +%package -n python3-bitsets +Summary: Ordered subsets over a predefined domain +Provides: python-bitsets +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-bitsets +|PyPI version| |License| |Supported Python| |Wheel| +|Build| |Codecov| |Readthedocs-stable| |Readthedocs-latest| +This package provides a memory-efficient pure-python **immutable ordered set +data type** for working with large numbers of subsets from a predetermined pool +of objects. +Given a name and a tuple of hashable objects, the ``bitset()``-function returns +a custom integer subclass for creating ordered subsets from the object pool. +Each instance is a Python integer where the presence/absence of the *nth* pool +item is its *nth* bit being set/unset (a.k.a. bit strings, powers of two, rank +in *colexicographical* order). +Being just a regular (arbitrary precision) integer with some convenience +methods for translating between unique object collections and bit patterns +allows to perform certain tasks in a more natural way, e.g. sorting a +collection of sets lexicographically, or enumerating possible combinations in +an ordered fashion. + +%package help +Summary: Development documents and examples for bitsets +Provides: python3-bitsets-doc +%description help +|PyPI version| |License| |Supported Python| |Wheel| +|Build| |Codecov| |Readthedocs-stable| |Readthedocs-latest| +This package provides a memory-efficient pure-python **immutable ordered set +data type** for working with large numbers of subsets from a predetermined pool +of objects. +Given a name and a tuple of hashable objects, the ``bitset()``-function returns +a custom integer subclass for creating ordered subsets from the object pool. +Each instance is a Python integer where the presence/absence of the *nth* pool +item is its *nth* bit being set/unset (a.k.a. bit strings, powers of two, rank +in *colexicographical* order). +Being just a regular (arbitrary precision) integer with some convenience +methods for translating between unique object collections and bit patterns +allows to perform certain tasks in a more natural way, e.g. sorting a +collection of sets lexicographically, or enumerating possible combinations in +an ordered fashion. + +%prep +%autosetup -n bitsets-0.8.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-bitsets -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Fri May 05 2023 Python_Bot <Python_Bot@openeuler.org> - 0.8.4-1 +- Package Spec generated @@ -0,0 +1 @@ +53d2d882b6baa5e63a582cecda768a44 bitsets-0.8.4.zip |