1 This file records noteworthy changes.
4 * Added a structure<T> template class for the easy creation of user-defined
8 * <noncommutative symbols>
9 * Improved the speed of subs() and normal() by the use of maps instead of
11 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
12 primpart() and matrix::charpoly() now take a "const ex &" instead of a
15 * Many internal reorganizations and optimizations.
16 * Caveats for class implementors:
17 - basic::copy() and basic::destroy() are gone; classes derived from
18 basic can use the defaults for the assignment operator and copy
20 - basic::subs() and basic::normal() take an 'exmap &' instead of two
22 - basic::subs() now descends into subexpressions (if accessible via
23 nops()/op()/let_op()). If you have a custom implementation of subs()
24 that calls basic::subs() after substituting subexpressions, this needs
25 to be changed to a call to subs_one_level().
26 - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
27 - thiscontainer() and associated constructors now take a std::auto_ptr.
28 - Overloading basic::print() is now deprecated. You should use
29 print_func<>() class options instead.
32 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
33 * The scalar_products mechanism allows the specification of an index dimension.
34 * Removed dirac_gamma6/7().
35 * Added ex::to_polynomial().
36 * subs() accepts an optional "options" argument. The option
37 subs_option::subs_algebraic enables "smart" substitutions in products and
39 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
40 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
41 "no_index_dimensions" to control the output format. Calling basic::print()
42 directly is now deprecated.
43 * Made the hashing more simple and efficient.
44 * Caveats for class implementors:
45 - basic::subs(): third argument changed from "bool" to "unsigned"
46 - unarchiving constructor and basic::unarchive(): "const" removed from
48 - basic::let_op() should only be implemented if write access to
49 subexpressions is desired
50 - simplify_ncmul() renamed to eval_ncmul()
51 - simplified_ncmul() renamed to hold_ncmul()
52 - nonsimplified_ncmul() renamed to reeval_ncmul()
55 * Improved the C-source output: complex numbers are printed correctly (using
56 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
57 in the CLN output, and small integers are printed in a more compact format
58 (e.g. "2.0" instead of "2.0000000e+00").
59 * function_options::set_return_type() and function_options::do_not_evalf_params()
62 1.0.13 (27 January 2003)
63 * Contracting epsilon tensors with Euclidean indices now works.
64 * Improved dummy index symmetrization in sums.
65 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
66 but are single objects, to allow for a more compact notation of Dirac
68 * Powers with negative numeric exponents are printed as fractions in the
70 * Added symbolic_matrix() for the convenient creation of matrices filled
72 * Added collect_common_factors() which collects common factors from the
74 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
76 1.0.12 (30 October 2002)
77 * Fixed a bug in power::expand() that could produce invalid expressions.
78 * The input parser no longer ignores extra data following accepted input.
79 * Improved the CLN C-source output (integers are printed as integers, and
80 floating point numbers include the precision).
81 * Fixed a problem in the LaTeX-output of negative fractions.
82 * Added print_latex() and print_csrc() to ginsh.
83 * The sprem() function is now public.
85 1.0.11 (18 September 2002)
86 * Fixed a possible memory corruption in contractions of indexed objects with
87 delta or metric tensors.
88 * Computing the derivative of a power series object with respect to a symbol
89 that is not the expansion variable now works correctly.
90 * Several bugfixes in code generation.
93 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
94 * Input parser handles indices (they have to be specified in the same list
96 * Added some limited support for subspaces in the idx and tensor classes.
97 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
98 sorted list containing two or more equal objects failed to return 0).
101 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
102 variance. This allows some simplifications that weren't possible before,
103 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
104 * Implemented relational::subs().
105 * Fixed bug in simplify_ncmul() for clifford objects.
107 1.0.8 (31 March 2002)
108 * Improvements in memory usage of the expand() methods.
110 1.0.7 (18 March 2002)
111 * Fixed LaTeX output of indexed and matrix objects.
112 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
113 matrices "ex unit_matrix(unsigned, unsigned)".
116 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
118 1.0.5 (27 January 2002)
119 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
120 of any class (except add/mul/ncmul/numeric) for "s". They should even work
121 if "s" is a "power" object, as long as the exponent is non-integer, but with
122 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
123 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
124 * Fixed a small output bug.
126 1.0.4 (24 January 2002)
127 * Speedup in expand().
128 * Faster Bernoulli numbers (Markus Nullmeier).
129 * Some minor bugfixes and documentation updates.
131 1.0.3 (21 December 2001)
132 * Fixed a bug where quo() would call vector::reserve() with a negative
134 * Fix several bugs in code generation.
136 1.0.2 (19 December 2001)
137 * Input parser recognizes "sqrt()", which is also used in the output.
138 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
140 * Fixed small bug in dummy index renaming which could cause it to not
141 recognize renamable indices in some cases.
142 * power::degree() and power::ldegree() throw an exception when encountering
143 a non-integer exponent.
144 * Add output-support for Python bindings.
146 1.0.1 (22 November 2001)
147 * Function sqrfree() handles a few more cases now.
148 * Class relational has real canonical ordering now.
149 * Handle obscene libreadline version numbers when building ginsh.
151 1.0.0 (6 November 2001)
152 * Some internal reorganization resulting in a general speed-up.
153 * The last 3 evaluated expressions in ginsh are now referred to with the
154 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
155 compatibility but may be removed in a future version of GiNaC.
157 0.9.4 (20 September 2001)
158 * Functions have better support for external scripting languages.
159 * Interface cleanups and bugfixes.
160 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
162 0.9.3 (16 August 2001)
163 * series expansion now much more consistent for small order expansion.
164 * lsolve() accepts algorithmic hint as parameter.
167 * Epsilon tensor is more functional.
168 * simplify_indexed() is better at detecting expressions that vanish for
170 * Several little bugfixes and consistency enhancements.
173 * Ctors of class numeric are not explicit any more. All built-in callers for
174 pseudofunctions are now templated and default to ex arguments which relaxes
175 the need for explicit ctors.
176 * New functions/methods:
178 - remove_first(), remove_last(), sort() and unique() for lists
179 - symmetrize_cyclic()
181 * Instead of just totally symmetric or antisymmetric, complex symmetries
182 can now be defined for indexed objects. Symmetries are described by a
183 tree of "symmetry" objects that is constructed with the sy_none(),
184 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
185 with respect to its arguments can also be defined (this is currently
186 only used for the Beta function).
187 * Generalized map() to take a function object instead of a function pointer.
188 This allows passing an arbitrary number of additional state to the
189 function being called.
190 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
191 better with container classes, e.g. using color_trace() on a relation will
192 take the trace on both sides, using diff() on a matrix differentiates every
194 * diff() works properly with non-commutative products and indexed objects.
195 * New option flag "expand_function_args" for expand().
196 * Supplement some (now deprecated) macros by inlined template functions:
197 - is_of_type(foo, type) -> is_a<type>(foo)
198 - is_ex_of_type(foo, type) -> is_a<type>(foo)
199 - is_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
200 - is_ex_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
201 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
202 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
204 * Small bugfixes in pattern matching.
205 * Updated libtool to version 1.4.
208 * In the output and in ginsh, lists are now delimited by { } braces, and
209 matrices are delimited by single [ ] brackets.
210 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
211 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
212 * New functions/methods:
213 - canonicalize_clifford() (helpful when comparing expressions containing
215 - symmetrize() and antisymmetrize()
216 - numer_denom() (return numerator and denominator in one call)
217 - map() (apply function to subexpressions)
218 - evalm() (evaluate sums, products and integer powers of matrices)
219 * Added a new function match() for performing pattern matching. subs() and
220 has() also accept patterns as arguments. A pattern can be any expression,
221 optionally containing wildcard objects. These are constructed with the
222 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
224 * Positive integer powers of non-commutative expressions (except matrices)
225 are automatically expanded.
226 * Removed cint subdirectory, ginaccint is a separate package now due to
227 packaging considerations.
228 * Several little bugfixes.
231 * color and clifford classes are functional and documented.
232 * New "spinidx" class for dotted/undotted indices.
233 * Predefined spinor metric tensor (created by spinor_metric()).
234 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
235 * LaTeX output of indexed objects is much nicer.
236 * Fixed some build problems (with recent libreadline).
237 * Semantics of arithmetic operators now follows the C++ rules more strictly.
239 0.8.2 (24 April 2001)
240 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
241 non-symbols as the second argument in ginsh.
242 * the argument to collect() can be a list of objects in which case the
243 result is either a recursively collected polynomial, or a polynomial in
244 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
245 the second argument to collect().
246 * Several bugfixes (including a nasty memory leak in .normal()).
247 * class matrix: solve() doesn't call algorithms redundantly any more and
248 inverse() falls back to solve() which works in more general cases.
250 0.8.1 (16 April 2001)
251 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
252 be used with constants, functions and indexed expressions as well, so you
253 can use it to collect by powers of Pi or sin(x), or to find the coefficient
256 - it only works with symbols, constants, functions and indexed expressions,
257 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
258 - it does not know about dummy index summations; the coefficient of
259 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
260 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
261 noncommutative products might return wrong or surprising results.
262 * subs() no longer only substitutes symbols and indices but performs a more
263 general "syntactic substitution", i.e. it substitutes whole objects in sub-
264 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
267 - substituting numerics (subs(expr, 2==4)) will not replace then in all
268 occurences; in general, you shouldn't substitute numerics, though.
269 * Added preliminary (re)implementations of color and clifford classes.
270 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
272 * Replaced the various print*() member functions by a single print() that
273 takes a print_context object that determines the output formatting. This
274 should make it easier to add more output types, such as LaTeX output,
275 which is based on work by Stefan Weinzierl.
276 * Added functions to retrieve the properties stored in archive objects
277 outside of unarchive() (for printing or debugging purposes).
278 * Some bugfixes (indexed objects, archive writing).
279 * .collect() on non-polynomials is now algebraically correct.
281 0.8.0 (24 March 2001)
282 * Complete revamp of indexed objects. Instead of multiple classes for
283 indexed things and their indices there is now only one "indexed" class
284 and two types of indices: "idx" for simple indices and "varidx" for
285 indices with variance. There are predefined delta, epsilon and metric
286 tensors, and a function simplify_indexed() that performs canonicalization
287 and dummy index summations. Matrix objects can be indexed for doing simple
289 * Added an option "expand_indexed" to expand() to perform expansion of
290 indexed objects like (a+b).i -> a.i + b.i
291 * Renamed get_indices() to get_free_indices(), which no longer returns
292 dummy indices and checks the consistency of indices in sums.
293 * sqrfree() factorization fixed and improved syntactically.
294 * subs() works on matrices.
295 * Matrices can be constructed from flat list of elements; diagonal matrices
296 can be constructed from list of diagonal elements with diag_matrix().
297 * Fixed memory leak in expand().
298 * Operator% for objects of class ncmul has gone. Use operator* now for that
299 case too, which is much more natural.
301 0.7.3 (28 February 2001)
302 * Several bugfixes and minor performance tunings.
303 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
304 * Closed many in-source documentation gaps.
306 0.7.2 (17 February 2001)
307 * Several bugfixes in power series expansion, one of them critical.
309 0.7.1 (7 February 2001)
310 * Fix problems with Cint that were caused by CLN's overloaded operator new.
311 * Fix compilation errors with GCC3.
312 * normal() handles large sums of fractions better and normalizes the exponent
313 of power expressions.
314 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
315 * Some bugfixes of series expansion around branch cuts of special functions.
317 0.7.0 (15 December 2000)
318 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
319 actual representation any more. This is a speedup.
320 * mul::expand() was reengineered to not allocate excess temporary memory.
321 * Non-integer powers of a symbol are treated as constants by (l)degree() and
322 coeff(). Using these functions on an expression containing such powers used
323 to fail with an internal error message. The side-effect is that collect()
324 can be used on expressions which are not polynomials.
325 * Added a man page for the ginac-config script.
326 * Ctor of numeric from char* honors Digits.
328 0.6.4 (10 August 2000)
329 * Complete revamp of methods in class matrix. Some redundant (and poor)
330 implementations of elimination schemes were thrown out. The code is now
331 highly orthogonal, more flexible and much more efficient.
332 * Some long standing and quite nasty bugs were discovered and fixed in the
333 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
336 * Derivatives are now assembled in a slightly different manner (i.e. they
337 might 'look' different on first sight). Under certain circumstances this
338 can result in a dramatic speedup because it gives hashing a better chance,
339 especially when computing higher derivatives.
340 * Some series expansions of built-in functions have been reengineered.
341 * The algorithm for computing determinants can be chosen by the user. See
342 ginac/flags.h and ginac/matrix.h.
343 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
344 proper series expansion.
345 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
346 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
349 * ginaccint.bin is now launched by a binary program instead of by a scripts.
350 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
352 * Several minor bugfixes.
355 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
356 * Several bugfixes in target install.
359 * IMPORTANT: Several interface changes make programs written with GiNaC
360 much clearer but break compatibility with older versions:
361 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
362 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
363 - gamma() -> tgamma() (The true Gamma function, there is now also
364 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
365 - EulerGamma -> Euler
366 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
367 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
368 library version numbers.
369 * Expressions can be constructed from strings like this:
370 ex e("2*x+y", lst(x, y));
371 * ex::to_rational() provides a way to extend the domain of functions like
372 gcd() and divide() that only work on polynomials or rational functions (the
373 good old ex::subs() method reverses this process)
374 * Calling diff() on a function that has no derivative defined returns the
375 inert derivative function "Derivative".
376 * Several new timings in the check target. Some of them may be rather rude
377 at your machine, feel free to interrupt them.
379 0.5.4 (15 March 2000)
380 * Some algorithms in class matrix (notably determinant) were replaced by
381 less brain-dead ones and should now have much better performance.
382 * Checks were completely reorganized and split up into three parts:
383 a) exams (small regression tests with predefined input)
384 b) checks (lenghty coherence checks with random input)
385 c) timings (for coherence and crude benchmarking)
386 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
387 * Expanded expressions now remember they are expanded to prevent
388 superfluous expansions.
389 * Small bugfixes and improvements in the series expansion.
391 0.5.3 (23 February 2000)
392 * A more flexible scheme for registering functions was implemented,
393 allowing for remembering, too.
396 0.5.2 (16 February 2000)
397 * Mainly fixes a bug in the packaging of release 0.5.1.
399 0.5.1 (14 February 2000)
400 * Fixes a small number of bugs.
402 0.5.0 (7 February 2000)
403 * Expressions can be written ("archived") to files and read therefrom.
404 * Addition of GiNaC-cint, which lets you write complete programs in
405 an interactive shell-like manner in your favoured programming
408 0.4.1 (13 December 1999)
409 * Series Expansion of Gamma function and some other trigonometric
410 functions at their poles works now.
411 * Many more evaluations of special functions at points where
413 * info_flags::rational doesn't return true for complex extensions
414 any more---use info_flags::crational for the old behaviour.
415 info_flags::integer and -::cinteger work similarly, the same
416 holds for types like info_flags::rational_polynomial.
418 0.4.0 (26 November 1999)
419 * First public release.