var searchIndex = {};
searchIndex["primal"] = {"doc":"`primal` puts raw power into prime numbers.","items":[[5,"estimate_prime_pi","primal","Returns estimated bounds for π(*n*), the number of primes less\nthan or equal to `n`.",null,null],[5,"estimate_nth_prime","","Gives estimated bounds for *p<sub>n</sub>*, the `n`th prime number,\n1-indexed (i.e. *p<sub>1</sub>* = 2, *p<sub>2</sub>* = 3).",null,null],[5,"is_prime","","Test if `n` is prime, using the deterministic version of the\nMiller-Rabin test.",null,{"inputs":[{"name":"u64"}],"output":{"name":"bool"}}],[5,"as_perfect_power","","Returns integers `(y, k)` such that `x = y^k` with `k` maximised\n(other than for `x = 0, 1`, in which case `y = x`, `k = 1`).",null,null],[5,"as_prime_power","","Return `Some((p, k))` if `x = p^k` for some prime `p` and `k >= 1`\n(that is, including when `x` is itself a prime).",null,{"inputs":[{"name":"u64"}],"output":{"name":"option"}}],[3,"StreamingSieve","","A heavily optimised prime sieve.",null,null],[3,"Sieve","","A heavily optimised prime sieve.",null,null],[3,"Primes","","An iterator over all primes.",null,null],[11,"prime_pi","","Count the number of primes upto and including `n`, that is, 𝜋,\nthe [prime counting\nfunction](https://en.wikipedia.org/wiki/Prime-counting_function).",0,{"inputs":[{"name":"usize"}],"output":{"name":"usize"}}],[11,"nth_prime","","Compute *p<sub>n</sub>*, the `n` prime number, 1-indexed\n(i.e. *p<sub>1</sub>* = 2, *p<sub>2</sub>* = 3).",0,{"inputs":[{"name":"usize"}],"output":{"name":"usize"}}],[11,"all","","The sequence `2, 3, 5, 7, 11, ...`.",1,{"inputs":[],"output":{"name":"primes"}}],[11,"next","","",1,null],[11,"fmt","","",0,null],[11,"fmt","","",2,null],[11,"new","","Create a new instance, sieving out all the primes up to\n`limit`.",2,{"inputs":[{"name":"usize"}],"output":{"name":"sieve"}}],[11,"upper_bound","","Return the largest number that this sieve knows about.",2,null],[11,"is_prime","","Determine if `n` is a prime number.",2,null],[11,"prime_pi","","Count the number of primes upto and including `n`.",2,null],[11,"factor","","Factorise `n` into (prime, exponent) pairs.",2,null],[11,"nth_prime","","Compute *p<sub>n</sub>*, the `n` prime number, 1-indexed\n(i.e. *p<sub>1</sub>* = 2, *p<sub>2</sub>* = 3).",2,null],[11,"primes_from","","Return an iterator over the primes from `n` (inclusive) to the\nend of this sieve.",2,null]],"paths":[[3,"StreamingSieve"],[3,"Primes"],[3,"Sieve"]]};
initSearch(searchIndex);