primesieve | 🚀 Fast prime number generator | Math library

by kimwalisch C++ Version: v11.0 License: BSD-2-Clause

X-Ray Key Features Code Snippets Community Discussions(3)Vulnerabilities Install Support

kandi X-RAY | primesieve Summary

primesieve is a C++ library typically used in Utilities, Math applications. primesieve has no bugs, it has no vulnerabilities, it has a Permissive License and it has medium support. You can download it from GitHub.

primesieve is a command-line program and C/C++ library for quickly generating prime numbers. It is very cache efficient, it detects your CPU's L1 & L2 cache sizes and allocates its main data structures accordingly. It is also multi-threaded by default, it uses all available CPU cores whenever possible i.e. if sequential ordering is not required. primesieve can generate primes and prime k-tuplets up to 264. primesieve generates primes using the segmented sieve of Eratosthenes with wheel factorization. This algorithm has a run time complexity of operations and uses memory. Furthermore primesieve uses the bucket sieve algorithm which improves the cache efficiency when generating primes > 232. primesieve uses 8 bytes per sieving prime, hence its memory usage is about bytes per thread.

Support

Quality

Security

License

Reuse

Support

primesieve has a medium active ecosystem.

It has 835 star(s) with 114 fork(s). There are 44 watchers for this library.

It had no major release in the last 12 months.

There are 7 open issues and 75 have been closed. On average issues are closed in 22 days. There are no pull requests.

It has a neutral sentiment in the developer community.

The latest version of primesieve is v11.0

Quality

primesieve has no bugs reported.

Security

primesieve has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.

License

primesieve is licensed under the BSD-2-Clause License. This license is Permissive.

Permissive licenses have the least restrictions, and you can use them in most projects.

Reuse

primesieve releases are available to install and integrate.

Installation instructions, examples and code snippets are available.

Top functions reviewed by kandi - BETA

kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of primesieve

Get all kandi verified functions for this library.

primesieve Key Features

No Key Features are available at this moment for primesieve.

primesieve Examples and Code Snippets

No Code Snippets are available at this moment for primesieve.

Community Discussions

Trending Discussions on primesieve

Making Sieve of Eratosthenes more memory efficient in python?

Improving this prime number listing implementation

Implementing a prime sieve in Java using booleans

QUESTION

Making Sieve of Eratosthenes more memory efficient in python?

Asked 2020-Dec-10 at 01:35

Sieve of Eratosthenes memory constraint issue

Im currently trying to implement a version of the sieve of eratosthenes for a Kattis problem, however, I am running into some memory constraints that my implementation wont pass.

Here is a link to the problem statement. In short the problem wants me to first return the amount of primes less or equal to n and then solve for a certain number of queries if a number i is a prime or not. There is a constraint of 50 MB memory usage as well as only using the standard libraries of python (no numpy etc). The memory constraint is where I am stuck.

Here is my code so far:

...

ANSWER

Answered 2020-Jul-14 at 16:40

I think you can try by using a list of booleans to mark whether its index is prime or not:

Source https://stackoverflow.com/questions/62899578

QUESTION

Improving this prime number listing implementation

Asked 2018-Nov-14 at 15:38

This following code lists all prime number.

Is this a new implementation of the Sieve of Eratosthenes?

How can the code be improved to run faster as it gets to higher numbers?

...

ANSWER

Answered 2018-Nov-14 at 15:38

there are probably many ways to improve this but one that strikes me most is - why do you have updateList and PrimeList, you keep deleting and copying them over at each iteration. This takes more time as the lists get longer. Getting rid of one of them would be my first change.

Source https://stackoverflow.com/questions/53297395

QUESTION

Implementing a prime sieve in Java using booleans

Asked 2017-Jul-23 at 17:26

I am trying to implement a prime sieve in Java so that I can figure out the sum of all prime numbers less than a certain maximum. I tried to do it using a method PrimeSieve and using an array of booleans which I make true if the number is composite by taking a prime and considering all integer multiples less than the max.

But I keep getting compiler errors when trying to run the program and I can't figure out what's wrong:

Exception in thread "main" java.lang.Error: Unresolved compilation problems: Syntax error, insert ". class" to complete Expression The type of the expression must be an array type but it resolved to Class Syntax error on token "i", delete this token Syntax error, insert ". class" to complete Expression The type of the expression must be an array type but it resolved to Class
at Problem3.PrimeSieve(Problem3.java:11)
at Problem3.main(Problem3.java:26)

...

ANSWER

Answered 2017-Jul-23 at 15:30

You got 2 problems:
1) You using the name of the type instead the name of the array.
So boolean[i] should be changed into isPrime[i].
2) Java don't understand 2i as "two times i". You need to write that 2*i.

This will make your code compile:

Source https://stackoverflow.com/questions/45266711

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install primesieve

The primesieve command-line program can be installed using your operating system's package manager. For doing development with libprimesieve you may need to install libprimesieve-dev or libprimesieve-devel.
You need to have installed a C++ compiler which supports C++11 (or later) and CMake ≥ 3.4.
Detailed build instructions

Support

If you are using the CMake build system to compile your program and libprimesieve is installed on your system, then you can add the following two lines to your CMakeLists.txt to link your program against libprimesieve.

Find more information at: