var searchIndex = {};
searchIndex["primapalooza"] = {"doc":"","items":[[5,"is_prime","primapalooza","Tests for prime numbers.",null,{"inputs":[{"name":"i32"}],"output":{"name":"bool"}}],[5,"is_prime_why_not","","Tests for prime numbers and state why its not a prime number.",null,{"inputs":[{"name":"i32"}],"output":{"name":"bool"}}],[5,"get_next_prime_number","","Returns the next available prime number.",null,{"inputs":[{"name":"i32"}],"output":{"name":"i32"}}],[5,"prime_factorization","","Perform a prime factorization.",null,{"inputs":[{"name":"i32"}],"output":{"name":"vec"}}],[5,"greatest_common_factor","","Perform a greatest common factor(gcf) calculation.",null,{"inputs":[{"name":"i32"},{"name":"i32"}],"output":{"name":"i32"}}],[5,"least_common_multiple","","Perform a least common multiple(lcm) calculation.",null,{"inputs":[{"name":"i32"},{"name":"i32"}],"output":{"name":"i32"}}],[5,"number_of_primes","","Number of prime numbers within a range.",null,{"inputs":[{"name":"i32"},{"name":"i32"}],"output":{"name":"i32"}}],[5,"number_of_factors","","The number of factors in a number.",null,{"inputs":[{"name":"i32"}],"output":{"name":"i32"}}],[5,"mersenne_prime","","Generate a mersenne prime from a prime number.",null,{"inputs":[{"name":"i32"}],"output":{"name":"i32"}}],[5,"generate_primes","","Generate a collection of prime numbers up to a particular limit.",null,{"inputs":[{"name":"i64"}],"output":{"name":"vec"}}]],"paths":[]};
initSearch(searchIndex);