1 This file records noteworthy changes.
4 * Added polynomial factorization.
5 * Added an additional (recursive descent) expression parser.
6 * gcd now allows the user to override (some of the) heuristics.
7 * Replaced custum RTTI by standard C++ RTTI.
8 * Definition of archiving methods now optional when declaring a new GiNaC class.
9 * Fixed recursion in polynomial divide that caused a significant slowdown in
11 * Improved lsolve() of systems containing non-numeric coefficients.
12 * Removed implicit conversions from cl_N to numeric.
13 * Improved configuration and compatibility.
16 * Fixed a bug in the multiple polylogarithms Li/G that caused imaginary parts
17 of the arguments to be ignored.
18 * Fixed archiving of complex numbers.
19 * Made the behaviour of class function more consistent with respect to
21 * Fixed bug in power::is_polynomial.
22 * Improved heur_gcd() so it can handle rational polynomials.
23 * Improved build scripts.
26 * Fixed bug in numerical evaluation of multiple polylogarithms and
27 alternating multiple zeta values introduced in version 1.4.2.
28 * Nielsen polylog now invalidates its lookup tables in case the precision
29 (Digits) has been changed.
30 * Added new checks for recent bugs in the numerical evaluation of Li and zeta.
33 * Fixed VPATH building of documentation.
34 * Fixed bug in numerical evaluation of multiple polylogarithms for arguments
35 equal to certain roots of unity (thanks to Jianqiang Zhao).
36 * Fixed check for memory leakage in parser.
37 * Made internal function coerce() standard compliant.
38 * Improved lsolve() of systems containing non-numeric coefficients.
39 * Improved automatic test programs. Now they work on MinGW and Cygwin as well.
41 1.4.1 (21 November 2007)
42 * Fixed memory leak in ginac_yylex().
43 * Fixed memory leaks in mul::eval() and power::eval().
44 * Fixed macro checking for version of libreadline (Mac OS X).
45 * Fixed broken preprocessor instruction in excompiler.cpp.
46 * Fixed broken module loading in excompiler.cpp.
47 * info(info_flags::has_indices) now works for sums and products.
48 * Improved mul::expand().
49 * Improved CLN output.
51 1.4.0 (31 August 2007)
52 * New tinfo mechanism.
53 * Removed rtt from class symbol.
54 * Faster archiving by adding a map from strings to indices in the atoms vector.
55 * Improved unarchiving: algorithms order N instead of order N^2.
56 * Added compile function, excompiler class.
58 * Added step function to GiNaCs built-in functions.
59 * Added is_polynomial() method.
60 * Added real_part() and imag_part() methods.
61 * Added matrix::is_zero_matrix() method.
62 * Added evalm() method to pseries class.
63 * Improved dummy index renaming.
64 * Many improvements for class clifford.
65 * New flag for positive symbols/numbers, added possymbol class.
66 * Added programming examples in doc/examples
68 1.3.8 (28 August 2007)
69 * Drop support of ginac-config and ginac.m4. Please use pkg-config instead.
70 * atan2(y,x) branch cut correction.
71 * Fixed bug in series expansion.
72 * Additional transformations for mul and power.
73 * Clifford units now honor representation labels.
74 * Correct csrc output for idx and fderivative.
75 * Improved handling of convergence transformationis for Li/G.
76 * Fix compilation issues with prereleases of GCC 4.3.
77 * info_flags::expanded added.
78 * input_parser also accepts pow().
79 * texinfo.tex removed from package.
81 1.3.7 (05 February 2007)
82 * Fixed bug in expansion of power.
83 * Fixed bugs in functions S() (infinite loop), H() and zeta() (wrong results).
84 * Rebuilt bison related files with bison version 2.3 (fixes parse error bugs).
85 * Improved power::eval().
86 * Improved libreadline detection.
88 1.3.6 (13 December 2006)
89 * Better worst case behavior in heuristic gcd.
90 * Improved collecting for sparse multivariate polynomials.
91 * Improved collect_common_factors.
92 * Fixed bug in numerical evaluation of multiple polylogs.
93 * Fixed numerical integration of complex functions.
94 * Fixed bug in tensor::replace_contr_index().
96 1.3.5 (17 August 2006)
97 * Re-built bison related files that caused bugs with gcc 4.
98 * Fixed bugs in fderivative::match_same_type(), expairseq::match(),
99 expand_dummy_sum(), and expairseq::map().
100 * Fixed template specialization for class container to be gcc 4.2 compliant.
101 * Output in csrc mode is now -x instead of -1.0*x.
102 * Fixed tutorial and reference generation in html/pdf/ps format.
103 * Modified autotool configuration to allow for compilation on MinGW.
104 * Debian packaging files updated.
106 1.3.4 (12 April 2006)
107 * More general index dimensions are now possible.
108 * Improved algebraic substitutions.
109 * Fixed wrong matching in .has().
110 * Fixed bug in differentiation of a power.
111 * collect_common_factors also works with negative powers of common factors now.
112 * Code clean-up and preparations for upcoming cln 1.2.
114 1.3.3 (24 October 2005)
115 * Fixed bug occuring in algebraic substitutions with expressions involving
117 * Fixed bug that selected the wrong algorithm for determinants of purely
118 numeric matrices with at least one floating point element.
119 * Fixed bug in function H that caused an infinite recursion for arguments
121 * Fixed const-correctness in printing handler for GCC 4.0.2.
122 * Made lookup in adaptivesimpson precision-aware.
123 * Added series expansion for functions (classical) Li and S around x==0.
124 * Added fsolve() numerical univariate real-valued function solver.
125 * Added functions sub_matrix() and reduced_matrix().
126 * Small cleanups. Less warnings with latest GCC.
129 * GCD avoids to produce expanded expressions.
130 * Fixed bug in expanding expressions containing dummy indices.
131 * Fixed static initialization order bug.
132 * collect_common_factors now works with powers.
133 * Modernized configuration scripts.
136 * integral() and eval_integ() can be used from ginsh.
137 * Integrals can be series-expanded.
138 * Fixed a library initialization problem.
139 * GiNaC compiles from tarball even if lex/flex is missing.
140 * Fixed bugs in canonicalize_clifford(), clifford_prime() and clifford_to_lst().
141 * clifford_moebius_map(), remove_dirac_ONE() and LaTeX output of Clifford
142 objects now care about representation labels.
144 * Better output for slashed expressions
146 1.3.0 (19 October 2004)
147 * The Clifford classes have been generalized to allow working with Clifford
148 algebras generated by arbitrary symmetric tensors or matrices. Also, a lot
149 of new functions for Clifford algebras have been added, including
150 automorphisms and Moebius transformations. [V. Kisil]
151 * Added some basic symbolic and numeric integration facilities. [C. Dams]
152 * The multiple polylogarithm Li() now evaluates numerically for arbitrary
154 * New functions G(a,y) and G(a,s,y) added (another notation for multiple
157 1.2.4 (12 October 2004)
158 * Added ex::unitcontprim() to compute the unit, content, and primitive parts
159 of a polynomial in one go.
160 * binomial(n, k) evaluates for non-integer arguments n.
161 * Li(2,x) now evaluates for +-I.
163 * Fixed bug in Li(n,x) (if Li(2,x) was calculated with high precision the
164 enlargement of the look-up table caused a segmentation fault).
165 * Fixed another bug in the series expansion of powers, and a bug in
168 1.2.3 (13 August 2004)
169 * Added variants of dirac_trace() and color_trace() that take the trace over
170 more than one representation label by specifying a set or list of labels.
171 * diracgamma::contract_with() uses Chisholm identities in 4 dimensions to
172 produce more compact results.
173 * Fixed a bug in the series expansion of powers.
174 * The --enable-html-doc and --enable-ps-doc configure options are gone.
175 Documentation in HTML, DVI, PostScript, and PDF formats is now built with
176 "make html", "make dvi", "make ps", and "make pdf", respectively. The only
177 documentation that gets built by default are the tutorial in .info format
180 1.2.2 (3 August 2004)
181 * Added const_preorder_iterator and const_postorder_iterator classes (and
182 associated methods ex::pre/postorder_begin/end()) providing tree traversal
184 * Fixed the LaTeX output of the varidx class.
185 * Fixed bugs in series expansion and complex conjugation.
186 * (p.i*p.i).get_free_indices() returns the correct result () instead of (.i).
187 * Symbolic functions without any eval(), evalf() etc. functions now work
189 * integer_content(), content(), and primpart() now also work for polynomials
190 with rational coefficients (calculating the LCM of coefficients'
192 * Added method matrix::rank().
193 * Added function resultant().
194 * Added integer_content() function to ginsh.
196 1.2.1 (23 April 2004)
197 * Fixed infinite recursion in atan2_evalf() and improved atan2_eval().
198 * Added automatic evaluations for trigonometric functions with negative
199 arguments (e.g. sin(-2) -> -sin(2)).
200 * Fixed a static initialization order goof-up.
201 * Fixed various bugs in series expansion.
203 1.2.0 (19 March 2004)
204 * Added a structure<T> template class for the easy creation of user-defined
206 * Added support for (acyclic) visitors, to allow cleaner implementations of
207 algebraic algorithms.
208 * Added a const_iterator class that can be used instead of op()/nops().
209 * Completely revamped the implementation of expression output. It is now
210 possible to add new output formats, to change the behavior of predefined
211 formats at run-time, and to have different output styles for algebraic
213 * Symbols can be made non-commutative.
214 * Added a method ex::conjugate() and a function conjugate() for complex
215 conjugation. Symbols can be declared as real or complex-valued.
216 * Improved the speed of subs(), normal(), to_rational() and to_polynomial()
217 by the use of maps instead of lists. The old forms
218 subs(const lst & ls, const lst & lr, unsigned options)
219 to_rational/to_polynomial(lst & repl)
220 are still available for compatibility, but using the new forms
221 subs(const exmap & m, unsigned options)
222 to_rational/to_polynomial(exmap & repl)
223 is more efficient, especially when the number of replacements is large.
224 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
225 primpart() and matrix::charpoly() now take a "const ex &" instead of a
227 * Redundant expressions (two ex pointing to different objects are found to be
228 equal in compare()) are now actively deleted/fused to conserve memory and
229 speed up subsequent comparisons. This behavior can be suppressed on a
230 per-object level with status_flags::not_shareable. Lists and matrices are
231 not shareable by default.
232 * Lots of internal streamlining and optimizations.
233 * Caveats for class implementors:
234 - basic::copy() and basic::destroy() are gone; classes derived from
235 basic can use the defaults for the assignment operator and copy
237 - basic::subs(), basic::normal(), basic::to_rational() and
238 basic::to_polynomial() take 'exmap' objects instead of lists.
239 - basic::subs() now descends into subexpressions (if accessible via
240 nops()/op()/let_op()). If you have a custom implementation of subs()
241 that calls basic::subs() after substituting subexpressions, this needs
242 to be changed to a call to subs_one_level().
243 - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
244 - thiscontainer() and associated constructors now take a std::auto_ptr.
245 - Overloading basic::print() is now deprecated. You should use
246 print_func<>() class options instead.
248 1.1.7 (11 March 2004)
249 * Fixed a bug in canonicalize_clifford().
250 * Series expansion now works predictably. All terms with the exponent of the
251 expansion variable smaller than the given order are calculated exactly. If
252 the series is not terminating, the Order function is (at least) of the given
255 1.1.6 (22 January 2004)
256 * Added a function option "dummy()" which means "no options". This simplifies
257 the implementation of symbolic functions which are not to be further
259 * Removed a bug in the numerical evaluation of Li() that caused the system
260 to hang for certain parameter combinations.
261 * Fixed a bug in the calculation of hash values for indices that could lead
262 to wrong results or bogus error messages from simplify_indexed().
263 * Fixed a bug in the evaluation of harmonic polylogarithms for complex
264 arguments with positive imaginary part.
266 1.1.5 (5 November 2003)
267 * Harmonic polylogarithms now numerically evaluate for arbitrary arguments
268 (parameter must still be positive integers).
269 * The zeta function now can also be given a lst as a parameter in which case
270 it becomes a multiple zeta value. The use of mZeta is deprecated.
271 * The order of parameters for the multiple polylogarithm has been corrected.
272 * Documentation for the nested sums functions zeta, harmonic polylog, multiple
273 polylog, etc. has been added.
275 1.1.4 (17 October 2003)
276 * Lists and matrices can now be initialized from comma-separated lists of
277 expressions, like this:
287 This is both faster and produces much smaller code than the old constructors
288 lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
289 of matrices, and is now the recommended way to create these objects.
290 * The function mZeta now evaluates much faster for arbitrary parameters. The
291 harmonic and multiple polylogarithms evaluate considerably faster and check
292 for convergence. The order of parameters for the harmonic polylogarithm
295 1.1.3 (22 August 2003)
296 * Added new symbolic functions for better integration with nestedsums:
297 (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
298 harmonic polylogarithm H(), and multiple zeta value mZeta().
299 * New exhashmap<T> template intended as a drop-in replacement for
300 std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
302 1.1.2 (11 August 2003)
303 * Fixed a bug in the unarchiving of sums and products: terms were not
304 reordered in a canonical way.
305 * Fixed a bug in normal()/numer_denom(): denominator was not made unit
306 normal if it was a simple number.
307 * Improved the speed of subs() in some cases.
310 * lst (and exprseq) provide iterators for read-only element access. For
311 sequential access this is one order faster than using op().
312 * Implemented relational::subs() (this was done in 1.0.9 but inadvertently
313 omitted from the 1.1 branch).
314 * pole_error and do_taylor are available to library users.
315 * Added on-line help and Tab-completion for print(), iprint(), print_latex()
316 and print_csrc() in ginsh.
319 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
320 * The scalar_products mechanism allows the specification of an index dimension.
321 * Removed dirac_gamma6/7().
322 * Added ex::to_polynomial().
323 * subs() accepts an optional "options" argument. The option
324 subs_option::subs_algebraic enables "smart" substitutions in products and
326 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
327 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
328 "no_index_dimensions" to control the output format. Calling basic::print()
329 directly is now deprecated.
330 * Made the hashing more simple and efficient.
331 * Caveats for class implementors:
332 - basic::subs(): third argument changed from "bool" to "unsigned"
333 - unarchiving constructor and basic::unarchive(): "const" removed from
335 - basic::let_op() should only be implemented if write access to
336 subexpressions is desired
337 - simplify_ncmul() renamed to eval_ncmul()
338 - simplified_ncmul() renamed to hold_ncmul()
339 - nonsimplified_ncmul() renamed to reeval_ncmul()
341 1.0.14 (1 March 2003)
342 * Improved the C-source output: complex numbers are printed correctly (using
343 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
344 in the CLN output, and small integers are printed in a more compact format
345 (e.g. "2.0" instead of "2.0000000e+00").
346 * function_options::set_return_type() and function_options::do_not_evalf_params()
349 1.0.13 (27 January 2003)
350 * Contracting epsilon tensors with Euclidean indices now works.
351 * Improved dummy index symmetrization in sums.
352 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
353 but are single objects, to allow for a more compact notation of Dirac
355 * Powers with negative numeric exponents are printed as fractions in the
357 * Added symbolic_matrix() for the convenient creation of matrices filled
359 * Added collect_common_factors() which collects common factors from the
361 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
363 1.0.12 (30 October 2002)
364 * Fixed a bug in power::expand() that could produce invalid expressions.
365 * The input parser no longer ignores extra data following accepted input.
366 * Improved the CLN C-source output (integers are printed as integers, and
367 floating point numbers include the precision).
368 * Fixed a problem in the LaTeX-output of negative fractions.
369 * Added print_latex() and print_csrc() to ginsh.
370 * The sprem() function is now public.
372 1.0.11 (18 September 2002)
373 * Fixed a possible memory corruption in contractions of indexed objects with
374 delta or metric tensors.
375 * Computing the derivative of a power series object with respect to a symbol
376 that is not the expansion variable now works correctly.
377 * Several bugfixes in code generation.
379 1.0.10 (24 July 2002)
380 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
381 * Input parser handles indices (they have to be specified in the same list
383 * Added some limited support for subspaces in the idx and tensor classes.
384 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
385 sorted list containing two or more equal objects failed to return 0).
388 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
389 variance. This allows some simplifications that weren't possible before,
390 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
391 * Implemented relational::subs().
392 * Fixed bug in simplify_ncmul() for clifford objects.
394 1.0.8 (31 March 2002)
395 * Improvements in memory usage of the expand() methods.
397 1.0.7 (18 March 2002)
398 * Fixed LaTeX output of indexed and matrix objects.
399 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
400 matrices "ex unit_matrix(unsigned, unsigned)".
403 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
405 1.0.5 (27 January 2002)
406 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
407 of any class (except add/mul/ncmul/numeric) for "s". They should even work
408 if "s" is a "power" object, as long as the exponent is non-integer, but with
409 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
410 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
411 * Fixed a small output bug.
413 1.0.4 (24 January 2002)
414 * Speedup in expand().
415 * Faster Bernoulli numbers (Markus Nullmeier).
416 * Some minor bugfixes and documentation updates.
418 1.0.3 (21 December 2001)
419 * Fixed a bug where quo() would call vector::reserve() with a negative
421 * Fix several bugs in code generation.
423 1.0.2 (19 December 2001)
424 * Input parser recognizes "sqrt()", which is also used in the output.
425 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
427 * Fixed small bug in dummy index renaming which could cause it to not
428 recognize renamable indices in some cases.
429 * power::degree() and power::ldegree() throw an exception when encountering
430 a non-integer exponent.
431 * Add output-support for Python bindings.
433 1.0.1 (22 November 2001)
434 * Function sqrfree() handles a few more cases now.
435 * Class relational has real canonical ordering now.
436 * Handle obscene libreadline version numbers when building ginsh.
438 1.0.0 (6 November 2001)
439 * Some internal reorganization resulting in a general speed-up.
440 * The last 3 evaluated expressions in ginsh are now referred to with the
441 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
442 compatibility but may be removed in a future version of GiNaC.
444 0.9.4 (20 September 2001)
445 * Functions have better support for external scripting languages.
446 * Interface cleanups and bugfixes.
447 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
449 0.9.3 (16 August 2001)
450 * series expansion now much more consistent for small order expansion.
451 * lsolve() accepts algorithmic hint as parameter.
454 * Epsilon tensor is more functional.
455 * simplify_indexed() is better at detecting expressions that vanish for
457 * Several little bugfixes and consistency enhancements.
460 * Ctors of class numeric are not explicit any more. All built-in callers for
461 pseudofunctions are now templated and default to ex arguments which relaxes
462 the need for explicit ctors.
463 * New functions/methods:
465 - remove_first(), remove_last(), sort() and unique() for lists
466 - symmetrize_cyclic()
468 * Instead of just totally symmetric or antisymmetric, complex symmetries
469 can now be defined for indexed objects. Symmetries are described by a
470 tree of "symmetry" objects that is constructed with the sy_none(),
471 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
472 with respect to its arguments can also be defined (this is currently
473 only used for the Beta function).
474 * Generalized map() to take a function object instead of a function pointer.
475 This allows passing an arbitrary number of additional state to the
476 function being called.
477 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
478 better with container classes, e.g. using color_trace() on a relation will
479 take the trace on both sides, using diff() on a matrix differentiates every
481 * diff() works properly with non-commutative products and indexed objects.
482 * New option flag "expand_function_args" for expand().
483 * Supplement some (now deprecated) macros by inlined template functions:
484 - is_of_type(foo, type) -> is_a<type>(foo)
485 - is_ex_of_type(foo, type) -> is_a<type>(foo)
486 - is_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
487 - is_ex_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
488 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
489 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
491 * Small bugfixes in pattern matching.
492 * Updated libtool to version 1.4.
495 * In the output and in ginsh, lists are now delimited by { } braces, and
496 matrices are delimited by single [ ] brackets.
497 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
498 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
499 * New functions/methods:
500 - canonicalize_clifford() (helpful when comparing expressions containing
502 - symmetrize() and antisymmetrize()
503 - numer_denom() (return numerator and denominator in one call)
504 - map() (apply function to subexpressions)
505 - evalm() (evaluate sums, products and integer powers of matrices)
506 * Added a new function match() for performing pattern matching. subs() and
507 has() also accept patterns as arguments. A pattern can be any expression,
508 optionally containing wildcard objects. These are constructed with the
509 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
511 * Positive integer powers of non-commutative expressions (except matrices)
512 are automatically expanded.
513 * Removed cint subdirectory, ginaccint is a separate package now due to
514 packaging considerations.
515 * Several little bugfixes.
518 * color and clifford classes are functional and documented.
519 * New "spinidx" class for dotted/undotted indices.
520 * Predefined spinor metric tensor (created by spinor_metric()).
521 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
522 * LaTeX output of indexed objects is much nicer.
523 * Fixed some build problems (with recent libreadline).
524 * Semantics of arithmetic operators now follows the C++ rules more strictly.
526 0.8.2 (24 April 2001)
527 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
528 non-symbols as the second argument in ginsh.
529 * the argument to collect() can be a list of objects in which case the
530 result is either a recursively collected polynomial, or a polynomial in
531 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
532 the second argument to collect().
533 * Several bugfixes (including a nasty memory leak in .normal()).
534 * class matrix: solve() doesn't call algorithms redundantly any more and
535 inverse() falls back to solve() which works in more general cases.
537 0.8.1 (16 April 2001)
538 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
539 be used with constants, functions and indexed expressions as well, so you
540 can use it to collect by powers of Pi or sin(x), or to find the coefficient
543 - it only works with symbols, constants, functions and indexed expressions,
544 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
545 - it does not know about dummy index summations; the coefficient of
546 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
547 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
548 noncommutative products might return wrong or surprising results.
549 * subs() no longer only substitutes symbols and indices but performs a more
550 general "syntactic substitution", i.e. it substitutes whole objects in sub-
551 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
554 - substituting numerics (subs(expr, 2==4)) will not replace then in all
555 occurences; in general, you shouldn't substitute numerics, though.
556 * Added preliminary (re)implementations of color and clifford classes.
557 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
559 * Replaced the various print*() member functions by a single print() that
560 takes a print_context object that determines the output formatting. This
561 should make it easier to add more output types, such as LaTeX output,
562 which is based on work by Stefan Weinzierl.
563 * Added functions to retrieve the properties stored in archive objects
564 outside of unarchive() (for printing or debugging purposes).
565 * Some bugfixes (indexed objects, archive writing).
566 * .collect() on non-polynomials is now algebraically correct.
568 0.8.0 (24 March 2001)
569 * Complete revamp of indexed objects. Instead of multiple classes for
570 indexed things and their indices there is now only one "indexed" class
571 and two types of indices: "idx" for simple indices and "varidx" for
572 indices with variance. There are predefined delta, epsilon and metric
573 tensors, and a function simplify_indexed() that performs canonicalization
574 and dummy index summations. Matrix objects can be indexed for doing simple
576 * Added an option "expand_indexed" to expand() to perform expansion of
577 indexed objects like (a+b).i -> a.i + b.i
578 * Renamed get_indices() to get_free_indices(), which no longer returns
579 dummy indices and checks the consistency of indices in sums.
580 * sqrfree() factorization fixed and improved syntactically.
581 * subs() works on matrices.
582 * Matrices can be constructed from flat list of elements; diagonal matrices
583 can be constructed from list of diagonal elements with diag_matrix().
584 * Fixed memory leak in expand().
585 * Operator% for objects of class ncmul has gone. Use operator* now for that
586 case too, which is much more natural.
588 0.7.3 (28 February 2001)
589 * Several bugfixes and minor performance tunings.
590 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
591 * Closed many in-source documentation gaps.
593 0.7.2 (17 February 2001)
594 * Several bugfixes in power series expansion, one of them critical.
596 0.7.1 (7 February 2001)
597 * Fix problems with Cint that were caused by CLN's overloaded operator new.
598 * Fix compilation errors with GCC3.
599 * normal() handles large sums of fractions better and normalizes the exponent
600 of power expressions.
601 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
602 * Some bugfixes of series expansion around branch cuts of special functions.
604 0.7.0 (15 December 2000)
605 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
606 actual representation any more. This is a speedup.
607 * mul::expand() was reengineered to not allocate excess temporary memory.
608 * Non-integer powers of a symbol are treated as constants by (l)degree() and
609 coeff(). Using these functions on an expression containing such powers used
610 to fail with an internal error message. The side-effect is that collect()
611 can be used on expressions which are not polynomials.
612 * Added a man page for the ginac-config script.
613 * Ctor of numeric from char* honors Digits.
615 0.6.4 (10 August 2000)
616 * Complete revamp of methods in class matrix. Some redundant (and poor)
617 implementations of elimination schemes were thrown out. The code is now
618 highly orthogonal, more flexible and much more efficient.
619 * Some long standing and quite nasty bugs were discovered and fixed in the
620 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
623 * Derivatives are now assembled in a slightly different manner (i.e. they
624 might 'look' different on first sight). Under certain circumstances this
625 can result in a dramatic speedup because it gives hashing a better chance,
626 especially when computing higher derivatives.
627 * Some series expansions of built-in functions have been reengineered.
628 * The algorithm for computing determinants can be chosen by the user. See
629 ginac/flags.h and ginac/matrix.h.
630 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
631 proper series expansion.
632 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
633 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
636 * ginaccint.bin is now launched by a binary program instead of by a scripts.
637 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
639 * Several minor bugfixes.
642 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
643 * Several bugfixes in target install.
646 * IMPORTANT: Several interface changes make programs written with GiNaC
647 much clearer but break compatibility with older versions:
648 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
649 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
650 - gamma() -> tgamma() (The true Gamma function, there is now also
651 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
652 - EulerGamma -> Euler
653 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
654 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
655 library version numbers.
656 * Expressions can be constructed from strings like this:
657 ex e("2*x+y", lst(x, y));
658 * ex::to_rational() provides a way to extend the domain of functions like
659 gcd() and divide() that only work on polynomials or rational functions (the
660 good old ex::subs() method reverses this process)
661 * Calling diff() on a function that has no derivative defined returns the
662 inert derivative function "Derivative".
663 * Several new timings in the check target. Some of them may be rather rude
664 at your machine, feel free to interrupt them.
666 0.5.4 (15 March 2000)
667 * Some algorithms in class matrix (notably determinant) were replaced by
668 less brain-dead ones and should now have much better performance.
669 * Checks were completely reorganized and split up into three parts:
670 a) exams (small regression tests with predefined input)
671 b) checks (lenghty coherence checks with random input)
672 c) timings (for coherence and crude benchmarking)
673 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
674 * Expanded expressions now remember they are expanded to prevent
675 superfluous expansions.
676 * Small bugfixes and improvements in the series expansion.
678 0.5.3 (23 February 2000)
679 * A more flexible scheme for registering functions was implemented,
680 allowing for remembering, too.
683 0.5.2 (16 February 2000)
684 * Mainly fixes a bug in the packaging of release 0.5.1.
686 0.5.1 (14 February 2000)
687 * Fixes a small number of bugs.
689 0.5.0 (7 February 2000)
690 * Expressions can be written ("archived") to files and read therefrom.
691 * Addition of GiNaC-cint, which lets you write complete programs in
692 an interactive shell-like manner in your favoured programming
695 0.4.1 (13 December 1999)
696 * Series Expansion of Gamma function and some other trigonometric
697 functions at their poles works now.
698 * Many more evaluations of special functions at points where
700 * info_flags::rational doesn't return true for complex extensions
701 any more---use info_flags::crational for the old behaviour.
702 info_flags::integer and -::cinteger work similarly, the same
703 holds for types like info_flags::rational_polynomial.
705 0.4.0 (26 November 1999)
706 * First public release.