X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=NEWS;h=b6f609df95c2ee87083120e7d350973b14d90e98;hp=da87a2bbcc9cf27bfe7cd2aaf96a1a5a2c376405;hb=fab89324be435eb99b50b9ee31ea4408843ab704;hpb=8247d44aac20d266d1b135468dacf521ea655f20

diff --git a/NEWS b/NEWS
index da87a2bb..b6f609df 100644
--- a/NEWS
+++ b/NEWS
@@ -1,16 +1,27 @@
 This file records noteworthy changes.
 
-1.2.0 (<insert 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.
-* <iterators>
+* 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)
@@ -22,7 +33,11 @@ This file records noteworthy changes.
 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
   primpart() and matrix::charpoly() now take a "const ex &" instead of a
   "const symbol &".
-* <object fusion>
+* 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
@@ -39,6 +54,76 @@ This file records noteworthy changes.
    - 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.
@@ -207,8 +292,8 @@ This file records noteworthy changes.
 * 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.