This file records noteworthy changes.
-1.0.6 (<date>)
+1.3.0 (<insert date>)
+
+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
+ (e.g. "2.0" instead of "2.0000000e+00").
+* function_options::set_return_type() and function_options::do_not_evalf_params()
+ now actually work.
+
+1.0.13 (27 January 2003)
+* Contracting epsilon tensors with Euclidean indices now works.
+* Improved dummy index symmetrization in sums.
+* Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
+ but are single objects, to allow for a more compact notation of Dirac
+ strings.
+* Powers with negative numeric exponents are printed as fractions in the
+ LaTeX output.
+* Added symbolic_matrix() for the convenient creation of matrices filled
+ with symbols.
+* Added collect_common_factors() which collects common factors from the
+ terms of sums.
+* simplify_indexed() converts "gamma~mu*p.mu" to "p\".
+
+1.0.12 (30 October 2002)
+* Fixed a bug in power::expand() that could produce invalid expressions.
+* The input parser no longer ignores extra data following accepted input.
+* Improved the CLN C-source output (integers are printed as integers, and
+ floating point numbers include the precision).
+* Fixed a problem in the LaTeX-output of negative fractions.
+* Added print_latex() and print_csrc() to ginsh.
+* The sprem() function is now public.
+
+1.0.11 (18 September 2002)
+* Fixed a possible memory corruption in contractions of indexed objects with
+ delta or metric tensors.
+* Computing the derivative of a power series object with respect to a symbol
+ that is not the expansion variable now works correctly.
+* Several bugfixes in code generation.
+
+1.0.10 (24 July 2002)
+* Powers of indexed objects are now parenthesized correctly in LaTeX output.
+* Input parser handles indices (they have to be specified in the same list
+ as the symbols).
+* Added some limited support for subspaces in the idx and tensor classes.
+* Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
+ sorted list containing two or more equal objects failed to return 0).
+
+1.0.9 (11 June 2002)
+* simplify_indexed() now raises/lowers dummy indices to canonicalize the index
+ variance. This allows some simplifications that weren't possible before,
+ like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
+* Implemented relational::subs().
+* Fixed bug in simplify_ncmul() for clifford objects.
+
+1.0.8 (31 March 2002)
+* Improvements in memory usage of the expand() methods.
+
+1.0.7 (18 March 2002)
+* Fixed LaTeX output of indexed and matrix objects.
+* Fixed matrix::pow(n) for n==0 and added helper functions to create unit
+ matrices "ex unit_matrix(unsigned, unsigned)".
+
+1.0.6 (4 March 2002)
* "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
1.0.5 (27 January 2002)
* 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.