diff options
| -rw-r--r-- | .gitignore | 1 | ||||
| -rw-r--r-- | python-primesieve.spec | 606 | ||||
| -rw-r--r-- | sources | 1 |
3 files changed, 608 insertions, 0 deletions
@@ -0,0 +1 @@ +/primesieve-2.3.2.tar.gz diff --git a/python-primesieve.spec b/python-primesieve.spec new file mode 100644 index 0000000..8fff7a1 --- /dev/null +++ b/python-primesieve.spec @@ -0,0 +1,606 @@ +%global _empty_manifest_terminate_build 0 +Name: python-primesieve +Version: 2.3.2 +Release: 1 +Summary: please add a summary manually as the author left a blank one +License: MIT +URL: https://github.com/kimwalisch/primesieve-python +Source0: https://mirrors.nju.edu.cn/pypi/web/packages/f1/ab/38447ca92b2cd2a39346ad623bb3a4c9b704dbcd3018c8fd306c5f0ca1ac/primesieve-2.3.2.tar.gz +BuildArch: noarch + + +%description +# primesieve-python + +[](https://travis-ci.org/kimwalisch/primesieve-python) [](https://pypi.python.org/pypi/primesieve) + +# Summary + +Python bindings for the [primesieve](https://github.com/kimwalisch/primesieve) +C++ library. + +Generates primes orders of magnitude faster than any pure Python code! + +**Features:** + +* Get an array of primes +* Iterate over primes using little memory +* Find the nth prime +* Count/print primes and [prime k-tuplets](https://en.wikipedia.org/wiki/Prime_k-tuple) +* Multi-threaded for counting primes and finding the nth prime +* NumPy support + +# Prerequisites + +We provide primesieve wheels (distribution packages) for Windows, macOS +and Linux for x86 and x64 CPUs. For other operating systems and/or CPUs +you need to have installed a C++ compiler. + +```bash +# Ubuntu/Debian +sudo apt install g++ python-dev + +# Fedora +sudo dnf install gcc-c++ python-devel + +# macOS +xcode-select --install +``` + +# Installation + +```bash +# Python 3.5 or later +pip install primesieve + +# For Python 2.7 use: +pip install "primesieve<=1.4.4" +``` + +# Conda Installation + +[](https://travis-ci.org/conda-forge/python-primesieve-feedstock) +[](https://ci.appveyor.com/project/conda-forge/python-primesieve-feedstock/branch/master) +[](https://circleci.com/gh/conda-forge/python-primesieve-feedstock) +[](https://anaconda.org/conda-forge/python-primesieve) + +You don't need to install a C++ compiler when installing python-primesieve using Conda. + +``` +conda install -c conda-forge python-primesieve +``` + +# Usage examples + +```Python +>>> from primesieve import * + +# Get an array of the primes <= 40 +>>> primes(40) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37] + +# Get an array of the primes between 100 and 120 +>>> primes(100, 120) +[101, 103, 107, 109, 113] + +# Get an array of the first 10 primes +>>> n_primes(10) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29] + +# Get an array of the first 10 primes >= 1000 +>>> n_primes(10, 1000) +[1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061] + +# Get the 10th prime +>>> nth_prime(10) +29 + +# Count the primes below 10**9 +>>> count_primes(10**9) +50847534 +``` + +Here is a [list of all available functions](primesieve/_primesieve.pyx). + +# Iterating over primes + +Instead of generating a large array of primes and then do something +with the primes it is also possible to simply iterate over the primes +which uses less memory. + +```Python +>>> import primesieve + +it = primesieve.Iterator() +prime = it.next_prime() + +# Iterate over the primes below 10000 +while prime < 10000: + print prime + prime = it.next_prime() + +# Set iterator start number to 100 +it.skipto(100) +prime = it.prev_prime() + +# Iterate backwards over the primes below 100 +while prime > 0: + print prime + prime = it.prev_prime() +``` + +# NumPy support + +Using the ```primesieve.numpy``` module you can generate an array of +primes using native C++ performance! + +In comparison the ```primesieve``` module generates an array of primes +about 3 times slower mostly because the conversion of the C primes +array into a python array is quite slow. + +```Python +>>> from primesieve.numpy import * + +# Generate a numpy array with the primes below 100 +>>> primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, + 61, 67, 71, 73, 79, 83, 89, 97]) + +# Generate a numpy array with the first 100 primes +>>> n_primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, + 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, + 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, + 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, + 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, + 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, + 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, + 479, 487, 491, 499, 503, 509, 521, 523, 541]) +``` + +# Development + +You need to have installed a C++ compiler, see [Prerequisites](#prerequisites). + +```bash +# Install prerequisites +pip install cython pytest numpy + +# Clone repository +git clone --recursive https://github.com/kimwalisch/primesieve-python + +cd primesieve-python + +# Build and install primesieve-python +pip install . --upgrade + +# Run tests +pytest +``` + +# How to do a new release + +* You need to be a maintainer of the [primesieve-python](https://github.com/kimwalisch/primesieve-python) repo. +* You need to be a maintainer of the [primesieve pypi](https://pypi.org/project/primesieve) project. +* Compare ```.travis.yml``` with [cibuildwheel#example-setup](https://github.com/joerick/cibuildwheel#example-setup) and update ```.travis.yml``` if needed. +* Update the supported Python versions in ```setup.py``` (we support the same versions as [cibuildwheel](https://pypi.org/project/cibuildwheel)). +* Increment the primesieve-python version in ```setup.py```. Ideally this should be the last commit before the release as this uploads the new primesieve wheels to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* Check if all primesieve wheels (Windows, macOS, Linux) have been uploaded to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* If not, read the [Travis CI logs](https://travis-ci.org/github/kimwalisch/primesieve-python) and fix the bugs. +* Finally, do a new release on GitHub. + + +%package -n python3-primesieve +Summary: please add a summary manually as the author left a blank one +Provides: python-primesieve +BuildRequires: python3-devel +BuildRequires: python3-setuptools +BuildRequires: python3-pip +%description -n python3-primesieve +# primesieve-python + +[](https://travis-ci.org/kimwalisch/primesieve-python) [](https://pypi.python.org/pypi/primesieve) + +# Summary + +Python bindings for the [primesieve](https://github.com/kimwalisch/primesieve) +C++ library. + +Generates primes orders of magnitude faster than any pure Python code! + +**Features:** + +* Get an array of primes +* Iterate over primes using little memory +* Find the nth prime +* Count/print primes and [prime k-tuplets](https://en.wikipedia.org/wiki/Prime_k-tuple) +* Multi-threaded for counting primes and finding the nth prime +* NumPy support + +# Prerequisites + +We provide primesieve wheels (distribution packages) for Windows, macOS +and Linux for x86 and x64 CPUs. For other operating systems and/or CPUs +you need to have installed a C++ compiler. + +```bash +# Ubuntu/Debian +sudo apt install g++ python-dev + +# Fedora +sudo dnf install gcc-c++ python-devel + +# macOS +xcode-select --install +``` + +# Installation + +```bash +# Python 3.5 or later +pip install primesieve + +# For Python 2.7 use: +pip install "primesieve<=1.4.4" +``` + +# Conda Installation + +[](https://travis-ci.org/conda-forge/python-primesieve-feedstock) +[](https://ci.appveyor.com/project/conda-forge/python-primesieve-feedstock/branch/master) +[](https://circleci.com/gh/conda-forge/python-primesieve-feedstock) +[](https://anaconda.org/conda-forge/python-primesieve) + +You don't need to install a C++ compiler when installing python-primesieve using Conda. + +``` +conda install -c conda-forge python-primesieve +``` + +# Usage examples + +```Python +>>> from primesieve import * + +# Get an array of the primes <= 40 +>>> primes(40) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37] + +# Get an array of the primes between 100 and 120 +>>> primes(100, 120) +[101, 103, 107, 109, 113] + +# Get an array of the first 10 primes +>>> n_primes(10) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29] + +# Get an array of the first 10 primes >= 1000 +>>> n_primes(10, 1000) +[1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061] + +# Get the 10th prime +>>> nth_prime(10) +29 + +# Count the primes below 10**9 +>>> count_primes(10**9) +50847534 +``` + +Here is a [list of all available functions](primesieve/_primesieve.pyx). + +# Iterating over primes + +Instead of generating a large array of primes and then do something +with the primes it is also possible to simply iterate over the primes +which uses less memory. + +```Python +>>> import primesieve + +it = primesieve.Iterator() +prime = it.next_prime() + +# Iterate over the primes below 10000 +while prime < 10000: + print prime + prime = it.next_prime() + +# Set iterator start number to 100 +it.skipto(100) +prime = it.prev_prime() + +# Iterate backwards over the primes below 100 +while prime > 0: + print prime + prime = it.prev_prime() +``` + +# NumPy support + +Using the ```primesieve.numpy``` module you can generate an array of +primes using native C++ performance! + +In comparison the ```primesieve``` module generates an array of primes +about 3 times slower mostly because the conversion of the C primes +array into a python array is quite slow. + +```Python +>>> from primesieve.numpy import * + +# Generate a numpy array with the primes below 100 +>>> primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, + 61, 67, 71, 73, 79, 83, 89, 97]) + +# Generate a numpy array with the first 100 primes +>>> n_primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, + 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, + 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, + 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, + 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, + 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, + 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, + 479, 487, 491, 499, 503, 509, 521, 523, 541]) +``` + +# Development + +You need to have installed a C++ compiler, see [Prerequisites](#prerequisites). + +```bash +# Install prerequisites +pip install cython pytest numpy + +# Clone repository +git clone --recursive https://github.com/kimwalisch/primesieve-python + +cd primesieve-python + +# Build and install primesieve-python +pip install . --upgrade + +# Run tests +pytest +``` + +# How to do a new release + +* You need to be a maintainer of the [primesieve-python](https://github.com/kimwalisch/primesieve-python) repo. +* You need to be a maintainer of the [primesieve pypi](https://pypi.org/project/primesieve) project. +* Compare ```.travis.yml``` with [cibuildwheel#example-setup](https://github.com/joerick/cibuildwheel#example-setup) and update ```.travis.yml``` if needed. +* Update the supported Python versions in ```setup.py``` (we support the same versions as [cibuildwheel](https://pypi.org/project/cibuildwheel)). +* Increment the primesieve-python version in ```setup.py```. Ideally this should be the last commit before the release as this uploads the new primesieve wheels to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* Check if all primesieve wheels (Windows, macOS, Linux) have been uploaded to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* If not, read the [Travis CI logs](https://travis-ci.org/github/kimwalisch/primesieve-python) and fix the bugs. +* Finally, do a new release on GitHub. + + +%package help +Summary: Development documents and examples for primesieve +Provides: python3-primesieve-doc +%description help +# primesieve-python + +[](https://travis-ci.org/kimwalisch/primesieve-python) [](https://pypi.python.org/pypi/primesieve) + +# Summary + +Python bindings for the [primesieve](https://github.com/kimwalisch/primesieve) +C++ library. + +Generates primes orders of magnitude faster than any pure Python code! + +**Features:** + +* Get an array of primes +* Iterate over primes using little memory +* Find the nth prime +* Count/print primes and [prime k-tuplets](https://en.wikipedia.org/wiki/Prime_k-tuple) +* Multi-threaded for counting primes and finding the nth prime +* NumPy support + +# Prerequisites + +We provide primesieve wheels (distribution packages) for Windows, macOS +and Linux for x86 and x64 CPUs. For other operating systems and/or CPUs +you need to have installed a C++ compiler. + +```bash +# Ubuntu/Debian +sudo apt install g++ python-dev + +# Fedora +sudo dnf install gcc-c++ python-devel + +# macOS +xcode-select --install +``` + +# Installation + +```bash +# Python 3.5 or later +pip install primesieve + +# For Python 2.7 use: +pip install "primesieve<=1.4.4" +``` + +# Conda Installation + +[](https://travis-ci.org/conda-forge/python-primesieve-feedstock) +[](https://ci.appveyor.com/project/conda-forge/python-primesieve-feedstock/branch/master) +[](https://circleci.com/gh/conda-forge/python-primesieve-feedstock) +[](https://anaconda.org/conda-forge/python-primesieve) + +You don't need to install a C++ compiler when installing python-primesieve using Conda. + +``` +conda install -c conda-forge python-primesieve +``` + +# Usage examples + +```Python +>>> from primesieve import * + +# Get an array of the primes <= 40 +>>> primes(40) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37] + +# Get an array of the primes between 100 and 120 +>>> primes(100, 120) +[101, 103, 107, 109, 113] + +# Get an array of the first 10 primes +>>> n_primes(10) +[2, 3, 5, 7, 11, 13, 17, 19, 23, 29] + +# Get an array of the first 10 primes >= 1000 +>>> n_primes(10, 1000) +[1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061] + +# Get the 10th prime +>>> nth_prime(10) +29 + +# Count the primes below 10**9 +>>> count_primes(10**9) +50847534 +``` + +Here is a [list of all available functions](primesieve/_primesieve.pyx). + +# Iterating over primes + +Instead of generating a large array of primes and then do something +with the primes it is also possible to simply iterate over the primes +which uses less memory. + +```Python +>>> import primesieve + +it = primesieve.Iterator() +prime = it.next_prime() + +# Iterate over the primes below 10000 +while prime < 10000: + print prime + prime = it.next_prime() + +# Set iterator start number to 100 +it.skipto(100) +prime = it.prev_prime() + +# Iterate backwards over the primes below 100 +while prime > 0: + print prime + prime = it.prev_prime() +``` + +# NumPy support + +Using the ```primesieve.numpy``` module you can generate an array of +primes using native C++ performance! + +In comparison the ```primesieve``` module generates an array of primes +about 3 times slower mostly because the conversion of the C primes +array into a python array is quite slow. + +```Python +>>> from primesieve.numpy import * + +# Generate a numpy array with the primes below 100 +>>> primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, + 61, 67, 71, 73, 79, 83, 89, 97]) + +# Generate a numpy array with the first 100 primes +>>> n_primes(100) +array([ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, + 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, + 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, + 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, + 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, + 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, + 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, + 479, 487, 491, 499, 503, 509, 521, 523, 541]) +``` + +# Development + +You need to have installed a C++ compiler, see [Prerequisites](#prerequisites). + +```bash +# Install prerequisites +pip install cython pytest numpy + +# Clone repository +git clone --recursive https://github.com/kimwalisch/primesieve-python + +cd primesieve-python + +# Build and install primesieve-python +pip install . --upgrade + +# Run tests +pytest +``` + +# How to do a new release + +* You need to be a maintainer of the [primesieve-python](https://github.com/kimwalisch/primesieve-python) repo. +* You need to be a maintainer of the [primesieve pypi](https://pypi.org/project/primesieve) project. +* Compare ```.travis.yml``` with [cibuildwheel#example-setup](https://github.com/joerick/cibuildwheel#example-setup) and update ```.travis.yml``` if needed. +* Update the supported Python versions in ```setup.py``` (we support the same versions as [cibuildwheel](https://pypi.org/project/cibuildwheel)). +* Increment the primesieve-python version in ```setup.py```. Ideally this should be the last commit before the release as this uploads the new primesieve wheels to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* Check if all primesieve wheels (Windows, macOS, Linux) have been uploaded to [https://test.pypi.org](https://test.pypi.org/project/primesieve/#files). +* If not, read the [Travis CI logs](https://travis-ci.org/github/kimwalisch/primesieve-python) and fix the bugs. +* Finally, do a new release on GitHub. + + +%prep +%autosetup -n primesieve-2.3.2 + +%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-primesieve -f filelist.lst +%dir %{python3_sitelib}/* + +%files help -f doclist.lst +%{_docdir}/* + +%changelog +* Fri May 05 2023 Python_Bot <Python_Bot@openeuler.org> - 2.3.2-1 +- Package Spec generated @@ -0,0 +1 @@ +606794dd123c184e88c06f4807998748 primesieve-2.3.2.tar.gz |