%global _empty_manifest_terminate_build 0 Name: python-pydelta-smt Version: 0.3 Release: 1 Summary: Delta debugger for SMT-LIB files License: MIT URL: https://github.com/nafur/pydelta Source0: https://mirrors.nju.edu.cn/pypi/web/packages/ed/02/df7f7d4b9c840c4e26813caf22f2592f9bcbfc0cb873bed89b08608f7783/pydelta-smt-0.3.tar.gz BuildArch: noarch Requires: python3-progressbar Requires: python3-sphinx-rtd-theme Requires: python3-importlib-metadata %description pyDelta is a [delta debugger](https://en.wikipedia.org/wiki/Delta_debugging) for [SMT-LIB](http://smtlib.cs.uiowa.edu/language.shtml) files. It is heavily inspired by other similar tools like [ddSMT](https://github.com/aniemetz/ddSMT), [DeltaSMT](http://fmv.jku.at/deltasmt/) or [delta](https://github.com/smtrat/smtrat/tree/master/src/delta). pyDelta is based on a few fundamental ideas: - parse generic S-expressions. This is very robust against changes to SMT-LIB or solver specific extensions. It also allows for a small parser and simple node structure. Most semantic information that is required for simplification can be recovered cheaply. - parallel execution. Running multiple checks in parallel allows for significant speedups when minimizing faulty inputs. - easy to extend. It should be fairly easy to add new simplifications by implementing new mutators. - fixed-point iteration. Simplifications are applied until no simplificationss are possible anywhere. Rerunning pyDelta on a minimized input should not yield further improvements. - flexible to use. The options should cover most use cases, including checking for the exit code or checking for specific patterns in the (regular or error) output. Please visit https://pydelta.readthedocs.io for more documentation. %package -n python3-pydelta-smt Summary: Delta debugger for SMT-LIB files Provides: python-pydelta-smt BuildRequires: python3-devel BuildRequires: python3-setuptools BuildRequires: python3-pip %description -n python3-pydelta-smt pyDelta is a [delta debugger](https://en.wikipedia.org/wiki/Delta_debugging) for [SMT-LIB](http://smtlib.cs.uiowa.edu/language.shtml) files. It is heavily inspired by other similar tools like [ddSMT](https://github.com/aniemetz/ddSMT), [DeltaSMT](http://fmv.jku.at/deltasmt/) or [delta](https://github.com/smtrat/smtrat/tree/master/src/delta). pyDelta is based on a few fundamental ideas: - parse generic S-expressions. This is very robust against changes to SMT-LIB or solver specific extensions. It also allows for a small parser and simple node structure. Most semantic information that is required for simplification can be recovered cheaply. - parallel execution. Running multiple checks in parallel allows for significant speedups when minimizing faulty inputs. - easy to extend. It should be fairly easy to add new simplifications by implementing new mutators. - fixed-point iteration. Simplifications are applied until no simplificationss are possible anywhere. Rerunning pyDelta on a minimized input should not yield further improvements. - flexible to use. The options should cover most use cases, including checking for the exit code or checking for specific patterns in the (regular or error) output. Please visit https://pydelta.readthedocs.io for more documentation. %package help Summary: Development documents and examples for pydelta-smt Provides: python3-pydelta-smt-doc %description help pyDelta is a [delta debugger](https://en.wikipedia.org/wiki/Delta_debugging) for [SMT-LIB](http://smtlib.cs.uiowa.edu/language.shtml) files. It is heavily inspired by other similar tools like [ddSMT](https://github.com/aniemetz/ddSMT), [DeltaSMT](http://fmv.jku.at/deltasmt/) or [delta](https://github.com/smtrat/smtrat/tree/master/src/delta). pyDelta is based on a few fundamental ideas: - parse generic S-expressions. This is very robust against changes to SMT-LIB or solver specific extensions. It also allows for a small parser and simple node structure. Most semantic information that is required for simplification can be recovered cheaply. - parallel execution. Running multiple checks in parallel allows for significant speedups when minimizing faulty inputs. - easy to extend. It should be fairly easy to add new simplifications by implementing new mutators. - fixed-point iteration. Simplifications are applied until no simplificationss are possible anywhere. Rerunning pyDelta on a minimized input should not yield further improvements. - flexible to use. The options should cover most use cases, including checking for the exit code or checking for specific patterns in the (regular or error) output. Please visit https://pydelta.readthedocs.io for more documentation. %prep %autosetup -n pydelta-smt-0.3 %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-pydelta-smt -f filelist.lst %dir %{python3_sitelib}/* %files help -f doclist.lst %{_docdir}/* %changelog * Wed May 10 2023 Python_Bot - 0.3-1 - Package Spec generated