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 4ffb3cbb3ab5f642e461bcbf8fb29743752c5d58 (commit) from 51c4b683827bc6fc427cb5c8ca789a4c9465e021 (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 4ffb3cbb3ab5f642e461bcbf8fb29743752c5d58 Author: Richard Kreckel <kreckel@ginac.de> Date: Wed Jan 24 22:37:24 2018 +0100 Speed up special cases of square-free factorization. Square-free factorization of polynomials containing a factor which is a high power P of a symbol x did scale like O(P) in space and time. This patch introduces a shortcut in Yun's algorithm, such that the computation is only O(1) in space and time. This makes it possible to compute, say sqrfree(x^P + x^(P+1)) => (1+x)*x^P with P=123456789. Found this to be a bottleneck while debugging one of Vitaly Magerya's examples. ----------------------------------------------------------------------- Summary of changes: ginac/normal.cpp | 78 +++++++++++++++++++++++++++++--------------------------- 1 file changed, 40 insertions(+), 38 deletions(-) hooks/post-receive -- GiNaC -- a C++ library for symbolic computations