Package: primesieve
primesieve-pythonSummaryPython bindings for theprimesieveC++ library.Generates primes orders of magnitude faster than any pure Python code!Features:Get an array of primesIterate over primes using little memoryFind the nth primeCount/print primes andprime k-tupletsMulti-threaded for counting primes and finding the nth primeNumPy supportPrerequisitesWe 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.# Ubuntu/Debiansudoaptinstallg++python-dev# Fedorasudodnfinstallgcc-c++python-devel# macOSxcode-select--installInstallation# Python 3.5 or laterpipinstallprimesieve# For Python 2.7 use:pipinstall"primesieve<=1.4.4"Conda InstallationYou don't need to install a C++ compiler when installing python-primesieve using Conda.conda install -c conda-forge python-primesieveUsage examples>>>fromprimesieveimport*# 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)50847534Here is alist of all available functions.Iterating over primesInstead 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.>>>importprimesieveit=primesieve.Iterator()prime=it.next_prime()# Iterate over the primes below 10000whileprime<10000:printprimeprime=it.next_prime()# Set iterator start number to 100it.skipto(100)prime=it.prev_prime()# Iterate backwards over the primes below 100whileprime>0:printprimeprime=it.prev_prime()NumPy supportUsing theprimesieve.numpymodule you can generate an array of
primes using native C++ performance!In comparison theprimesievemodule 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.>>>fromprimesieve.numpyimport*# 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])DevelopmentYou need to have installed a C++ compiler, seePrerequisites.# Install prerequisitespipinstallcythonpytestnumpy# Clone repositorygitclone--recursivehttps://github.com/kimwalisch/primesieve-pythoncdprimesieve-python# Build and install primesieve-pythonpipinstall.--upgrade# Run testspytestHow to do a new releaseYou need to be a maintainer of theprimesieve-pythonrepo.You need to be a maintainer of theprimesieve pypiproject.Compare.travis.ymlwithcibuildwheel#example-setupand update.travis.ymlif needed.Update the supported Python versions insetup.py(we support the same versions ascibuildwheel).Increment the primesieve-python version insetup.py. Ideally this should be the last commit before the release as this uploads the new primesieve wheels tohttps://test.pypi.org.Check if all primesieve wheels (Windows, macOS, Linux) have been uploaded tohttps://test.pypi.org.If not, read theTravis CI logsand fix the bugs.Finally, do a new release on GitHub.