%global _empty_manifest_terminate_build 0 Name: python-scikit-sequitur Version: 0.4.0 Release: 1 Summary: Sequitur algorithm for inferring hierarchies License: Apache 2.0 URL: http://www.grantjenks.com/docs/scikit-sequitur/ Source0: https://mirrors.nju.edu.cn/pypi/web/packages/98/32/31c28ce7441b16b6cf2f4a552ecd07a0b6741c8f628001ea853663efeb12/scikit-sequitur-0.4.0.tar.gz %description `SciKit Sequitur`_ is an Apache2 licensed Python module for inferring compositional hierarchies from sequences. Sequitur detects repetition and factors it out by forming rules in a grammar. The rules can be composed of non-terminals, giving rise to a hierarchy. It is useful for recognizing lexical structure in strings, and excels at very long sequences. The Sequitur algorithm was originally developed by Craig Nevill-Manning and Ian Witten. >>> from sksequitur import parse >>> grammar = parse('hello hello') >>> print(grammar) 0 -> 1 _ 1 1 -> h e l l o hello `SciKit Sequitur`_ works on strings, lines, or any sequence of Python objects. %package -n python3-scikit-sequitur Summary: Sequitur algorithm for inferring hierarchies Provides: python-scikit-sequitur BuildRequires: python3-devel BuildRequires: python3-setuptools BuildRequires: python3-pip BuildRequires: python3-cffi BuildRequires: gcc BuildRequires: gdb %description -n python3-scikit-sequitur `SciKit Sequitur`_ is an Apache2 licensed Python module for inferring compositional hierarchies from sequences. Sequitur detects repetition and factors it out by forming rules in a grammar. The rules can be composed of non-terminals, giving rise to a hierarchy. It is useful for recognizing lexical structure in strings, and excels at very long sequences. The Sequitur algorithm was originally developed by Craig Nevill-Manning and Ian Witten. >>> from sksequitur import parse >>> grammar = parse('hello hello') >>> print(grammar) 0 -> 1 _ 1 1 -> h e l l o hello `SciKit Sequitur`_ works on strings, lines, or any sequence of Python objects. %package help Summary: Development documents and examples for scikit-sequitur Provides: python3-scikit-sequitur-doc %description help `SciKit Sequitur`_ is an Apache2 licensed Python module for inferring compositional hierarchies from sequences. Sequitur detects repetition and factors it out by forming rules in a grammar. The rules can be composed of non-terminals, giving rise to a hierarchy. It is useful for recognizing lexical structure in strings, and excels at very long sequences. The Sequitur algorithm was originally developed by Craig Nevill-Manning and Ian Witten. >>> from sksequitur import parse >>> grammar = parse('hello hello') >>> print(grammar) 0 -> 1 _ 1 1 -> h e l l o hello `SciKit Sequitur`_ works on strings, lines, or any sequence of Python objects. %prep %autosetup -n scikit-sequitur-0.4.0 %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-scikit-sequitur -f filelist.lst %dir %{python3_sitearch}/* %files help -f doclist.lst %{_docdir}/* %changelog * Wed May 31 2023 Python_Bot - 0.4.0-1 - Package Spec generated