+2013-07-21, version 1.3.3
+=========================
+
+Implementation changes
+----------------------
+
+* Fix integer input of leading zeros in power-of-two base.
+
+* Fix several floating-poing conversion bugs involving huge numbers.
+
+* Fix bug that would set input stream fail state when reading a number at EOF.
+
+Other changes
+-------------
+
+* Support the x32 ABI.
+
+
+2011-05-08, version 1.3.2
+=========================
+
+Implementation changes
+----------------------
+
+* Fixed a bug in scale_float(cl_LF, cl_I) when the scale factor exceeded 2^31
+ on x86.
+
+Other changes
+-------------
+
+* Improved portability to some non-GCC compilers.
+
+
+2009-09-24, version 1.3.1
+=========================
+
+Implementation changes
+----------------------
+
+* Fixed a crash in double_approx(cl_RA) on 64-bit platforms.
+
+* Add basic support for Renesas SH (sh4).
+
+
+2009-06-30, version 1.3.0
+=========================
+
+Other changes
+-------------
+
+* Use the GNU autotools as build system.
+
+* Implemented a more portable module dependency mechanism.
+
+
+2008-04-05, version 1.2.2
+=========================
+
+Implementation changes
+----------------------
+
+* Re-establish CLN-1.2.0 ABI and fix ARM build, both inadvertently broken in
+ the previous release.
+
+
+2008-03-24, version 1.2.1
+=========================
+
+Implementation changes
+----------------------
+
+* Fixed some bugs in the output of numbers larger than 2^32 decimal digits.
+
+Other changes
+-------------
+
+* Modifying C/C++ operators like +=, ++, etc. are now enabled by default.
+
+
+2008-01-19, version 1.2.0
+=========================
+
+Algorithmic changes
+-------------------
+
+* Save big amounts of memory in computation of some functions and constants by:
+ - Avoiding pre-computation of series terms and instead computing them in a
+ streamed way.
+ - Avoiding computation with excess precision in binary splitting algorithm
+ by coercion of intermediate integer values to floating-point as early as
+ possible.
+
+Implementation changes
+----------------------
+
+* Added support for huge numbers:
+ - intC used for all counter loops.
+ - intE is now a 64-bit type on all 64-bit platforms and even on selected
+ 32-bit platforms.
+
+* CLN now uses C++ exceptions for error handling. The cl_abort() hook is not
+ supported any more. Please refer to the documentation to learn about existing
+ exception types.
+
+* Fixed a bug on i386 where comparing Z/2Z ring zeros returnd random results.
+
+* Removed cl_boolean. Use built-in C++ bool instead.
+
+Other changes
+-------------
+
+* Dropped the cln-config script. Please use pkg-config instead.
+
+* Updated infrastructure to that of libtool-1.5.24.
+
+* Changed encoding of all files to UTF-8.
+
+* Fix compilation issues with GCC-4.3.
+
+* Fix linking issues on platforms that don't feature weak symbols (like win32).
+
+
+2006-08-08, version 1.1.13
+==========================
+
+* Compilation fixes for 64-bit brokenness introduced in last release.
+
+
+2006-08-06, version 1.1.12
+==========================
+
+Implementation changes
+----------------------
+
+* Fix rare assertion when printing quite large floats.
+
+Other changes
+-------------
+
+* Compilation fixes for several platforms: *BSD, Intel Mac, and MinGW.
+
+
+2005-11-23, version 1.1.11
+==========================
+
+Algorithmic changes
+-------------------
+
+* Considerably improved performance of number input.
+
+
+2005-10-22, version 1.1.10
+==========================
+
+Implementation changes
+----------------------
+
+* Removed the vptr of modular integer and univariate polynomial
+ classes in order to fix some crashes in that sector of CLN. Code
+ using this needs to be recompiled.
+
+* Many more operator signatures make the integration of CLN types with
+ float/double easier.
+
+Other changes
+-------------
+
+* Several compilation fixes.
+
+* Made it possible to cross-compile CLN.
+
+
2004-11-03, version 1.1.9
=========================
----------------------
* Moved the sources to subdirectories.
- (Suggested by Jörg Arndt.)
+ (Suggested by Jörg Arndt.)
Other changes
-------------
-------------------
* Speed up the multiplication of large numbers by use of an FFT based
- algorithm (Schönhage-Strassen). The improvement is noticeable when both
+ algorithm (Schönhage-Strassen). The improvement is noticeable when both
factors have at least 1250 words = 40000 bits = 12000 decimal digits.
* Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
git://www.ginac.de / cln.git / blobdiff