Searched refs:next_prime (Results 1 – 10 of 10) sorted by relevance
69 int next_prime = -1; in GetNextPrime() local71 next_prime = precalc_impl_->GetNextPrime(p); in GetNextPrime()73 return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p); in GetNextPrime()
39 std::size_t x = boost::unordered::detail::next_prime(value); in test_next_prime()63 BOOST_TEST(boost::unordered::detail::next_prime(0) > 0); in UNORDERED_AUTO_TEST()93 BOOST_TEST(boost::unordered::detail::next_prime(i) == max_prime); in UNORDERED_AUTO_TEST()
73 next_prime (unsigned long int seed) in next_prime() function92 init_size = next_prime (init_size); in hash_init()244 htab->size = next_prime (htab->size * 2); in resize()
84 extern unsigned long int next_prime (unsigned long int seed);
154 next_prime): Use ANSI C function declarations.156 find_entry, iterate_table, lookup, compute_hashval, next_prime,
51 Real next_prime() in next_prime() function in boost::math::differentiation::detail::discrete_legendre151 dlp.next_prime(); in interior_velocity_filter()152 coeffs[l] = dlp.next_prime()/ dlp.norm_sq(l); in interior_velocity_filter()191 coeffs[l] = dlp.next_prime()/ dlp.norm_sq(l); in boundary_velocity_filter()
512 table_size = next_prime (num_contexts * 1.7); in write_qm()
408 hash_tab_size = next_prime ((mlp->nitems * 4) / 3); in write_table()
129 BOOST_CHECK_CLOSE(dlp.next_prime(), dlp.prime(x, k), tol); in test_dlp_next()
326 inline std::size_t next_prime(std::size_t num) in next_prime() function2609 return boost::unordered::detail::next_prime(min); in new_bucket_count()