MCPcopy Create free account
hub / github.com/andeya/algorithm / NextPrimeUint64

Function NextPrimeUint64

mathutil/primes.go:219–260  ·  view source on GitHub ↗

NextPrimeUint64 returns first prime > n and true if successful or an undefined value and false if there is no next prime in the uint64 limits. Typical run time is in hundreds of µs.

(n uint64)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 2

BenchmarkNextPrimeUint64Function · 0.85
TestNextPrimeUint64Function · 0.85

Calls 2

NextPrimeUint16Function · 0.85
IsPrimeUint64Function · 0.85

Tested by 2

BenchmarkNextPrimeUint64Function · 0.68
TestNextPrimeUint64Function · 0.68