1 This file records noteworthy changes.
3 1.7.7 (22 September 2019)
4 * Fix unarchiving empty containers.
5 * Remove obsolete exhashmap implementation.
6 * Fix issues with zeta computation.
10 * Fix a bug in mul::series() about asymptotic order term.
11 * Fix cl_N code generation for small negative integers.
12 * Fix multiple polylog computation related to trailing zeros and user-specified
13 signs for small imaginary parts.
14 * Fix CMake build with Python3.
16 1.7.5 (17 February 2019)
17 * Add Markowitz-ordered Gaussian eliminatin.
18 * Avoid un-normal zeros in matrix::solve().
19 * Accept exprseq arguments in lsolve(eqns, vars).
20 * Add overload of matrix::rank(solve_algo).
21 * Fix case in G_do_hoelder with real x values which are not cl_R.
22 * Fix an elusive bug in expairseq/add ctor, introduced in 1.7.0.
24 1.7.4 (19 February 2018)
25 * Fix ABI compatibility with 1.7.[0-2] (broken unintentionally in 1.7.3).
27 1.7.3 (1 February 2018)
28 * Speed up some corner cases of polynomial factorization.
29 * Speed up some corner cases of gcd computation.
30 * Speed up factorization of pre-factored polynomials.
31 * Make matrix::solve() work with hidden (non-normal) zeros.
32 * Fix bug in evaluation of real and imaginary parts of powers.
33 * Fix some LaTeX output, add new function symbol::get_TeX_name().
35 1.7.2 (10 January 2017)
36 * Fix memory leak in operators returning relationals, introduced in 1.7.0.
37 * Make macro GINAC_DECLARE_REGISTERED_CLASS() work outside namespace GiNaC.
38 * Fix some build issues.
40 1.7.1 (2 October 2016)
41 * Fix crash in basic::subs(), visible in classes which don't override it.
42 * Fix convergence failure in Li_projection.
43 * Fix cliffor_bar() and clifford_star().
44 * Improve performance of clifford_to_lst().
45 * Fix compilation issues, reduce compiler warnings.
48 * Make use of C++11 features:
49 - Use new language features 'auto', 'nullptr', 'constexpr', range-based for
50 loops, the contextual keyword 'override', static 'noexcept' operator, etc.
51 - Add initializer list ctors for container<>, lst and nested initializer
52 lists ctor for class matrix.
53 - Add many rvalue reference overloads for ctors from std containers. (Note
54 that whether they really speed up things depends on whether evaluation
55 leaves the container unchanged or not.)
56 - Rvalue reference overloads for ctors from std containers made it possible
57 to remove the manual 'discardable' hack and std::auto_ptr<T> for good.
58 - New dynallocate<T>(args...) helper functions obsolete manual allocation
59 on the heap and setting the dynallocated status flag.
60 - Got rid of C++98ish algorithm features (bind2nd, etc.) and replaced them
62 * Make add::eval(), mul::eval() more careful so they return an evaluated,
63 canonical expression without compromise.
64 * Remove 'level' argument of all .eval() methods. This has become possible by
65 ensuring that add::eval() and mul::eval() evaluate their own structure
66 without compromise (this was not guaranteed before). If all ex are evaluated,
67 any object which is an aggregate of such ex will only ever have to
68 evaluate itself, obsoleting the need for recursing.
69 * Remove 'level' arguments of all .evalf() and .normal() methods. They were
70 modeled after the .eval() methods.
71 * Make relational::rhs() and lhs() nonvirtual.
72 * Add support for power::info(info_flags::real).
73 * Add fderivative::derivatives() method.
74 * Remove broken info_flags::algebraic.
75 * Remove unmaintained support for Cint.
76 * Remove unfinished andcode for hash table-based expairseq.
77 * Remove deprecated ex::to_rational(lst) and ex::to_polynomial(lst).
78 * ginac-excompiler installs in $LIBEXECDIR now, not in $BINDIR.
79 * Many minor performance enhancements.
81 1.6.7 (29 February 2016)
82 * Fix elusive bug in sqrfree(), normal(), numer(), and denom().
84 1.6.6 (20 December 2015)
85 * Fix elusive bug in add::eval().
86 * Several minor performance enhancements.
89 * Fix pow(+(...),2).expand() where the sum contained roots of expressions.
90 * Speed-up pow(+(...),n).expand() where n > 3.
91 * Fix a crash in PolyLogs of rational numbers.
94 * Fix pow(+(...),2).expand() where the sum contained roots of rationals.
95 * Various improvements for info(info_flags::nonnegative).
96 * Make power::expand() (x*p)^c -> x^c * p^c, if p>0.
97 * Fix normal() where nested functions occur multiple times.
98 * Add optional explicit derivatives to functions and use it in abs(),
99 imag_part(), real_part().
100 * Evaluate abs(z)^(2n) -> z^n * conjugate(z)^n.
102 1.6.3 (27 November 2014)
103 * New expand_options::expand_transcendental. GiNaC will apply additional
104 rules when expanding expressions if this option is specified, i.e.
105 log(a*b) -> log(a) + log(b)
106 exp(a + b) -> exp(a)*exp(b)
107 * Functions can define a custom expand() and info() now.
108 * Automatically rewrite (x^{-1})^c -> x^{-c} for positive c.
109 * Transform abs(x)^n -> x^n if x is real and n is even.
110 * Improved power::info(): power with a real base and even exponent
111 reports that it's non-negative.
112 * Fixed spurious match failure due to expairseq::match() bug:
113 > match(sin(y)*exp(b)+sin(x)*exp(a), sin($0)*exp(a)+exp(b)*sin($1))
115 * Fixed power::is_polynomial() and mul::is_polynomial() computation.
116 * factor_univariate correctly handles polynomials over rationals (no
118 * Fixed an infinite loop in factor_multivariate due to incorrect handling
119 of polynomials having a leading coefficient being a sum with a non-trivial
121 * Fixed numeric evaluation of generalized multiple polylogarithms for real
122 and negative argument.
123 * Avoid calling log(1-x) in numeric evaluation of classical polylogarithm.
124 * Fixed numeric evaluation of multiple polylogarithms (correctly set
125 the signs of the imaginary parts in the intermediate expression).
126 * Fixed numeric evaluation of Nielsen polylogs for arguments close to
127 the 6th root of unity or its conjugate.
128 * Avoid infinite recursion in series expansion of logarithm.
129 * numeric::info(info_flags::nonnegative) correctly handles complex numbers
130 with non-zero imaginary part.
131 * Fixed several build issues:
132 - libreadline and dlopen() misdetection.
133 - multiple definition of symbol on MinGW.
134 - auto* tools and texinfo being unhappy in various ways.
135 * GiNaC can be built with CMake now.
137 1.6.2 (6 November 2011)
138 * Fixed the parser to read GiNaC::lst again.
139 * Fixed a compile warning (relevant to openSUSE build).
140 * Fixed a bug concerning the subsitutions in indexed expressions
141 (subs_options::no_index_renaming was ignored).
144 * Fixed several internal assertions for the debug version of GiNaC.
145 * More verbose report of (auto-)configuration problems.
146 * Fixed a compile problem with ginsh using gcc 4.6.
149 * Fixed compilation issues with clang.
150 * Fixed compilation issues with VC++.
151 * Fixed a segfault in fsolve() and improved its numerical algorithm.
152 * Fixed several memory leaks in power::eval().
153 * Fixed the substitution algorithm that led to wrong results (exp(log(x))->x).
154 * Fixed a bug in add:eval() (real_part() had returned wrong results).
155 * Fixed infinite loop bug when unarchiving realsymbol and possymbol.
156 * Fixed bugs in the GCD code.
157 * Fixed empty string bug in symbol::get_name().
158 * Fixed bugs concerning STL vector sizes that can potentially cause segfaults.
159 * Fixed a bug in is_polynomial().
160 * Removed autogen dependencies.
161 * Improved simplify_indexed() algorithm.
162 * Changed the connection between library version and package version.
163 * power::series() can handle now more expressions with singularities in the exponent.
164 * Added conjugate() methods to functions cosh, sinh, tanh.
167 * Changed default behaviour of conjugate() for user-defined functions to avoid
168 wrong evaluations. A user-defined conjugate_func must now be explicitly
170 * Fixed: Parser now handles abbreviations as advertized in the manual.
171 * Fixed two bugs in the GCD code (one infinite loop, one miscalculation).
172 * Fixed dangerous iterator use.
173 * Fixed a memory leak in excompiler.
174 * Fixed several syntax issues wrt to gcc 4.5 and wrt to compile option -std=cxx0x.
175 * Fixed a wrong URL and a texinfo problem in the manual.
176 * Added degree_vector() utility function.
178 1.5.7 (29 March 2010)
179 * Fixed a bug in the GCD code (infinite loop in pgcd()).
180 * Fixed a bug in atan2() (division by zero error for atan2(x,0) if x is a
181 negative and composite term).
182 * Products now correctly set info_flags::negative and info_flags::negint.
184 1.5.6 (28 January 2010)
185 * Fixed compile problem with gcc 3.4.
186 * Improved excompiler: The ginac-excompiler script will only be installed if
187 excompiler is supported and enabled.
189 1.5.5 (04 November 2009)
190 * Correct libtool versioning.
192 1.5.4 (02 November 2009)
193 * Default parser now can again read in user defined classes.
194 * Add mul::info() and add::info() support for numeric info_flags (GiNaC now can
195 detect that the sum or product of a number of positive expressions is again a
196 positive expression).
197 * Fixed cast that caused compile error on 64bit machines.
198 * Fixed incorrect uses of STL iterators.
199 * Removed subdirectory debian.
200 * Output LaTeX-symbols using \mathrm, instead of \mbox.
203 * The parser now understands user-defined functions by default. The identifier
204 names can now contain underscores.
207 * Fixed documentation of return_type_info()
208 * Fixed cstdio include issue.
209 * GiNaC now requires at least version 1.2.2 of cln.
211 1.5.1 (25 February 2009)
212 * Fixed compiling problems with GNU g++ 3.4.
213 * Work around weird C++ RTTI behaviour on woe32 so GiNaC works on MinGW again.
215 1.5.0 (17 February 2009)
216 * Added polynomial factorization.
217 * New, faster (recursive descent) expression parser.
218 * Faster GCD computation.
219 * gcd() now allows the user to override (some of the) heuristics.
220 * Writing extensions classes is simpler now:
221 - Replaced custom RTTI by standard C++ RTTI.
222 - Definition of archiving methods now optional when declaring a new GiNaC class.
223 * Fixed recursion in polynomial divide that caused a significant slowdown in
225 * Improved lsolve() of systems containing non-numeric coefficients.
226 * Removed implicit conversions from cl_N to numeric.
227 * Improved configuration and compatibility.
230 * Fixed a bug in the multiple polylogarithms Li/G that caused imaginary parts
231 of the arguments to be ignored.
232 * Fixed archiving of complex numbers.
233 * Made the behaviour of class function more consistent with respect to
235 * Fixed bug in power::is_polynomial.
236 * Improved heur_gcd() so it can handle rational polynomials.
237 * Improved build scripts.
239 1.4.3 (04 April 2008)
240 * Fixed bug in numerical evaluation of multiple polylogarithms and
241 alternating multiple zeta values introduced in version 1.4.2.
242 * Nielsen polylog now invalidates its lookup tables in case the precision
243 (Digits) has been changed.
244 * Added new checks for recent bugs in the numerical evaluation of Li and zeta.
246 1.4.2 (03 April 2008)
247 * Fixed VPATH building of documentation.
248 * Fixed bug in numerical evaluation of multiple polylogarithms for arguments
249 equal to certain roots of unity (thanks to Jianqiang Zhao).
250 * Fixed check for memory leakage in parser.
251 * Made internal function coerce() standard compliant.
252 * Improved lsolve() of systems containing non-numeric coefficients.
253 * Improved automatic test programs. Now they work on MinGW and Cygwin as well.
255 1.4.1 (21 November 2007)
256 * Fixed memory leak in ginac_yylex().
257 * Fixed memory leaks in mul::eval() and power::eval().
258 * Fixed macro checking for version of libreadline (Mac OS X).
259 * Fixed broken preprocessor instruction in excompiler.cpp.
260 * Fixed broken module loading in excompiler.cpp.
261 * info(info_flags::has_indices) now works for sums and products.
262 * Improved mul::expand().
263 * Improved CLN output.
265 1.4.0 (31 August 2007)
266 * New tinfo mechanism.
267 * Removed rtt from class symbol.
268 * Faster archiving by adding a map from strings to indices in the atoms vector.
269 * Improved unarchiving: algorithms order N instead of order N^2.
270 * Added compile function, excompiler class.
272 * Added step function to GiNaCs built-in functions.
273 * Added is_polynomial() method.
274 * Added real_part() and imag_part() methods.
275 * Added matrix::is_zero_matrix() method.
276 * Added evalm() method to pseries class.
277 * Improved dummy index renaming.
278 * Many improvements for class clifford.
279 * New flag for positive symbols/numbers, added possymbol class.
280 * Added programming examples in doc/examples
282 1.3.8 (28 August 2007)
283 * Drop support of ginac-config and ginac.m4. Please use pkg-config instead.
284 * atan2(y,x) branch cut correction.
285 * Fixed bug in series expansion.
286 * Additional transformations for mul and power.
287 * Clifford units now honor representation labels.
288 * Correct csrc output for idx and fderivative.
289 * Improved handling of convergence transformationis for Li/G.
290 * Fix compilation issues with prereleases of GCC 4.3.
291 * info_flags::expanded added.
292 * input_parser also accepts pow().
293 * texinfo.tex removed from package.
295 1.3.7 (05 February 2007)
296 * Fixed bug in expansion of power.
297 * Fixed bugs in functions S() (infinite loop), H() and zeta() (wrong results).
298 * Rebuilt bison related files with bison version 2.3 (fixes parse error bugs).
299 * Improved power::eval().
300 * Improved libreadline detection.
302 1.3.6 (13 December 2006)
303 * Better worst case behavior in heuristic gcd.
304 * Improved collecting for sparse multivariate polynomials.
305 * Improved collect_common_factors.
306 * Fixed bug in numerical evaluation of multiple polylogs.
307 * Fixed numerical integration of complex functions.
308 * Fixed bug in tensor::replace_contr_index().
310 1.3.5 (17 August 2006)
311 * Re-built bison related files that caused bugs with gcc 4.
312 * Fixed bugs in fderivative::match_same_type(), expairseq::match(),
313 expand_dummy_sum(), and expairseq::map().
314 * Fixed template specialization for class container to be gcc 4.2 compliant.
315 * Output in csrc mode is now -x instead of -1.0*x.
316 * Fixed tutorial and reference generation in html/pdf/ps format.
317 * Modified autotool configuration to allow for compilation on MinGW.
318 * Debian packaging files updated.
320 1.3.4 (12 April 2006)
321 * More general index dimensions are now possible.
322 * Improved algebraic substitutions.
323 * Fixed wrong matching in .has().
324 * Fixed bug in differentiation of a power.
325 * collect_common_factors also works with negative powers of common factors now.
326 * Code clean-up and preparations for upcoming cln 1.2.
328 1.3.3 (24 October 2005)
329 * Fixed bug occuring in algebraic substitutions with expressions involving
331 * Fixed bug that selected the wrong algorithm for determinants of purely
332 numeric matrices with at least one floating point element.
333 * Fixed bug in function H that caused an infinite recursion for arguments
335 * Fixed const-correctness in printing handler for GCC 4.0.2.
336 * Made lookup in adaptivesimpson precision-aware.
337 * Added series expansion for functions (classical) Li and S around x==0.
338 * Added fsolve() numerical univariate real-valued function solver.
339 * Added functions sub_matrix() and reduced_matrix().
340 * Small cleanups. Less warnings with latest GCC.
343 * GCD avoids to produce expanded expressions.
344 * Fixed bug in expanding expressions containing dummy indices.
345 * Fixed static initialization order bug.
346 * collect_common_factors now works with powers.
347 * Modernized configuration scripts.
350 * integral() and eval_integ() can be used from ginsh.
351 * Integrals can be series-expanded.
352 * Fixed a library initialization problem.
353 * GiNaC compiles from tarball even if lex/flex is missing.
354 * Fixed bugs in canonicalize_clifford(), clifford_prime() and clifford_to_lst().
355 * clifford_moebius_map(), remove_dirac_ONE() and LaTeX output of Clifford
356 objects now care about representation labels.
358 * Better output for slashed expressions
360 1.3.0 (19 October 2004)
361 * The Clifford classes have been generalized to allow working with Clifford
362 algebras generated by arbitrary symmetric tensors or matrices. Also, a lot
363 of new functions for Clifford algebras have been added, including
364 automorphisms and Moebius transformations. [V. Kisil]
365 * Added some basic symbolic and numeric integration facilities. [C. Dams]
366 * The multiple polylogarithm Li() now evaluates numerically for arbitrary
368 * New functions G(a,y) and G(a,s,y) added (another notation for multiple
371 1.2.4 (12 October 2004)
372 * Added ex::unitcontprim() to compute the unit, content, and primitive parts
373 of a polynomial in one go.
374 * binomial(n, k) evaluates for non-integer arguments n.
375 * Li(2,x) now evaluates for +-I.
377 * Fixed bug in Li(n,x) (if Li(2,x) was calculated with high precision the
378 enlargement of the look-up table caused a segmentation fault).
379 * Fixed another bug in the series expansion of powers, and a bug in
382 1.2.3 (13 August 2004)
383 * Added variants of dirac_trace() and color_trace() that take the trace over
384 more than one representation label by specifying a set or list of labels.
385 * diracgamma::contract_with() uses Chisholm identities in 4 dimensions to
386 produce more compact results.
387 * Fixed a bug in the series expansion of powers.
388 * The --enable-html-doc and --enable-ps-doc configure options are gone.
389 Documentation in HTML, DVI, PostScript, and PDF formats is now built with
390 "make html", "make dvi", "make ps", and "make pdf", respectively. The only
391 documentation that gets built by default are the tutorial in .info format
394 1.2.2 (3 August 2004)
395 * Added const_preorder_iterator and const_postorder_iterator classes (and
396 associated methods ex::pre/postorder_begin/end()) providing tree traversal
398 * Fixed the LaTeX output of the varidx class.
399 * Fixed bugs in series expansion and complex conjugation.
400 * (p.i*p.i).get_free_indices() returns the correct result () instead of (.i).
401 * Symbolic functions without any eval(), evalf() etc. functions now work
403 * integer_content(), content(), and primpart() now also work for polynomials
404 with rational coefficients (calculating the LCM of coefficients'
406 * Added method matrix::rank().
407 * Added function resultant().
408 * Added integer_content() function to ginsh.
410 1.2.1 (23 April 2004)
411 * Fixed infinite recursion in atan2_evalf() and improved atan2_eval().
412 * Added automatic evaluations for trigonometric functions with negative
413 arguments (e.g. sin(-2) -> -sin(2)).
414 * Fixed a static initialization order goof-up.
415 * Fixed various bugs in series expansion.
417 1.2.0 (19 March 2004)
418 * Added a structure<T> template class for the easy creation of user-defined
420 * Added support for (acyclic) visitors, to allow cleaner implementations of
421 algebraic algorithms.
422 * Added a const_iterator class that can be used instead of op()/nops().
423 * Completely revamped the implementation of expression output. It is now
424 possible to add new output formats, to change the behavior of predefined
425 formats at run-time, and to have different output styles for algebraic
427 * Symbols can be made non-commutative.
428 * Added a method ex::conjugate() and a function conjugate() for complex
429 conjugation. Symbols can be declared as real or complex-valued.
430 * Improved the speed of subs(), normal(), to_rational() and to_polynomial()
431 by the use of maps instead of lists. The old forms
432 subs(const lst & ls, const lst & lr, unsigned options)
433 to_rational/to_polynomial(lst & repl)
434 are still available for compatibility, but using the new forms
435 subs(const exmap & m, unsigned options)
436 to_rational/to_polynomial(exmap & repl)
437 is more efficient, especially when the number of replacements is large.
438 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
439 primpart() and matrix::charpoly() now take a "const ex &" instead of a
441 * Redundant expressions (two ex pointing to different objects are found to be
442 equal in compare()) are now actively deleted/fused to conserve memory and
443 speed up subsequent comparisons. This behavior can be suppressed on a
444 per-object level with status_flags::not_shareable. Lists and matrices are
445 not shareable by default.
446 * Lots of internal streamlining and optimizations.
447 * Caveats for class implementors:
448 - basic::copy() and basic::destroy() are gone; classes derived from
449 basic can use the defaults for the assignment operator and copy
451 - basic::subs(), basic::normal(), basic::to_rational() and
452 basic::to_polynomial() take 'exmap' objects instead of lists.
453 - basic::subs() now descends into subexpressions (if accessible via
454 nops()/op()/let_op()). If you have a custom implementation of subs()
455 that calls basic::subs() after substituting subexpressions, this needs
456 to be changed to a call to subs_one_level().
457 - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
458 - thiscontainer() and associated constructors now take a std::auto_ptr.
459 - Overloading basic::print() is now deprecated. You should use
460 print_func<>() class options instead.
462 1.1.7 (11 March 2004)
463 * Fixed a bug in canonicalize_clifford().
464 * Series expansion now works predictably. All terms with the exponent of the
465 expansion variable smaller than the given order are calculated exactly. If
466 the series is not terminating, the Order function is (at least) of the given
469 1.1.6 (22 January 2004)
470 * Added a function option "dummy()" which means "no options". This simplifies
471 the implementation of symbolic functions which are not to be further
473 * Removed a bug in the numerical evaluation of Li() that caused the system
474 to hang for certain parameter combinations.
475 * Fixed a bug in the calculation of hash values for indices that could lead
476 to wrong results or bogus error messages from simplify_indexed().
477 * Fixed a bug in the evaluation of harmonic polylogarithms for complex
478 arguments with positive imaginary part.
480 1.1.5 (5 November 2003)
481 * Harmonic polylogarithms now numerically evaluate for arbitrary arguments
482 (parameter must still be positive integers).
483 * The zeta function now can also be given a lst as a parameter in which case
484 it becomes a multiple zeta value. The use of mZeta is deprecated.
485 * The order of parameters for the multiple polylogarithm has been corrected.
486 * Documentation for the nested sums functions zeta, harmonic polylog, multiple
487 polylog, etc. has been added.
489 1.1.4 (17 October 2003)
490 * Lists and matrices can now be initialized from comma-separated lists of
491 expressions, like this:
501 This is both faster and produces much smaller code than the old constructors
502 lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
503 of matrices, and is now the recommended way to create these objects.
504 * The function mZeta now evaluates much faster for arbitrary parameters. The
505 harmonic and multiple polylogarithms evaluate considerably faster and check
506 for convergence. The order of parameters for the harmonic polylogarithm
509 1.1.3 (22 August 2003)
510 * Added new symbolic functions for better integration with nestedsums:
511 (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
512 harmonic polylogarithm H(), and multiple zeta value mZeta().
513 * New exhashmap<T> template intended as a drop-in replacement for
514 std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
516 1.1.2 (11 August 2003)
517 * Fixed a bug in the unarchiving of sums and products: terms were not
518 reordered in a canonical way.
519 * Fixed a bug in normal()/numer_denom(): denominator was not made unit
520 normal if it was a simple number.
521 * Improved the speed of subs() in some cases.
524 * lst (and exprseq) provide iterators for read-only element access. For
525 sequential access this is one order faster than using op().
526 * Implemented relational::subs() (this was done in 1.0.9 but inadvertently
527 omitted from the 1.1 branch).
528 * pole_error and do_taylor are available to library users.
529 * Added on-line help and Tab-completion for print(), iprint(), print_latex()
530 and print_csrc() in ginsh.
533 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
534 * The scalar_products mechanism allows the specification of an index dimension.
535 * Removed dirac_gamma6/7().
536 * Added ex::to_polynomial().
537 * subs() accepts an optional "options" argument. The option
538 subs_option::subs_algebraic enables "smart" substitutions in products and
540 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
541 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
542 "no_index_dimensions" to control the output format. Calling basic::print()
543 directly is now deprecated.
544 * Made the hashing more simple and efficient.
545 * Caveats for class implementors:
546 - basic::subs(): third argument changed from "bool" to "unsigned"
547 - unarchiving constructor and basic::unarchive(): "const" removed from
549 - basic::let_op() should only be implemented if write access to
550 subexpressions is desired
551 - simplify_ncmul() renamed to eval_ncmul()
552 - simplified_ncmul() renamed to hold_ncmul()
553 - nonsimplified_ncmul() renamed to reeval_ncmul()
555 1.0.14 (1 March 2003)
556 * Improved the C-source output: complex numbers are printed correctly (using
557 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
558 in the CLN output, and small integers are printed in a more compact format
559 (e.g. "2.0" instead of "2.0000000e+00").
560 * function_options::set_return_type() and function_options::do_not_evalf_params()
563 1.0.13 (27 January 2003)
564 * Contracting epsilon tensors with Euclidean indices now works.
565 * Improved dummy index symmetrization in sums.
566 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
567 but are single objects, to allow for a more compact notation of Dirac
569 * Powers with negative numeric exponents are printed as fractions in the
571 * Added symbolic_matrix() for the convenient creation of matrices filled
573 * Added collect_common_factors() which collects common factors from the
575 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
577 1.0.12 (30 October 2002)
578 * Fixed a bug in power::expand() that could produce invalid expressions.
579 * The input parser no longer ignores extra data following accepted input.
580 * Improved the CLN C-source output (integers are printed as integers, and
581 floating point numbers include the precision).
582 * Fixed a problem in the LaTeX-output of negative fractions.
583 * Added print_latex() and print_csrc() to ginsh.
584 * The sprem() function is now public.
586 1.0.11 (18 September 2002)
587 * Fixed a possible memory corruption in contractions of indexed objects with
588 delta or metric tensors.
589 * Computing the derivative of a power series object with respect to a symbol
590 that is not the expansion variable now works correctly.
591 * Several bugfixes in code generation.
593 1.0.10 (24 July 2002)
594 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
595 * Input parser handles indices (they have to be specified in the same list
597 * Added some limited support for subspaces in the idx and tensor classes.
598 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
599 sorted list containing two or more equal objects failed to return 0).
602 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
603 variance. This allows some simplifications that weren't possible before,
604 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
605 * Implemented relational::subs().
606 * Fixed bug in simplify_ncmul() for clifford objects.
608 1.0.8 (31 March 2002)
609 * Improvements in memory usage of the expand() methods.
611 1.0.7 (18 March 2002)
612 * Fixed LaTeX output of indexed and matrix objects.
613 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
614 matrices "ex unit_matrix(unsigned, unsigned)".
617 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
619 1.0.5 (27 January 2002)
620 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
621 of any class (except add/mul/ncmul/numeric) for "s". They should even work
622 if "s" is a "power" object, as long as the exponent is non-integer, but with
623 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
624 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
625 * Fixed a small output bug.
627 1.0.4 (24 January 2002)
628 * Speedup in expand().
629 * Faster Bernoulli numbers (Markus Nullmeier).
630 * Some minor bugfixes and documentation updates.
632 1.0.3 (21 December 2001)
633 * Fixed a bug where quo() would call vector::reserve() with a negative
635 * Fix several bugs in code generation.
637 1.0.2 (19 December 2001)
638 * Input parser recognizes "sqrt()", which is also used in the output.
639 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
641 * Fixed small bug in dummy index renaming which could cause it to not
642 recognize renamable indices in some cases.
643 * power::degree() and power::ldegree() throw an exception when encountering
644 a non-integer exponent.
645 * Add output-support for Python bindings.
647 1.0.1 (22 November 2001)
648 * Function sqrfree() handles a few more cases now.
649 * Class relational has real canonical ordering now.
650 * Handle obscene libreadline version numbers when building ginsh.
652 1.0.0 (6 November 2001)
653 * Some internal reorganization resulting in a general speed-up.
654 * The last 3 evaluated expressions in ginsh are now referred to with the
655 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
656 compatibility but may be removed in a future version of GiNaC.
658 0.9.4 (20 September 2001)
659 * Functions have better support for external scripting languages.
660 * Interface cleanups and bugfixes.
661 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
663 0.9.3 (16 August 2001)
664 * series expansion now much more consistent for small order expansion.
665 * lsolve() accepts algorithmic hint as parameter.
668 * Epsilon tensor is more functional.
669 * simplify_indexed() is better at detecting expressions that vanish for
671 * Several little bugfixes and consistency enhancements.
674 * Ctors of class numeric are not explicit any more. All built-in callers for
675 pseudofunctions are now templated and default to ex arguments which relaxes
676 the need for explicit ctors.
677 * New functions/methods:
679 - remove_first(), remove_last(), sort() and unique() for lists
680 - symmetrize_cyclic()
682 * Instead of just totally symmetric or antisymmetric, complex symmetries
683 can now be defined for indexed objects. Symmetries are described by a
684 tree of "symmetry" objects that is constructed with the sy_none(),
685 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
686 with respect to its arguments can also be defined (this is currently
687 only used for the Beta function).
688 * Generalized map() to take a function object instead of a function pointer.
689 This allows passing an arbitrary number of additional state to the
690 function being called.
691 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
692 better with container classes, e.g. using color_trace() on a relation will
693 take the trace on both sides, using diff() on a matrix differentiates every
695 * diff() works properly with non-commutative products and indexed objects.
696 * New option flag "expand_function_args" for expand().
697 * Supplement some (now deprecated) macros by inlined template functions:
698 - is_of_type(foo, type) -> is_a<type>(foo)
699 - is_ex_of_type(foo, type) -> is_a<type>(foo)
700 - is_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
701 - is_ex_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
702 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
703 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
705 * Small bugfixes in pattern matching.
706 * Updated libtool to version 1.4.
709 * In the output and in ginsh, lists are now delimited by { } braces, and
710 matrices are delimited by single [ ] brackets.
711 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
712 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
713 * New functions/methods:
714 - canonicalize_clifford() (helpful when comparing expressions containing
716 - symmetrize() and antisymmetrize()
717 - numer_denom() (return numerator and denominator in one call)
718 - map() (apply function to subexpressions)
719 - evalm() (evaluate sums, products and integer powers of matrices)
720 * Added a new function match() for performing pattern matching. subs() and
721 has() also accept patterns as arguments. A pattern can be any expression,
722 optionally containing wildcard objects. These are constructed with the
723 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
725 * Positive integer powers of non-commutative expressions (except matrices)
726 are automatically expanded.
727 * Removed cint subdirectory, ginaccint is a separate package now due to
728 packaging considerations.
729 * Several little bugfixes.
732 * color and clifford classes are functional and documented.
733 * New "spinidx" class for dotted/undotted indices.
734 * Predefined spinor metric tensor (created by spinor_metric()).
735 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
736 * LaTeX output of indexed objects is much nicer.
737 * Fixed some build problems (with recent libreadline).
738 * Semantics of arithmetic operators now follows the C++ rules more strictly.
740 0.8.2 (24 April 2001)
741 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
742 non-symbols as the second argument in ginsh.
743 * the argument to collect() can be a list of objects in which case the
744 result is either a recursively collected polynomial, or a polynomial in
745 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
746 the second argument to collect().
747 * Several bugfixes (including a nasty memory leak in .normal()).
748 * class matrix: solve() doesn't call algorithms redundantly any more and
749 inverse() falls back to solve() which works in more general cases.
751 0.8.1 (16 April 2001)
752 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
753 be used with constants, functions and indexed expressions as well, so you
754 can use it to collect by powers of Pi or sin(x), or to find the coefficient
757 - it only works with symbols, constants, functions and indexed expressions,
758 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
759 - it does not know about dummy index summations; the coefficient of
760 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
761 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
762 noncommutative products might return wrong or surprising results.
763 * subs() no longer only substitutes symbols and indices but performs a more
764 general "syntactic substitution", i.e. it substitutes whole objects in sub-
765 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
768 - substituting numerics (subs(expr, 2==4)) will not replace then in all
769 occurences; in general, you shouldn't substitute numerics, though.
770 * Added preliminary (re)implementations of color and clifford classes.
771 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
773 * Replaced the various print*() member functions by a single print() that
774 takes a print_context object that determines the output formatting. This
775 should make it easier to add more output types, such as LaTeX output,
776 which is based on work by Stefan Weinzierl.
777 * Added functions to retrieve the properties stored in archive objects
778 outside of unarchive() (for printing or debugging purposes).
779 * Some bugfixes (indexed objects, archive writing).
780 * .collect() on non-polynomials is now algebraically correct.
782 0.8.0 (24 March 2001)
783 * Complete revamp of indexed objects. Instead of multiple classes for
784 indexed things and their indices there is now only one "indexed" class
785 and two types of indices: "idx" for simple indices and "varidx" for
786 indices with variance. There are predefined delta, epsilon and metric
787 tensors, and a function simplify_indexed() that performs canonicalization
788 and dummy index summations. Matrix objects can be indexed for doing simple
790 * Added an option "expand_indexed" to expand() to perform expansion of
791 indexed objects like (a+b).i -> a.i + b.i
792 * Renamed get_indices() to get_free_indices(), which no longer returns
793 dummy indices and checks the consistency of indices in sums.
794 * sqrfree() factorization fixed and improved syntactically.
795 * subs() works on matrices.
796 * Matrices can be constructed from flat list of elements; diagonal matrices
797 can be constructed from list of diagonal elements with diag_matrix().
798 * Fixed memory leak in expand().
799 * Operator% for objects of class ncmul has gone. Use operator* now for that
800 case too, which is much more natural.
802 0.7.3 (28 February 2001)
803 * Several bugfixes and minor performance tunings.
804 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
805 * Closed many in-source documentation gaps.
807 0.7.2 (17 February 2001)
808 * Several bugfixes in power series expansion, one of them critical.
810 0.7.1 (7 February 2001)
811 * Fix problems with Cint that were caused by CLN's overloaded operator new.
812 * Fix compilation errors with GCC3.
813 * normal() handles large sums of fractions better and normalizes the exponent
814 of power expressions.
815 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
816 * Some bugfixes of series expansion around branch cuts of special functions.
818 0.7.0 (15 December 2000)
819 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
820 actual representation any more. This is a speedup.
821 * mul::expand() was reengineered to not allocate excess temporary memory.
822 * Non-integer powers of a symbol are treated as constants by (l)degree() and
823 coeff(). Using these functions on an expression containing such powers used
824 to fail with an internal error message. The side-effect is that collect()
825 can be used on expressions which are not polynomials.
826 * Added a man page for the ginac-config script.
827 * Ctor of numeric from char* honors Digits.
829 0.6.4 (10 August 2000)
830 * Complete revamp of methods in class matrix. Some redundant (and poor)
831 implementations of elimination schemes were thrown out. The code is now
832 highly orthogonal, more flexible and much more efficient.
833 * Some long standing and quite nasty bugs were discovered and fixed in the
834 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
837 * Derivatives are now assembled in a slightly different manner (i.e. they
838 might 'look' different on first sight). Under certain circumstances this
839 can result in a dramatic speedup because it gives hashing a better chance,
840 especially when computing higher derivatives.
841 * Some series expansions of built-in functions have been reengineered.
842 * The algorithm for computing determinants can be chosen by the user. See
843 ginac/flags.h and ginac/matrix.h.
844 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
845 proper series expansion.
846 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
847 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
850 * ginaccint.bin is now launched by a binary program instead of by a scripts.
851 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
853 * Several minor bugfixes.
856 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
857 * Several bugfixes in target install.
860 * IMPORTANT: Several interface changes make programs written with GiNaC
861 much clearer but break compatibility with older versions:
862 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
863 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
864 - gamma() -> tgamma() (The true Gamma function, there is now also
865 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
866 - EulerGamma -> Euler
867 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
868 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
869 library version numbers.
870 * Expressions can be constructed from strings like this:
871 ex e("2*x+y", lst(x, y));
872 * ex::to_rational() provides a way to extend the domain of functions like
873 gcd() and divide() that only work on polynomials or rational functions (the
874 good old ex::subs() method reverses this process)
875 * Calling diff() on a function that has no derivative defined returns the
876 inert derivative function "Derivative".
877 * Several new timings in the check target. Some of them may be rather rude
878 at your machine, feel free to interrupt them.
880 0.5.4 (15 March 2000)
881 * Some algorithms in class matrix (notably determinant) were replaced by
882 less brain-dead ones and should now have much better performance.
883 * Checks were completely reorganized and split up into three parts:
884 a) exams (small regression tests with predefined input)
885 b) checks (lenghty coherence checks with random input)
886 c) timings (for coherence and crude benchmarking)
887 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
888 * Expanded expressions now remember they are expanded to prevent
889 superfluous expansions.
890 * Small bugfixes and improvements in the series expansion.
892 0.5.3 (23 February 2000)
893 * A more flexible scheme for registering functions was implemented,
894 allowing for remembering, too.
897 0.5.2 (16 February 2000)
898 * Mainly fixes a bug in the packaging of release 0.5.1.
900 0.5.1 (14 February 2000)
901 * Fixes a small number of bugs.
903 0.5.0 (7 February 2000)
904 * Expressions can be written ("archived") to files and read therefrom.
905 * Addition of GiNaC-cint, which lets you write complete programs in
906 an interactive shell-like manner in your favoured programming
909 0.4.1 (13 December 1999)
910 * Series Expansion of Gamma function and some other trigonometric
911 functions at their poles works now.
912 * Many more evaluations of special functions at points where
914 * info_flags::rational doesn't return true for complex extensions
915 any more---use info_flags::crational for the old behaviour.
916 info_flags::integer and -::cinteger work similarly, the same
917 holds for types like info_flags::rational_polynomial.
919 0.4.0 (26 November 1999)
920 * First public release.