1 This file records noteworthy changes.
4 * integral() and eval_integ() can be used from ginsh.
5 * Integrals can be series-expanded.
6 * clifford_moebius_map() accepts a representation label specification.
7 * Fixed a library initialization problem.
8 * GiNaC compiles from tarball even if lex/flex is missing.
10 1.3.0 (19 October 2004)
11 * The Clifford classes have been generalized to allow working with Clifford
12 algebras generated by arbitrary symmetric tensors or matrices. Also, a lot
13 of new functions for Clifford algebras have been added, including
14 automorphisms and Moebius transformations. [V. Kisil]
15 * Added some basic symbolic and numeric integration facilities. [C. Dams]
16 * The multiple polylogarithm Li() now evaluates numerically for arbitrary
18 * New functions G(a,y) and G(a,s,y) added (another notation for multiple
21 1.2.4 (12 October 2004)
22 * Added ex::unitcontprim() to compute the unit, content, and primitive parts
23 of a polynomial in one go.
24 * binomial(n, k) evaluates for non-integer arguments n.
25 * Li(2,x) now evaluates for +-I.
27 * Fixed bug in Li(n,x) (if Li(2,x) was calculated with high precision the
28 enlargement of the look-up table caused a segmentation fault).
29 * Fixed another bug in the series expansion of powers, and a bug in
32 1.2.3 (13 August 2004)
33 * Added variants of dirac_trace() and color_trace() that take the trace over
34 more than one representation label by specifying a set or list of labels.
35 * diracgamma::contract_with() uses Chisholm identities in 4 dimensions to
36 produce more compact results.
37 * Fixed a bug in the series expansion of powers.
38 * The --enable-html-doc and --enable-ps-doc configure options are gone.
39 Documentation in HTML, DVI, PostScript, and PDF formats is now built with
40 "make html", "make dvi", "make ps", and "make pdf", respectively. The only
41 documentation that gets built by default are the tutorial in .info format
45 * Added const_preorder_iterator and const_postorder_iterator classes (and
46 associated methods ex::pre/postorder_begin/end()) providing tree traversal
48 * Fixed the LaTeX output of the varidx class.
49 * Fixed bugs in series expansion and complex conjugation.
50 * (p.i*p.i).get_free_indices() returns the correct result () instead of (.i).
51 * Symbolic functions without any eval(), evalf() etc. functions now work
53 * integer_content(), content(), and primpart() now also work for polynomials
54 with rational coefficients (calculating the LCM of coefficients'
56 * Added method matrix::rank().
57 * Added function resultant().
58 * Added integer_content() function to ginsh.
61 * Fixed infinite recursion in atan2_evalf() and improved atan2_eval().
62 * Added automatic evaluations for trigonometric functions with negative
63 arguments (e.g. sin(-2) -> -sin(2)).
64 * Fixed a static initialization order goof-up.
65 * Fixed various bugs in series expansion.
68 * Added a structure<T> template class for the easy creation of user-defined
70 * Added support for (acyclic) visitors, to allow cleaner implementations of
72 * Added a const_iterator class that can be used instead of op()/nops().
73 * Completely revamped the implementation of expression output. It is now
74 possible to add new output formats, to change the behavior of predefined
75 formats at run-time, and to have different output styles for algebraic
77 * Symbols can be made non-commutative.
78 * Added a method ex::conjugate() and a function conjugate() for complex
79 conjugation. Symbols can be declared as real or complex-valued.
80 * Improved the speed of subs(), normal(), to_rational() and to_polynomial()
81 by the use of maps instead of lists. The old forms
82 subs(const lst & ls, const lst & lr, unsigned options)
83 to_rational/to_polynomial(lst & repl)
84 are still available for compatibility, but using the new forms
85 subs(const exmap & m, unsigned options)
86 to_rational/to_polynomial(exmap & repl)
87 is more efficient, especially when the number of replacements is large.
88 * quo(), rem(), prem(), sprem(), decomp_rational(), unit(), content(),
89 primpart() and matrix::charpoly() now take a "const ex &" instead of a
91 * Redundant expressions (two ex pointing to different objects are found to be
92 equal in compare()) are now actively deleted/fused to conserve memory and
93 speed up subsequent comparisons. This behavior can be suppressed on a
94 per-object level with status_flags::not_shareable. Lists and matrices are
95 not shareable by default.
96 * Lots of internal streamlining and optimizations.
97 * Caveats for class implementors:
98 - basic::copy() and basic::destroy() are gone; classes derived from
99 basic can use the defaults for the assignment operator and copy
101 - basic::subs(), basic::normal(), basic::to_rational() and
102 basic::to_polynomial() take 'exmap' objects instead of lists.
103 - basic::subs() now descends into subexpressions (if accessible via
104 nops()/op()/let_op()). If you have a custom implementation of subs()
105 that calls basic::subs() after substituting subexpressions, this needs
106 to be changed to a call to subs_one_level().
107 - lst::thislst() and exprseq::thisexprseq() renamed to thiscontainer().
108 - thiscontainer() and associated constructors now take a std::auto_ptr.
109 - Overloading basic::print() is now deprecated. You should use
110 print_func<>() class options instead.
112 1.1.7 (11 March 2004)
113 * Fixed a bug in canonicalize_clifford().
114 * Series expansion now works predictably. All terms with the exponent of the
115 expansion variable smaller than the given order are calculated exactly. If
116 the series is not terminating, the Order function is (at least) of the given
119 1.1.6 (22 January 2004)
120 * Added a function option "dummy()" which means "no options". This simplifies
121 the implementation of symbolic functions which are not to be further
123 * Removed a bug in the numerical evaluation of Li() that caused the system
124 to hang for certain parameter combinations.
125 * Fixed a bug in the calculation of hash values for indices that could lead
126 to wrong results or bogus error messages from simplify_indexed().
127 * Fixed a bug in the evaluation of harmonic polylogarithms for complex
128 arguments with positive imaginary part.
130 1.1.5 (5 November 2003)
131 * Harmonic polylogarithms now numerically evaluate for arbitrary arguments
132 (parameter must still be positive integers).
133 * The zeta function now can also be given a lst as a parameter in which case
134 it becomes a multiple zeta value. The use of mZeta is deprecated.
135 * The order of parameters for the multiple polylogarithm has been corrected.
136 * Documentation for the nested sums functions zeta, harmonic polylog, multiple
137 polylog, etc. has been added.
139 1.1.4 (17 October 2003)
140 * Lists and matrices can now be initialized from comma-separated lists of
141 expressions, like this:
151 This is both faster and produces much smaller code than the old constructors
152 lst(ex, ex, ...) and matrix(unsigned, unsigned, lst), especially in the case
153 of matrices, and is now the recommended way to create these objects.
154 * The function mZeta now evaluates much faster for arbitrary parameters. The
155 harmonic and multiple polylogarithms evaluate considerably faster and check
156 for convergence. The order of parameters for the harmonic polylogarithm
159 1.1.3 (22 August 2003)
160 * Added new symbolic functions for better integration with nestedsums:
161 (multiple) polylogarithm Li(), Nielsen's generalized polylogarithm S(),
162 harmonic polylogarithm H(), and multiple zeta value mZeta().
163 * New exhashmap<T> template intended as a drop-in replacement for
164 std::map<ex, T, ex_is_less> using GiNaC's hashing algorithms.
166 1.1.2 (11 August 2003)
167 * Fixed a bug in the unarchiving of sums and products: terms were not
168 reordered in a canonical way.
169 * Fixed a bug in normal()/numer_denom(): denominator was not made unit
170 normal if it was a simple number.
171 * Improved the speed of subs() in some cases.
174 * lst (and exprseq) provide iterators for read-only element access. For
175 sequential access this is one order faster than using op().
176 * Implemented relational::subs() (this was done in 1.0.9 but inadvertently
177 omitted from the 1.1 branch).
178 * pole_error and do_taylor are available to library users.
179 * Added on-line help and Tab-completion for print(), iprint(), print_latex()
180 and print_csrc() in ginsh.
183 * Removed deprecated macros is_ex_a, is_ex_exactly_a and friends for good.
184 * The scalar_products mechanism allows the specification of an index dimension.
185 * Removed dirac_gamma6/7().
186 * Added ex::to_polynomial().
187 * subs() accepts an optional "options" argument. The option
188 subs_option::subs_algebraic enables "smart" substitutions in products and
190 * Added stream manipulators "dflt", "latex", "python", "python_repr", "tree",
191 "csrc", "csrc_float", "csrc_double", "csrc_cl_N", "index_dimensions" and
192 "no_index_dimensions" to control the output format. Calling basic::print()
193 directly is now deprecated.
194 * Made the hashing more simple and efficient.
195 * Caveats for class implementors:
196 - basic::subs(): third argument changed from "bool" to "unsigned"
197 - unarchiving constructor and basic::unarchive(): "const" removed from
199 - basic::let_op() should only be implemented if write access to
200 subexpressions is desired
201 - simplify_ncmul() renamed to eval_ncmul()
202 - simplified_ncmul() renamed to hold_ncmul()
203 - nonsimplified_ncmul() renamed to reeval_ncmul()
205 1.0.14 (1 March 2003)
206 * Improved the C-source output: complex numbers are printed correctly (using
207 the STL complex<> template or cln::complex()), rational numbers use cl_RA()
208 in the CLN output, and small integers are printed in a more compact format
209 (e.g. "2.0" instead of "2.0000000e+00").
210 * function_options::set_return_type() and function_options::do_not_evalf_params()
213 1.0.13 (27 January 2003)
214 * Contracting epsilon tensors with Euclidean indices now works.
215 * Improved dummy index symmetrization in sums.
216 * Added dirac_gammaL/R(), which can be used instead of dirac_gamma6/7()
217 but are single objects, to allow for a more compact notation of Dirac
219 * Powers with negative numeric exponents are printed as fractions in the
221 * Added symbolic_matrix() for the convenient creation of matrices filled
223 * Added collect_common_factors() which collects common factors from the
225 * simplify_indexed() converts "gamma~mu*p.mu" to "p\".
227 1.0.12 (30 October 2002)
228 * Fixed a bug in power::expand() that could produce invalid expressions.
229 * The input parser no longer ignores extra data following accepted input.
230 * Improved the CLN C-source output (integers are printed as integers, and
231 floating point numbers include the precision).
232 * Fixed a problem in the LaTeX-output of negative fractions.
233 * Added print_latex() and print_csrc() to ginsh.
234 * The sprem() function is now public.
236 1.0.11 (18 September 2002)
237 * Fixed a possible memory corruption in contractions of indexed objects with
238 delta or metric tensors.
239 * Computing the derivative of a power series object with respect to a symbol
240 that is not the expansion variable now works correctly.
241 * Several bugfixes in code generation.
243 1.0.10 (24 July 2002)
244 * Powers of indexed objects are now parenthesized correctly in LaTeX output.
245 * Input parser handles indices (they have to be specified in the same list
247 * Added some limited support for subspaces in the idx and tensor classes.
248 * Fixed a bug in canonicalize() (antisymmetric canonicalization of an already
249 sorted list containing two or more equal objects failed to return 0).
252 * simplify_indexed() now raises/lowers dummy indices to canonicalize the index
253 variance. This allows some simplifications that weren't possible before,
254 like eps~a.b~c~d*X.a*X~b -> 0 and X.a~a-X~a.a -> 0.
255 * Implemented relational::subs().
256 * Fixed bug in simplify_ncmul() for clifford objects.
258 1.0.8 (31 March 2002)
259 * Improvements in memory usage of the expand() methods.
261 1.0.7 (18 March 2002)
262 * Fixed LaTeX output of indexed and matrix objects.
263 * Fixed matrix::pow(n) for n==0 and added helper functions to create unit
264 matrices "ex unit_matrix(unsigned, unsigned)".
267 * "(x+1).subs(x==x-1)" now returns the correct result "x" instead of "x-1".
269 1.0.5 (27 January 2002)
270 * (l)degree(s), coeff(s, n) and collect(s) were extended to accept expressions
271 of any class (except add/mul/ncmul/numeric) for "s". They should even work
272 if "s" is a "power" object, as long as the exponent is non-integer, but with
273 some limitations. For example, you can "collect(a*2^x+b*2^x, 2^x)" to get
274 "(a+b)*2^x", but "degree(2^(3*x), 2^x)" yields 0 instead of 3).
275 * Fixed a small output bug.
277 1.0.4 (24 January 2002)
278 * Speedup in expand().
279 * Faster Bernoulli numbers (Markus Nullmeier).
280 * Some minor bugfixes and documentation updates.
282 1.0.3 (21 December 2001)
283 * Fixed a bug where quo() would call vector::reserve() with a negative
285 * Fix several bugs in code generation.
287 1.0.2 (19 December 2001)
288 * Input parser recognizes "sqrt()", which is also used in the output.
289 * divide(a,b,q) only modifies q if the division succeeds; also, divide(a,b,a)
291 * Fixed small bug in dummy index renaming which could cause it to not
292 recognize renamable indices in some cases.
293 * power::degree() and power::ldegree() throw an exception when encountering
294 a non-integer exponent.
295 * Add output-support for Python bindings.
297 1.0.1 (22 November 2001)
298 * Function sqrfree() handles a few more cases now.
299 * Class relational has real canonical ordering now.
300 * Handle obscene libreadline version numbers when building ginsh.
302 1.0.0 (6 November 2001)
303 * Some internal reorganization resulting in a general speed-up.
304 * The last 3 evaluated expressions in ginsh are now referred to with the
305 tokens '%', '%%' and '%%%'. The old '"', '""' and '"""' remain for
306 compatibility but may be removed in a future version of GiNaC.
308 0.9.4 (20 September 2001)
309 * Functions have better support for external scripting languages.
310 * Interface cleanups and bugfixes.
311 * Fix silly bug in evalf() that prevented things like 2^Pi being computed.
313 0.9.3 (16 August 2001)
314 * series expansion now much more consistent for small order expansion.
315 * lsolve() accepts algorithmic hint as parameter.
318 * Epsilon tensor is more functional.
319 * simplify_indexed() is better at detecting expressions that vanish for
321 * Several little bugfixes and consistency enhancements.
324 * Ctors of class numeric are not explicit any more. All built-in callers for
325 pseudofunctions are now templated and default to ex arguments which relaxes
326 the need for explicit ctors.
327 * New functions/methods:
329 - remove_first(), remove_last(), sort() and unique() for lists
330 - symmetrize_cyclic()
332 * Instead of just totally symmetric or antisymmetric, complex symmetries
333 can now be defined for indexed objects. Symmetries are described by a
334 tree of "symmetry" objects that is constructed with the sy_none(),
335 sy_symm(), sy_anti() and sy_cycl() functions. The symmetry of a function
336 with respect to its arguments can also be defined (this is currently
337 only used for the Beta function).
338 * Generalized map() to take a function object instead of a function pointer.
339 This allows passing an arbitrary number of additional state to the
340 function being called.
341 * color_trace(), dirac_trace(), diff(), expand(), evalf() and normal() work
342 better with container classes, e.g. using color_trace() on a relation will
343 take the trace on both sides, using diff() on a matrix differentiates every
345 * diff() works properly with non-commutative products and indexed objects.
346 * New option flag "expand_function_args" for expand().
347 * Supplement some (now deprecated) macros by inlined template functions:
348 - is_of_type(foo, type) -> is_a<type>(foo)
349 - is_ex_of_type(foo, type) -> is_a<type>(foo)
350 - is_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
351 - is_ex_exactly_of_type(foo, type) -> is_exactly_a<type>(foo)
352 - ex_to_foobar(baz) -> ex_to<foobar>(baz)
353 * rem(c, p[x], x) (c: numeric, p[x]: polynomial) erroneously returned p[x]
355 * Small bugfixes in pattern matching.
356 * Updated libtool to version 1.4.
359 * In the output and in ginsh, lists are now delimited by { } braces, and
360 matrices are delimited by single [ ] brackets.
361 * simplify_indexed() renames dummy indices so, e.g., "a.i*a.i+a.j*a.j" gets
362 simplified to "2*a.i*a.i" (or "2*a.j*a.j").
363 * New functions/methods:
364 - canonicalize_clifford() (helpful when comparing expressions containing
366 - symmetrize() and antisymmetrize()
367 - numer_denom() (return numerator and denominator in one call)
368 - map() (apply function to subexpressions)
369 - evalm() (evaluate sums, products and integer powers of matrices)
370 * Added a new function match() for performing pattern matching. subs() and
371 has() also accept patterns as arguments. A pattern can be any expression,
372 optionally containing wildcard objects. These are constructed with the
373 call "wild(<unsigned>)" and are denoted as "$0", "$1" etc. in the output
375 * Positive integer powers of non-commutative expressions (except matrices)
376 are automatically expanded.
377 * Removed cint subdirectory, ginaccint is a separate package now due to
378 packaging considerations.
379 * Several little bugfixes.
382 * color and clifford classes are functional and documented.
383 * New "spinidx" class for dotted/undotted indices.
384 * Predefined spinor metric tensor (created by spinor_metric()).
385 * Symbols can have a LaTeX name, e.g. symbol s("s", "\\sigma");
386 * LaTeX output of indexed objects is much nicer.
387 * Fixed some build problems (with recent libreadline).
388 * Semantics of arithmetic operators now follows the C++ rules more strictly.
390 0.8.2 (24 April 2001)
391 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() work with
392 non-symbols as the second argument in ginsh.
393 * the argument to collect() can be a list of objects in which case the
394 result is either a recursively collected polynomial, or a polynomial in
395 a distributed form with terms like coeff*x1^e1*...*xn^en, as specified by
396 the second argument to collect().
397 * Several bugfixes (including a nasty memory leak in .normal()).
398 * class matrix: solve() doesn't call algorithms redundantly any more and
399 inverse() falls back to solve() which works in more general cases.
401 0.8.1 (16 April 2001)
402 * degree(), ldegree(), coeff(), lcoeff(), tcoeff() and collect() can now
403 be used with constants, functions and indexed expressions as well, so you
404 can use it to collect by powers of Pi or sin(x), or to find the coefficient
407 - it only works with symbols, constants, functions and indexed expressions,
408 trying to find the coefficient of, e.g., "x^2" or "x+y" won't work;
409 - it does not know about dummy index summations; the coefficient of
410 gamma~0 in p.mu*gamma~mu should be p.0 but is returned as 0;
411 - using coeff(), tcoeff(), lcoeff() or collect() on elements of
412 noncommutative products might return wrong or surprising results.
413 * subs() no longer only substitutes symbols and indices but performs a more
414 general "syntactic substitution", i.e. it substitutes whole objects in sub-
415 expressions. You can subs((a+b)^2,a+b==3) and get 9, but subs(a+b+c,a+b==3)
418 - substituting numerics (subs(expr, 2==4)) will not replace then in all
419 occurences; in general, you shouldn't substitute numerics, though.
420 * Added preliminary (re)implementations of color and clifford classes.
421 * simplify_indexed(): contraction of symmetric and antisymmetric tensors
423 * Replaced the various print*() member functions by a single print() that
424 takes a print_context object that determines the output formatting. This
425 should make it easier to add more output types, such as LaTeX output,
426 which is based on work by Stefan Weinzierl.
427 * Added functions to retrieve the properties stored in archive objects
428 outside of unarchive() (for printing or debugging purposes).
429 * Some bugfixes (indexed objects, archive writing).
430 * .collect() on non-polynomials is now algebraically correct.
432 0.8.0 (24 March 2001)
433 * Complete revamp of indexed objects. Instead of multiple classes for
434 indexed things and their indices there is now only one "indexed" class
435 and two types of indices: "idx" for simple indices and "varidx" for
436 indices with variance. There are predefined delta, epsilon and metric
437 tensors, and a function simplify_indexed() that performs canonicalization
438 and dummy index summations. Matrix objects can be indexed for doing simple
440 * Added an option "expand_indexed" to expand() to perform expansion of
441 indexed objects like (a+b).i -> a.i + b.i
442 * Renamed get_indices() to get_free_indices(), which no longer returns
443 dummy indices and checks the consistency of indices in sums.
444 * sqrfree() factorization fixed and improved syntactically.
445 * subs() works on matrices.
446 * Matrices can be constructed from flat list of elements; diagonal matrices
447 can be constructed from list of diagonal elements with diag_matrix().
448 * Fixed memory leak in expand().
449 * Operator% for objects of class ncmul has gone. Use operator* now for that
450 case too, which is much more natural.
452 0.7.3 (28 February 2001)
453 * Several bugfixes and minor performance tunings.
454 * Added a section to the tutorial about adding new algebraic classes to GiNaC.
455 * Closed many in-source documentation gaps.
457 0.7.2 (17 February 2001)
458 * Several bugfixes in power series expansion, one of them critical.
460 0.7.1 (7 February 2001)
461 * Fix problems with Cint that were caused by CLN's overloaded operator new.
462 * Fix compilation errors with GCC3.
463 * normal() handles large sums of fractions better and normalizes the exponent
464 of power expressions.
465 * expand() always expands the exponent and transforms x^(a+b) -> x^a*x^b.
466 * Some bugfixes of series expansion around branch cuts of special functions.
468 0.7.0 (15 December 2000)
469 * Requires CLN 1.1 now. Class numeric doesn't use an indirect pointer to the
470 actual representation any more. This is a speedup.
471 * mul::expand() was reengineered to not allocate excess temporary memory.
472 * Non-integer powers of a symbol are treated as constants by (l)degree() and
473 coeff(). Using these functions on an expression containing such powers used
474 to fail with an internal error message. The side-effect is that collect()
475 can be used on expressions which are not polynomials.
476 * Added a man page for the ginac-config script.
477 * Ctor of numeric from char* honors Digits.
479 0.6.4 (10 August 2000)
480 * Complete revamp of methods in class matrix. Some redundant (and poor)
481 implementations of elimination schemes were thrown out. The code is now
482 highly orthogonal, more flexible and much more efficient.
483 * Some long standing and quite nasty bugs were discovered and fixed in the
484 following functions: add::normal(), heur_gcd(), sr_gcd() and Order_eval().
487 * Derivatives are now assembled in a slightly different manner (i.e. they
488 might 'look' different on first sight). Under certain circumstances this
489 can result in a dramatic speedup because it gives hashing a better chance,
490 especially when computing higher derivatives.
491 * Some series expansions of built-in functions have been reengineered.
492 * The algorithm for computing determinants can be chosen by the user. See
493 ginac/flags.h and ginac/matrix.h.
494 * The Dilogarithm (Li2) now has floating point evaluation, derivative and a
495 proper series expansion.
496 * Namespace 'std' cleanly disentangled, as demanded by ISO/EIC 14882-1998(E).
497 * Some minor bugfixes, one major lsolve()-bugfix and documentation updates.
500 * ginaccint.bin is now launched by a binary program instead of by a scripts.
501 This allows us to write #!-scripts. A small test suite for GiNaC-cint was
503 * Several minor bugfixes.
506 * Cleanup in the interface to Cint. The required version is now Cint 5.14.38.
507 * Several bugfixes in target install.
510 * IMPORTANT: Several interface changes make programs written with GiNaC
511 much clearer but break compatibility with older versions:
512 - f(x).series(x,p[,o]) -> f(x).series(x==p,o)
513 - series(f(x),x,p[,o]) -> series(f(x),x==p,o)
514 - gamma() -> tgamma() (The true Gamma function, there is now also
515 log(tgamma()), called lgamma(), in accord with ISO/IEC 9899:1999.)
516 - EulerGamma -> Euler
517 * #include'ing ginac.h defines the preprocessor symbols GINACLIB_MAJOR_VERSION,
518 GINACLIB_MINOR_VERSION, and GINACLIB_MICRO_VERSION with the respective GiNaC
519 library version numbers.
520 * Expressions can be constructed from strings like this:
521 ex e("2*x+y", lst(x, y));
522 * ex::to_rational() provides a way to extend the domain of functions like
523 gcd() and divide() that only work on polynomials or rational functions (the
524 good old ex::subs() method reverses this process)
525 * Calling diff() on a function that has no derivative defined returns the
526 inert derivative function "Derivative".
527 * Several new timings in the check target. Some of them may be rather rude
528 at your machine, feel free to interrupt them.
530 0.5.4 (15 March 2000)
531 * Some algorithms in class matrix (notably determinant) were replaced by
532 less brain-dead ones and should now have much better performance.
533 * Checks were completely reorganized and split up into three parts:
534 a) exams (small regression tests with predefined input)
535 b) checks (lenghty coherence checks with random input)
536 c) timings (for coherence and crude benchmarking)
537 * Behaviour of .evalf() was changed: it doesn't .evalf() any exponents.
538 * Expanded expressions now remember they are expanded to prevent
539 superfluous expansions.
540 * Small bugfixes and improvements in the series expansion.
542 0.5.3 (23 February 2000)
543 * A more flexible scheme for registering functions was implemented,
544 allowing for remembering, too.
547 0.5.2 (16 February 2000)
548 * Mainly fixes a bug in the packaging of release 0.5.1.
550 0.5.1 (14 February 2000)
551 * Fixes a small number of bugs.
553 0.5.0 (7 February 2000)
554 * Expressions can be written ("archived") to files and read therefrom.
555 * Addition of GiNaC-cint, which lets you write complete programs in
556 an interactive shell-like manner in your favoured programming
559 0.4.1 (13 December 1999)
560 * Series Expansion of Gamma function and some other trigonometric
561 functions at their poles works now.
562 * Many more evaluations of special functions at points where
564 * info_flags::rational doesn't return true for complex extensions
565 any more---use info_flags::crational for the old behaviour.
566 info_flags::integer and -::cinteger work similarly, the same
567 holds for types like info_flags::rational_polynomial.
569 0.4.0 (26 November 1999)
570 * First public release.