This is an automated email from the git hooks/post-receive script. It was generated because a ref change was pushed to the repository containing the project "GiNaC -- a C++ library for symbolic computations". The branch, master has been updated via f1a824bb5b7535c26c75ef03615179680c0f9753 (commit) via cdddbc6dcdabef73aeb20bb9b81e08dba92a235c (commit) from c2ef6cb074a85957bd684337552fe9d84451d307 (commit) Those revisions listed above that are new to this repository have not appeared on any other notification email; so we list those revisions in full, below. - Log ----------------------------------------------------------------- commit f1a824bb5b7535c26c75ef03615179680c0f9753 Author: Richard Kreckel <kreckel@ginac.de> Date: Mon Aug 3 18:20:27 2020 +0200 Make workarounds for sqrfree_yun() obsolete. Since Yun's algorithm is based on polynomial GCD, it only finds factors up to a unit. Callers shouldn't have to work around this, so sqrfree_yun() now does a final polynomial long division to compute the lost factor and fixes the result before returning. commit cdddbc6dcdabef73aeb20bb9b81e08dba92a235c Author: Richard Kreckel <kreckel@ginac.de> Date: Mon Aug 3 18:09:30 2020 +0200 [BUGFIX] Fix factor_univariate(poly, x) for constant poly. The modular factorization fails to find a prime in this case, leading to an infinite loop. At least one caller (factor_sqrfree) happens to produce such constant polys in some cases. ----------------------------------------------------------------------- Summary of changes: check/exam_factor.cpp | 7 ++---- ginac/factor.cpp | 7 ++++-- ginac/normal.cpp | 70 ++++++++++++++++++++++++++++----------------------- 3 files changed, 46 insertions(+), 38 deletions(-) hooks/post-receive -- GiNaC -- a C++ library for symbolic computations