primey

package

v0.41.0 Latest Latest Go to latest Published: Nov 2, 2025 License: MIT Imports: 9 Imported by: 0

Details

This section is empty.

This section is empty.

func CacheResize(l int)

CacheResize sets the length of primeCache to l and fills it with primes

func FindPrimes(limit uint) []int32

FindPrimes finds and returns all primes <= limit

func Index(p int) int

Index returns the index of the prime, or if p is not prime then the index below the next highest prime

func Iter() func(func(int, int) bool)

Iter returns an iterator over all primes

func Iterr(start, end int) func(func(int, int) bool)

Iterr returns an iterator over a range of index values

func Len() int

Len returns the length of the list of primes

func Nth(n int) int

Nth returns the value of the nth prime

func Pi(n int) int

Pi returns the number of primes up to and including n

func Prime(p int) bool

Prime returns true if p is a prime

func PrimeMax() int

PrimeMax returns the largest prime in the list of primes

func PrimeSlow(n int) bool

PrimeSlow returns whether a number is prime or not, used for primes > PrimeMax()

This section is empty.