var searchIndex = {};
searchIndex["primal_sieve"] = {"doc":"Highly optimised prime sieves.","items":[[3,"StreamingSieve","primal_sieve","A heavily optimised prime sieve.",null,null],[3,"Primes","","An iterator over all primes.",null,null],[3,"Sieve","","A heavily optimised prime sieve.",null,null],[3,"SievePrimes","","An iterator over the primes stored in a `Sieve` instance.",null,null],[11,"all","","The sequence `2, 3, 5, 7, 11, ...`.",0,{"inputs":[],"output":{"name":"primes"}}],[11,"next","","",0,null],[11,"fmt","","",1,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).",1,{"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).",1,{"inputs":[{"name":"usize"}],"output":{"name":"usize"}}],[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],[11,"clone","","",3,null],[11,"next","","",3,null]],"paths":[[3,"Primes"],[3,"StreamingSieve"],[3,"Sieve"],[3,"SievePrimes"]]};
initSearch(searchIndex);