Function slow_primes::is_prime_miller_rabin [−] [src]

pub fn is_prime_miller_rabin(n: u64) -> bool

Test if n is prime, using the deterministic version of the Miller-Rabin test.

Doing a lot of primality tests with numbers strictly below some upper bound will be faster using the is_prime method of a Primes instance.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)