var searchIndex = {};
searchIndex["slow_primes"] = {"doc":"Simplistic and relatively unoptimised handling of basic\ntasks around primes:","items":[[3,"Primes","slow_primes","Stores information about primes up to some limit.",null,null],[3,"PrimeIterator","","Iterator over the primes stored in a sieve.",null,null],[3,"StreamingSieve","","A segmented sieve that yields only a small run of primes at a\ntime.",null,null],[5,"estimate_prime_pi","","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_miller_rabin","","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"}}],[11,"fmt","","",0,null],[11,"new","","Create a new instance of the streaming sieve that will\ncorrectly progressively filter primes up to `limit`.",0,{"inputs":[{"name":"usize"}],"output":{"name":"streamingsieve"}}],[11,"next","","Extract the next chunk of filtered primes, the return value is\n`Some((low, v))` or `None` if the sieve has reached the limit.",0,null],[11,"fmt","","",1,null],[11,"clone","","",2,null],[11,"sieve","","Construct a `Primes` via a sieve up to at least `limit`.",1,{"inputs":[{"name":"usize"}],"output":{"name":"primes"}}],[11,"upper_bound","","The largest number stored.",1,null],[11,"is_prime","","Check if `n` is prime, possibly failing if `n` is larger than\nthe upper bound of this Primes instance.",1,null],[11,"primes","","Iterator over the primes stored in this map.",1,null],[11,"factor","","Factorise `n` into (prime, exponent) pairs.",1,null],[11,"next","","",2,null],[11,"size_hint","","",2,null],[11,"next_back","","",2,null],[6,"Factors","","(prime, exponent) pairs storing the prime factorisation of a\nnumber.",null,null]],"paths":[[3,"StreamingSieve"],[3,"Primes"],[3,"PrimeIterator"]]};
initSearch(searchIndex);