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