Count the number of primes
primecount is a command-line program and C/C++ library that counts the primes below an integer x ≤ 10^31 using highly optimized implementations of the combinatorial prime counting algorithms.
- Developed at devel:libraries:c_c++
- Sources inherited from project openSUSE:Factory
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Backports:SLE-15-SP4:FactoryCandidates/primecount && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| primecount-7.0.tar.gz | 0000323384 316 KB | |
| primecount.changes | 0000001878 1.83 KB | |
| primecount.spec | 0000002605 2.54 KB |
Revision 4 (latest revision is 17)
Dominique Leuenberger (dimstar_suse)
accepted
request 889623
from
Kim Walisch (walki)
(revision 4)
- Update to primecount-7.0 (API & ABI are backwards compatible). - AC.cpp: New algorithm with improved scaling. - AC_libdivide.cpp: New algorithm with improved scaling. - B.cpp: Improved scaling due to independent threads. - P2.cpp: Improved scaling due to independent threads. - LoadBalancerAC.cpp: New thread scheduler for AC algorithm. - LoadBalancerS2.cpp: Improve load balancing of S2_hard & D. - LoadBalancerP2.cpp: Rewritten, now similar to other load balancers. - SegmentedPiTable.cpp: Decrease size to x^(1/4). - util.cpp: Improve scaling using larger default alpha_z = 2. - imath.hpp: Optimize ilog2() & next_power_of_2() using __builtin_clzll().
Comments 0