Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package primecount for openSUSE:Factory checked in at 2026-08-17 16:59:17 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/primecount (Old) and /work/SRC/openSUSE:Factory/.primecount.new.1258 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "primecount" Mon Aug 17 16:59:17 2026 rev:31 rq:1371508 version:8.7 Changes: -------- --- /work/SRC/openSUSE:Factory/primecount/primecount.changes 2026-07-20 10:02:08.413784181 +0200 +++ /work/SRC/openSUSE:Factory/.primecount.new.1258/primecount.changes 2026-08-17 17:02:40.449836309 +0200 @@ -1,0 +2,30 @@ +Sun Aug 16 06:50:00 UTC 2026 - Kim Walisch <[email protected]> + +- Update to primecount-8.7 (API & ABI are backwards compatible). +- primecount now requires C++14 or later (only for building, linking still works with C++11). +- nth_prime_sieve.cpp: Fix rare OpenMP multi-threading bug. +- Fix GCC/Clang -Wundef warnings. +- PiTable.cpp: Add multi-threaded primes vector initialization, GitHub#134. +- FactorTableD.hpp: Reduce Gourdon D memory using 16-bit prime factor ordinals, GitHub#133. +- primecount.pc.in: Add missing libatomic and libquadmath dependencies, GitHub#132. +- primecountConfig.cmake.in: Only find OpenMP when required. +- ci.yml: Add pkg-config and CMake find_package() CI tests. +- D_arm_sve.hpp: Fix GCC ARM SVE failed auto-vectorization, GitHub#130. +- Fix get_max_x() for x > 10^31. +- CmdOptions.cpp: Detect too many input numbers. +- P2.cpp: Fix potential 64-bit integer overflow. +- phi.cpp: Fix phi(x, a) for x >= 4611686065672028281 which requires primes > INT32_MAX. +- lmo/*.cpp: Fix int32_t primes overflow, GitHub#129. +- api.cpp: Fix nth_prime() error message. +- api.cpp: Fix 128-bit nth_prime() for negative inputs. +- main.cpp: Validate 128-bit to 64-bit integer conversions. +- LoadBalancerS2.cpp: Fix Clang scaling issue. +- AC.cpp: Improve clustered easy leaves algorithm using Gourdon's inversion equality. +- AC.cpp: Implement segmented C1 algorithm to improve cache efficiency. +- AC.cpp: Use multi-threading to initialize the libdivide vector. +- util.cpp: Retune Gourdon alpha factors due to improved C algorithm. +- test.cpp: Improve test coverage using alternate alpha_z values. +- doc/Easy-Special-Leaves.pdf: Add description of new C algorithm. +- doc/alpha-factor-gourdon.pdf: Retune Gourdon alpha factors. + +------------------------------------------------------------------- Old: ---- primecount-8.6.tar.gz New: ---- primecount-8.7.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ primecount.spec ++++++ --- /var/tmp/diff_new_pack.GEvDrN/_old 2026-08-17 17:02:41.093859064 +0200 +++ /var/tmp/diff_new_pack.GEvDrN/_new 2026-08-17 17:02:41.098859240 +0200 @@ -17,7 +17,7 @@ Name: primecount -Version: 8.6 +Version: 8.7 Release: 0 Summary: Count the number of primes License: BSD-2-Clause ++++++ primecount-8.6.tar.gz -> primecount-8.7.tar.gz ++++++ ++++ 7618 lines of diff (skipped)
