This file records noteworthy changes.
-1.0.14 (<date>)
+1.5.0 (17 February 2009)
+* Added polynomial factorization.
+* Added an additional (recursive descent) expression parser.
+* Faster GCD computation.
+* gcd() now allows the user to override (some of the) heuristics.
+* Replaced custum 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 (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
+ alternating multiple zeta values introduced in version 1.4.2.
+* Nielsen polylog now invalidates its lookup tables in case the precision
+ (Digits) has been changed.
+* Added new checks for recent bugs in the numerical evaluation of Li and zeta.
+
+1.4.2 (03 April 2008)
+* Fixed VPATH building of documentation.
+* Fixed bug in numerical evaluation of multiple polylogarithms for arguments
+ equal to certain roots of unity (thanks to Jianqiang Zhao).
+* Fixed check for memory leakage in parser.
+* Made internal function coerce() standard compliant.
+* Improved lsolve() of systems containing non-numeric coefficients.
+* Improved automatic test programs. Now they work on MinGW and Cygwin as well.
+
+1.4.1 (21 November 2007)
+* Fixed memory leak in ginac_yylex().
+* Fixed memory leaks in mul::eval() and power::eval().
+* Fixed macro checking for version of libreadline (Mac OS X).
+* Fixed broken preprocessor instruction in excompiler.cpp.
+* Fixed broken module loading in excompiler.cpp.
+* info(info_flags::has_indices) now works for sums and products.
+* Improved mul::expand().
+* Improved CLN output.
+
+1.4.0 (31 August 2007)
+* New tinfo mechanism.
+* Removed rtt from class symbol.
+* Faster archiving by adding a map from strings to indices in the atoms vector.
+* Improved unarchiving: algorithms order N instead of order N^2.
+* Added compile function, excompiler class.
+* Added exset type.
+* Added step function to GiNaCs built-in functions.
+* Added is_polynomial() method.
+* Added real_part() and imag_part() methods.
+* Added matrix::is_zero_matrix() method.
+* Added evalm() method to pseries class.
+* Improved dummy index renaming.
+* Many improvements for class clifford.
+* New flag for positive symbols/numbers, added possymbol class.
+* Added programming examples in doc/examples
+
+1.3.8 (28 August 2007)
+* Drop support of ginac-config and ginac.m4. Please use pkg-config instead.
+* atan2(y,x) branch cut correction.
+* Fixed bug in series expansion.
+* Additional transformations for mul and power.
+* Clifford units now honor representation labels.
+* Correct csrc output for idx and fderivative.
+* Improved handling of convergence transformationis for Li/G.
+* Fix compilation issues with prereleases of GCC 4.3.
+* info_flags::expanded added.
+* input_parser also accepts pow().
+* texinfo.tex removed from package.
+
+1.3.7 (05 February 2007)
+* Fixed bug in expansion of power.
+* Fixed bugs in functions S() (infinite loop), H() and zeta() (wrong results).
+* Rebuilt bison related files with bison version 2.3 (fixes parse error bugs).
+* Improved power::eval().
+* Improved libreadline detection.
+
+1.3.6 (13 December 2006)
+* Better worst case behavior in heuristic gcd.
+* Improved collecting for sparse multivariate polynomials.
+* Improved collect_common_factors.
+* Fixed bug in numerical evaluation of multiple polylogs.
+* Fixed numerical integration of complex functions.
+* Fixed bug in tensor::replace_contr_index().
+
+1.3.5 (17 August 2006)
+* Re-built bison related files that caused bugs with gcc 4.
+* Fixed bugs in fderivative::match_same_type(), expairseq::match(),
+ expand_dummy_sum(), and expairseq::map().
+* Fixed template specialization for class container to be gcc 4.2 compliant.
+* Output in csrc mode is now -x instead of -1.0*x.
+* Fixed tutorial and reference generation in html/pdf/ps format.
+* Modified autotool configuration to allow for compilation on MinGW.
+* Debian packaging files updated.
+
+1.3.4 (12 April 2006)
+* More general index dimensions are now possible.
+* Improved algebraic substitutions.
+* Fixed wrong matching in .has().
+* Fixed bug in differentiation of a power.
+* collect_common_factors also works with negative powers of common factors now.
+* Code clean-up and preparations for upcoming cln 1.2.
+
+1.3.3 (24 October 2005)
+* Fixed bug occuring in algebraic substitutions with expressions involving
+ indices.
+* Fixed bug that selected the wrong algorithm for determinants of purely
+ numeric matrices with at least one floating point element.
+* Fixed bug in function H that caused an infinite recursion for arguments
+ around +-I.
+* Fixed const-correctness in printing handler for GCC 4.0.2.
+* Made lookup in adaptivesimpson precision-aware.
+* Added series expansion for functions (classical) Li and S around x==0.
+* Added fsolve() numerical univariate real-valued function solver.
+* Added functions sub_matrix() and reduced_matrix().
+* Small cleanups. Less warnings with latest GCC.
+
+1.3.2 (10 July 2005)
+* GCD avoids to produce expanded expressions.
+* Fixed bug in expanding expressions containing dummy indices.
+* Fixed static initialization order bug.
+* collect_common_factors now works with powers.
+* Modernized configuration scripts.
+
+1.3.1 (04 May 2005)
+* integral() and eval_integ() can be used from ginsh.
+* Integrals can be series-expanded.
+* Fixed a library initialization problem.
+* GiNaC compiles from tarball even if lex/flex is missing.
+* Fixed bugs in canonicalize_clifford(), clifford_prime() and clifford_to_lst().
+* clifford_moebius_map(), remove_dirac_ONE() and LaTeX output of Clifford
+ objects now care about representation labels.
+* Fixed bug in gcd.
+* Better output for slashed expressions
+
+1.3.0 (19 October 2004)
+* The Clifford classes have been generalized to allow working with Clifford
+ algebras generated by arbitrary symmetric tensors or matrices. Also, a lot
+ of new functions for Clifford algebras have been added, including
+ automorphisms and Moebius transformations. [V. Kisil]
+* Added some basic symbolic and numeric integration facilities. [C. Dams]
+* The multiple polylogarithm Li() now evaluates numerically for arbitrary
+ arguments.
+* New functions G(a,y) and G(a,s,y) added (another notation for multiple
+ polylogarithms).
+
+1.2.4 (12 October 2004)
+* Added ex::unitcontprim() to compute the unit, content, and primitive parts
+ of a polynomial in one go.
+* binomial(n, k) evaluates for non-integer arguments n.
+* Li(2,x) now evaluates for +-I.
+* Optimized Li(2,x).
+* Fixed bug in Li(n,x) (if Li(2,x) was calculated with high precision the
+ enlargement of the look-up table caused a segmentation fault).
+* Fixed another bug in the series expansion of powers, and a bug in
+ power::info().
+
+1.2.3 (13 August 2004)
+* Added variants of dirac_trace() and color_trace() that take the trace over
+ more than one representation label by specifying a set or list of labels.
+* diracgamma::contract_with() uses Chisholm identities in 4 dimensions to
+ produce more compact results.
+* Fixed a bug in the series expansion of powers.
+* The --enable-html-doc and --enable-ps-doc configure options are gone.
+ Documentation in HTML, DVI, PostScript, and PDF formats is now built with
+ "make html", "make dvi", "make ps", and "make pdf", respectively. The only
+ documentation that gets built by default are the tutorial in .info format
+ and the manpages.
+
+1.2.2 (3 August 2004)
+* Added const_preorder_iterator and const_postorder_iterator classes (and
+ associated methods ex::pre/postorder_begin/end()) providing tree traversal
+ with iterators.
+* Fixed the LaTeX output of the varidx class.
+* Fixed bugs in series expansion and complex conjugation.
+* (p.i*p.i).get_free_indices() returns the correct result () instead of (.i).
+* Symbolic functions without any eval(), evalf() etc. functions now work
+ properly.
+* integer_content(), content(), and primpart() now also work for polynomials
+ with rational coefficients (calculating the LCM of coefficients'
+ denominators).
+* Added method matrix::rank().
+* Added function resultant().
+* Added integer_content() function to ginsh.
+
+1.2.1 (23 April 2004)
+* Fixed infinite recursion in atan2_evalf() and improved atan2_eval().
+* Added automatic evaluations for trigonometric functions with negative
+ arguments (e.g. sin(-2) -> -sin(2)).
+* Fixed a static initialization order goof-up.
+* Fixed various bugs in series expansion.
+
+1.2.0 (19 March 2004)
+* Added a structure<T> template class for the easy creation of user-defined
+ algebraic classes.
+* Added support for (acyclic) visitors, to allow cleaner implementations of
+ algebraic algorithms.
+* Added a const_iterator class that can be used instead of op()/nops().
+* Completely revamped the implementation of expression output. It is now
+ possible to add new output formats, to change the behavior of predefined
+ formats at run-time, and to have different output styles for algebraic
+ functions.
+* Symbols can be made non-commutative.
+* Added a method ex::conjugate() and a function conjugate() for complex
+ conjugation. Symbols can be declared as real or complex-valued.
+* Improved the speed of subs(), normal(), to_rational() and to_polynomial()
+ by the use of maps instead of lists. The old forms
+ subs(const lst & ls, const lst & lr, unsigned options)
+ to_rational/to_polynomial(lst & repl)
+ are still available for compatibility, but using the new forms
+ subs(const exmap & m, unsigned options)
+ to_rational/to_polynomial(exmap & repl)
+ is more efficient, especially when the number of replacements is large.
+* quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
+ primpart() and matrix::charpoly() now take a "const ex &" instead of a
+ "const symbol &".
+* Redundant expressions (two ex pointing to different objects are found to be
+ equal in compare()) are now actively deleted/fused to conserve memory and
+ speed up subsequent comparisons. This behavior can be suppressed on a
+ per-object level with status_flags::not_shareable. Lists and matrices are
+ not shareable by default.
+* Lots of internal streamlining and optimizations.
+* Caveats for class implementors:
+ - basic::copy() and basic::destroy() are gone; classes derived from
+ basic can use the defaults for the assignment operator and copy
+ constructor.
+ - basic::subs(), basic::normal(), basic::to_rational() and
+ basic::to_polynomial() take 'exmap' objects instead of lists.
+ - basic::subs() now descends into subexpressions (if accessible via
+ nops()/op()/let_op()). If you have a custom implementation of subs()
+ that calls basic::subs() after substituting subexpressions, this needs
+ to be changed to a call to subs_one_level().
+ - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
+ - thiscontainer() and associated constructors now take a std::auto_ptr.
+ - Overloading basic::print() is now deprecated. You should use
+ print_func<>() class options instead.
+
+1.1.7 (11 March 2004)
+* Fixed a bug in canonicalize_clifford().
+* Series expansion now works predictably. All terms with the exponent of the
+ expansion variable smaller than the given order are calculated exactly. If
+ the series is not terminating, the Order function is (at least) of the given
+ order.
+
+1.1.6 (22 January 2004)
+* Added a function option "dummy()" which means "no options". This simplifies
+ the implementation of symbolic functions which are not to be further
+ evaluated.
+* Removed a bug in the numerical evaluation of Li() that caused the system
+ to hang for certain parameter combinations.
+* Fixed a bug in the calculation of hash values for indices that could lead
+ to wrong results or bogus error messages from simplify_indexed().
+* Fixed a bug in the evaluation of harmonic polylogarithms for complex
+ arguments with positive imaginary part.
+
+1.1.5 (5 November 2003)
+* Harmonic polylogarithms now numerically evaluate for arbitrary arguments
+ (parameter must still be positive integers).
+* The zeta function now can also be given a lst as a parameter in which case
+ it becomes a multiple zeta value. The use of mZeta is deprecated.
+* The order of parameters for the multiple polylogarithm has been corrected.
+* Documentation for the nested sums functions zeta, harmonic polylog, multiple
+ polylog, etc. has been added.
+
+1.1.4 (17 October 2003)
+* Lists and matrices can now be initialized from comma-separated lists of
+ expressions, like this:
+
+ lst l;
+ l = x, 2, y, x+y;
+
+ matrix M(3, 3);
+ M = x, y, 0,
+ -y, x, 0,
+ 0, 0, 1;
+
+ This is both faster and produces much smaller code than the old constructors
+ lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
+ of matrices, and is now the recommended way to create these objects.
+* The function mZeta now evaluates much faster for arbitrary parameters. The
+ harmonic and multiple polylogarithms evaluate considerably faster and check
+ for convergence. The order of parameters for the harmonic polylogarithm
+ has been corrected.
+
+1.1.3 (22 August 2003)
+* Added new symbolic functions for better integration with nestedsums:
+ (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
+ harmonic polylogarithm H(), and multiple zeta value mZeta().
+* New exhashmap<T> template intended as a drop-in replacement for
+ std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
+
+1.1.2 (11 August 2003)
+* Fixed a bug in the unarchiving of sums and products: terms were not
+ reordered in a canonical way.
+* Fixed a bug in normal()/numer_denom(): denominator was not made unit
+ normal if it was a simple number.
+* Improved the speed of subs() in some cases.
+
+1.1.1 (18 June 2003)
+* lst (and exprseq) provide iterators for read-only element access. For
+ sequential access this is one order faster than using op().
+* Implemented relational::subs() (this was done in 1.0.9 but inadvertently
+ omitted from the 1.1 branch).
+* pole_error and do_taylor are available to library users.
+* Added on-line help and Tab-completion for print(), iprint(), print_latex()
+ and print_csrc() in ginsh.
+
+1.1.0 (3 April 2003)
+* Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
+* The scalar_products mechanism allows the specification of an index dimension.
+* Removed dirac_gamma6/7().
+* Added ex::to_polynomial().
+* subs() accepts an optional "options" argument. The option
+ subs_option::subs_algebraic enables "smart" substitutions in products and
+ powers.
+* Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
+ "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
+ "no_index_dimensions" to control the output format. Calling basic::print()
+ directly is now deprecated.
+* Made the hashing more simple and efficient.
+* Caveats for class implementors:
+ - basic::subs(): third argument changed from "bool" to "unsigned"
+ - unarchiving constructor and basic::unarchive(): "const" removed from
+ second argument
+ - basic::let_op() should only be implemented if write access to
+ subexpressions is desired
+ - simplify_ncmul() renamed to eval_ncmul()
+ - simplified_ncmul() renamed to hold_ncmul()
+ - nonsimplified_ncmul() renamed to reeval_ncmul()
+
+1.0.14 (1 March 2003)
* Improved the C-source output: complex numbers are printed correctly (using
the STL complex<> template or cln::complex()), rational numbers use cl_RA()
in the CLN output, and small integers are printed in a more compact format
* Supplement some (now deprecated) macros by inlined template functions:
- is_of_type(foo, type) -> is_a<type>(foo)
- is_ex_of_type(foo, type) -> is_a<type>(foo)
- - is_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
- - is_ex_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
+ - is_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
+ - is_ex_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
- ex_to_foobar(baz) -> ex_to<foobar>(baz)
* rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
instead of c.