diff options
Diffstat (limited to 'python-exact-cover.spec')
| -rw-r--r-- | python-exact-cover.spec | 104 |
1 files changed, 104 insertions, 0 deletions
diff --git a/python-exact-cover.spec b/python-exact-cover.spec new file mode 100644 index 0000000..393cd17 --- /dev/null +++ b/python-exact-cover.spec @@ -0,0 +1,104 @@ +%global _empty_manifest_terminate_build 0 +Name: python-exact-cover +Version: 1.2.1 +Release: 1 +Summary: Solve exact cover problems +License: GPL-2.0-only +URL: https://github.com/jwg4/exact_cover +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/04/16/8903cae89e33895b9a052c685d16eff514d0a4b9eaf4ff54b7e20749ef8b/exact_cover-1.2.1.tar.gz + +Requires: python3-numpy +Requires: python3-numpy +Requires: python3-setuptools + +%description +[](https://badge.fury.io/py/exact-cover) + + +This is a Python 3 package to solve exact cover problems using Numpy. It is based on https://github.com/moygit/exact_cover_np by Moy Easwaran. Jack Grahl ported it to Python 3, fixed some bugs and made lots of small improvements to the packaging. +The original package by Moy was designed to solve sudoku. Now this package is only designed to solve exact cover problems given as boolean arrays. It can be used to solve sudoku and a variety of combinatorial problems. However the code to reduce a sudoku to an exact cover problem is no longer part of this project. It can be found at: + - https://pypi.org/project/xudoku/ + - https://github.com/jwg4/xudoku +Another project, 'polyomino' by Jack Grahl uses this algorithm to solve polyomino tiling problems. It can be found at: + - https://pypi.org/project/polyomino/ + - https://github.com/jwg4/polyomino + +%package -n python3-exact-cover +Summary: Solve exact cover problems +Provides: python-exact-cover +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +BuildRequires: python3-cffi +BuildRequires: gcc +BuildRequires: gdb +%description -n python3-exact-cover +[](https://badge.fury.io/py/exact-cover) + + +This is a Python 3 package to solve exact cover problems using Numpy. It is based on https://github.com/moygit/exact_cover_np by Moy Easwaran. Jack Grahl ported it to Python 3, fixed some bugs and made lots of small improvements to the packaging. +The original package by Moy was designed to solve sudoku. Now this package is only designed to solve exact cover problems given as boolean arrays. It can be used to solve sudoku and a variety of combinatorial problems. However the code to reduce a sudoku to an exact cover problem is no longer part of this project. It can be found at: + - https://pypi.org/project/xudoku/ + - https://github.com/jwg4/xudoku +Another project, 'polyomino' by Jack Grahl uses this algorithm to solve polyomino tiling problems. It can be found at: + - https://pypi.org/project/polyomino/ + - https://github.com/jwg4/polyomino + +%package help +Summary: Development documents and examples for exact-cover +Provides: python3-exact-cover-doc +%description help +[](https://badge.fury.io/py/exact-cover) + + +This is a Python 3 package to solve exact cover problems using Numpy. It is based on https://github.com/moygit/exact_cover_np by Moy Easwaran. Jack Grahl ported it to Python 3, fixed some bugs and made lots of small improvements to the packaging. +The original package by Moy was designed to solve sudoku. Now this package is only designed to solve exact cover problems given as boolean arrays. It can be used to solve sudoku and a variety of combinatorial problems. However the code to reduce a sudoku to an exact cover problem is no longer part of this project. It can be found at: + - https://pypi.org/project/xudoku/ + - https://github.com/jwg4/xudoku +Another project, 'polyomino' by Jack Grahl uses this algorithm to solve polyomino tiling problems. It can be found at: + - https://pypi.org/project/polyomino/ + - https://github.com/jwg4/polyomino + +%prep +%autosetup -n exact-cover-1.2.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-exact-cover -f filelist.lst +%dir %{python3_sitearch}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Mon May 15 2023 Python_Bot <Python_Bot@openeuler.org> - 1.2.1-1 +- Package Spec generated |