X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=NEWS;h=68fd8547f68ecd53846252bd34b9ee4f46e8419f;hp=cd011391c89dbf1633d25e6738fb1a20fdbee1dd;hb=00507499530d90533cf029bd503be326d9018138;hpb=b8150271ff497c2ef0c2a8748f5f53b4f1bab7c8 diff --git a/NEWS b/NEWS index cd011391..68fd8547 100644 --- a/NEWS +++ b/NEWS @@ -1,19 +1,28 @@ This file records noteworthy changes. -1.5.0 () +1.5.0 (17 February 2009) * Added polynomial factorization. -* Added an additional (recursive descent) expression parser. -* gcd now allows the user to override (some of the) heuristics. +* New, faster (recursive descent) expression parser. +* Faster GCD computation. +* gcd() now allows the user to override (some of the) heuristics. +* Writing extensions classes is simpler now: + - Replaced custom RTTI by standard C++ RTTI. + - Definition of archiving methods now optional when declaring a new GiNaC class. +* Fixed recursion in polynomial divide that caused a significant slowdown in + sqrfree(). * Improved lsolve() of systems containing non-numeric coefficients. * Removed implicit conversions from cl_N to numeric. +* Improved configuration and compatibility. -1.4.4 () +1.4.4 (7 Nov 2008) * Fixed a bug in the multiple polylogarithms Li/G that caused imaginary parts of the arguments to be ignored. * Fixed archiving of complex numbers. * Made the behaviour of class function more consistent with respect to ncmul::eval(). +* Fixed bug in power::is_polynomial. * Improved heur_gcd() so it can handle rational polynomials. +* Improved build scripts. 1.4.3 (04 April 2008) * Fixed bug in numerical evaluation of multiple polylogarithms and