Home
last modified time | relevance | path

Searched refs:segment_prime_count (Results 1 – 5 of 5) sorted by relevance

/dports/math/p5-Math-Prime-Util/Math-Prime-Util-0.73/
H A Dlehmer.c140 #define segment_prime_count(a, b) primesieve::parallel_count_primes(a, b) macro
637 : lastwpc + segment_prime_count(lastw+1, w); in Pk_2_p()
660 return segment_prime_count(2, n); in legendre_prime_count()
682 return segment_prime_count(2, n); in meissel_prime_count()
700 return segment_prime_count(2, n); in lehmer_prime_count()
707 return segment_prime_count(2,n); in lehmer_prime_count()
750 : lastwpc + segment_prime_count(lastw+1, w); in lehmer_prime_count()
782 return segment_prime_count(2, n); in LMOS_prime_count()
873 else if (!strcasecmp(method, "sieve")) { pi = segment_prime_count(2, n); } in main()
H A Dprime_nth_count.c262 UV segment_prime_count(UV low, UV high) in segment_prime_count() function
338 return segment_prime_count(lo, hi); in prime_count()
342 if (hi < _MPU_LMO_CROSSOVER) return segment_prime_count(lo, hi); in prime_count()
347 return segment_prime_count(lo, hi); in prime_count()
354 if (n < 3000000) return segment_prime_count(2, n); in prime_count_approx()
396 if (n < 33000) return segment_prime_count(2, n); in prime_count_lower()
463 if (n < 33000) return segment_prime_count(2, n); in prime_count_upper()
H A Dprime_nth_count.h7 extern UV segment_prime_count(UV low, UV high);
H A Dlmo.c328 UV a2, iters = (a*a > x) ? segment_prime_count(2,isqrt(x)) : a; in _phi()
579 if (n < _MPU_LMO_CROSSOVER || n < 10000) return segment_prime_count(2, n); in LMO_prime_count()
H A DXS.xs732 default:ret = segment_prime_count(2,n); break;