1 This file records noteworthy changes.
4 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
5 * Made the hashing more simple and efficient.
6 * The scalar_products mechanism allows the specification of an index dimension.
9 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
10 * Input parser handles indices (they have to be specified in the same list
12 * Added some limited support for subspaces in the idx and tensor classes.
13 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
14 sorted list containing two or more equal objects failed to return 0).
15 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
16 variance. This allows some simplifications that weren't possible before,
17 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
18 * Implemented relational::subs().
19 * Fixed bug in simplify_ncmul() for clifford objects.
20 * Fixed LaTeX output of indexed and matrix objects and powers thereof.
21 * Fixed matrix::pow(n) for n==0.
22 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
23 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
24 of any class (except add/mul/ncmul/numeric) for "s". They should even work
25 if "s" is a "power" object, as long as the exponent is non-integer, but with
26 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
27 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
28 * Speedup in expand().
29 * Faster Bernoulli numbers (Markus Nullmeier).
30 * Fixed a bug where quo() would call vector::reserve() with a negative
32 * Several small bugfices in code generation, output and documentation.
34 1.0.2 (19 December 2001)
35 * Input parser recognizes "sqrt()", which is also used in the output.
36 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
38 * Fixed small bug in dummy index renaming which could cause it to not
39 recognize renamable indices in some cases.
40 * power::degree() and power::ldegree() throw an exception when encountering
41 a non-integer exponent.
42 * Add output-support for Python bindings.
44 1.0.1 (22 November 2001)
45 * Function sqrfree() handles a few more cases now.
46 * Class relational has real canonical ordering now.
47 * Handle obscene libreadline version numbers when building ginsh.
49 1.0.0 (6 November 2001)
50 * Some internal reorganization resulting in a general speed-up.
51 * The last 3 evaluated expressions in ginsh are now referred to with the
52 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
53 compatibility but may be removed in a future version of GiNaC.
55 0.9.4 (20 September 2001)
56 * Functions have better support for external scripting languages.
57 * Interface cleanups and bugfixes.
58 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
60 0.9.3 (16 August 2001)
61 * series expansion now much more consistent for small order expansion.
62 * lsolve() accepts algorithmic hint as parameter.
65 * Epsilon tensor is more functional.
66 * simplify_indexed() is better at detecting expressions that vanish for
68 * Several little bugfixes and consistency enhancements.
71 * Ctors of class numeric are not explicit any more. All built-in callers for
72 pseudofunctions are now templated and default to ex arguments which relaxes
73 the need for explicit ctors.
74 * New functions/methods:
76 - remove_first(), remove_last(), sort() and unique() for lists
79 * Instead of just totally symmetric or antisymmetric, complex symmetries
80 can now be defined for indexed objects. Symmetries are described by a
81 tree of "symmetry" objects that is constructed with the sy_none(),
82 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
83 with respect to its arguments can also be defined (this is currently
84 only used for the Beta function).
85 * Generalized map() to take a function object instead of a function pointer.
86 This allows passing an arbitrary number of additional state to the
87 function being called.
88 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
89 better with container classes, e.g. using color_trace() on a relation will
90 take the trace on both sides, using diff() on a matrix differentiates every
92 * diff() works properly with non-commutative products and indexed objects.
93 * New option flag "expand_function_args" for expand().
94 * Supplement some (now deprecated) macros by inlined template functions:
95 - is_of_type(foo, type) -> is_a<type>(foo)
96 - is_ex_of_type(foo, type) -> is_a<type>(foo)
97 - is_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
98 - is_ex_exaclty_of_type(foo, type) -> is_exaclty_a<type>(foo)
99 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
100 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
102 * Small bugfixes in pattern matching.
103 * Updated libtool to version 1.4.
106 * In the output and in ginsh, lists are now delimited by { } braces, and
107 matrices are delimited by single [ ] brackets.
108 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
109 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
110 * New functions/methods:
111 - canonicalize_clifford() (helpful when comparing expressions containing
113 - symmetrize() and antisymmetrize()
114 - numer_denom() (return numerator and denominator in one call)
115 - map() (apply function to subexpressions)
116 - evalm() (evaluate sums, products and integer powers of matrices)
117 * Added a new function match() for performing pattern matching. subs() and
118 has() also accept patterns as arguments. A pattern can be any expression,
119 optionally containing wildcard objects. These are constructed with the
120 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
122 * Positive integer powers of non-commutative expressions (except matrices)
123 are automatically expanded.
124 * Removed cint subdirectory, ginaccint is a separate package now due to
125 packaging considerations.
126 * Several little bugfixes.
129 * color and clifford classes are functional and documented.
130 * New "spinidx" class for dotted/undotted indices.
131 * Predefined spinor metric tensor (created by spinor_metric()).
132 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
133 * LaTeX output of indexed objects is much nicer.
134 * Fixed some build problems (with recent libreadline).
135 * Semantics of arithmetic operators now follows the C++ rules more strictly.
137 0.8.2 (24 April 2001)
138 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
139 non-symbols as the second argument in ginsh.
140 * the argument to collect() can be a list of objects in which case the
141 result is either a recursively collected polynomial, or a polynomial in
142 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
143 the second argument to collect().
144 * Several bugfixes (including a nasty memory leak in .normal()).
145 * class matrix: solve() doesn't call algorithms redundantly any more and
146 inverse() falls back to solve() which works in more general cases.
148 0.8.1 (16 April 2001)
149 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
150 be used with constants, functions and indexed expressions as well, so you
151 can use it to collect by powers of Pi or sin(x), or to find the coefficient
154 - it only works with symbols, constants, functions and indexed expressions,
155 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
156 - it does not know about dummy index summations; the coefficient of
157 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
158 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
159 noncommutative products might return wrong or surprising results.
160 * subs() no longer only substitutes symbols and indices but performs a more
161 general "syntactic substitution", i.e. it substitutes whole objects in sub-
162 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
165 - substituting numerics (subs(expr, 2==4)) will not replace then in all
166 occurences; in general, you shouldn't substitute numerics, though.
167 * Added preliminary (re)implementations of color and clifford classes.
168 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
170 * Replaced the various print*() member functions by a single print() that
171 takes a print_context object that determines the output formatting. This
172 should make it easier to add more output types, such as LaTeX output,
173 which is based on work by Stefan Weinzierl.
174 * Added functions to retrieve the properties stored in archive objects
175 outside of unarchive() (for printing or debugging purposes).
176 * Some bugfixes (indexed objects, archive writing).
177 * .collect() on non-polynomials is now algebraically correct.
179 0.8.0 (24 March 2001)
180 * Complete revamp of indexed objects. Instead of multiple classes for
181 indexed things and their indices there is now only one "indexed" class
182 and two types of indices: "idx" for simple indices and "varidx" for
183 indices with variance. There are predefined delta, epsilon and metric
184 tensors, and a function simplify_indexed() that performs canonicalization
185 and dummy index summations. Matrix objects can be indexed for doing simple
187 * Added an option "expand_indexed" to expand() to perform expansion of
188 indexed objects like (a+b).i -> a.i + b.i
189 * Renamed get_indices() to get_free_indices(), which no longer returns
190 dummy indices and checks the consistency of indices in sums.
191 * sqrfree() factorization fixed and improved syntactically.
192 * subs() works on matrices.
193 * Matrices can be constructed from flat list of elements; diagonal matrices
194 can be constructed from list of diagonal elements with diag_matrix().
195 * Fixed memory leak in expand().
196 * Operator% for objects of class ncmul has gone. Use operator* now for that
197 case too, which is much more natural.
199 0.7.3 (28 February 2001)
200 * Several bugfixes and minor performance tunings.
201 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
202 * Closed many in-source documentation gaps.
204 0.7.2 (17 February 2001)
205 * Several bugfixes in power series expansion, one of them critical.
207 0.7.1 (7 February 2001)
208 * Fix problems with Cint that were caused by CLN's overloaded operator new.
209 * Fix compilation errors with GCC3.
210 * normal() handles large sums of fractions better and normalizes the exponent
211 of power expressions.
212 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
213 * Some bugfixes of series expansion around branch cuts of special functions.
215 0.7.0 (15 December 2000)
216 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
217 actual representation any more. This is a speedup.
218 * mul::expand() was reengineered to not allocate excess temporary memory.
219 * Non-integer powers of a symbol are treated as constants by (l)degree() and
220 coeff(). Using these functions on an expression containing such powers used
221 to fail with an internal error message. The side-effect is that collect()
222 can be used on expressions which are not polynomials.
223 * Added a man page for the ginac-config script.
224 * Ctor of numeric from char* honors Digits.
226 0.6.4 (10 August 2000)
227 * Complete revamp of methods in class matrix. Some redundant (and poor)
228 implementations of elimination schemes were thrown out. The code is now
229 highly orthogonal, more flexible and much more efficient.
230 * Some long standing and quite nasty bugs were discovered and fixed in the
231 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
234 * Derivatives are now assembled in a slightly different manner (i.e. they
235 might 'look' different on first sight). Under certain circumstances this
236 can result in a dramatic speedup because it gives hashing a better chance,
237 especially when computing higher derivatives.
238 * Some series expansions of built-in functions have been reengineered.
239 * The algorithm for computing determinants can be chosen by the user. See
240 ginac/flags.h and ginac/matrix.h.
241 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
242 proper series expansion.
243 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
244 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
247 * ginaccint.bin is now launched by a binary program instead of by a scripts.
248 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
250 * Several minor bugfixes.
253 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
254 * Several bugfixes in target install.
257 * IMPORTANT: Several interface changes make programs written with GiNaC
258 much clearer but break compatibility with older versions:
259 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
260 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
261 - gamma() -> tgamma() (The true Gamma function, there is now also
262 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
263 - EulerGamma -> Euler
264 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
265 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
266 library version numbers.
267 * Expressions can be constructed from strings like this:
268 ex e("2*x+y", lst(x, y));
269 * ex::to_rational() provides a way to extend the domain of functions like
270 gcd() and divide() that only work on polynomials or rational functions (the
271 good old ex::subs() method reverses this process)
272 * Calling diff() on a function that has no derivative defined returns the
273 inert derivative function "Derivative".
274 * Several new timings in the check target. Some of them may be rather rude
275 at your machine, feel free to interrupt them.
277 0.5.4 (15 March 2000)
278 * Some algorithms in class matrix (notably determinant) were replaced by
279 less brain-dead ones and should now have much better performance.
280 * Checks were completely reorganized and split up into three parts:
281 a) exams (small regression tests with predefined input)
282 b) checks (lenghty coherence checks with random input)
283 c) timings (for coherence and crude benchmarking)
284 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
285 * Expanded expressions now remember they are expanded to prevent
286 superfluous expansions.
287 * Small bugfixes and improvements in the series expansion.
289 0.5.3 (23 February 2000)
290 * A more flexible scheme for registering functions was implemented,
291 allowing for remembering, too.
294 0.5.2 (16 February 2000)
295 * Mainly fixes a bug in the packaging of release 0.5.1.
297 0.5.1 (14 February 2000)
298 * Fixes a small number of bugs.
300 0.5.0 (7 February 2000)
301 * Expressions can be written ("archived") to files and read therefrom.
302 * Addition of GiNaC-cint, which lets you write complete programs in
303 an interactive shell-like manner in your favoured programming
306 0.4.1 (13 December 1999)
307 * Series Expansion of Gamma function and some other trigonometric
308 functions at their poles works now.
309 * Many more evaluations of special functions at points where
311 * info_flags::rational doesn't return true for complex extensions
312 any more---use info_flags::crational for the old behaviour.
313 info_flags::integer and -::cinteger work similarly, the same
314 holds for types like info_flags::rational_polynomial.
316 0.4.0 (26 November 1999)
317 * First public release.