* m4/general.m4 (CL_CANONICAL_HOST_CPU): Force host_cpu=rs6000 for

[cln.git] / NEWS

diff --git a/NEWS b/NEWS
index 87fb4668a91c33c676a17f3768f33138e46907ff..0b5a323e55bc88626dd42156c099cfb7b046b9cd 100644 (file)
--- a/NEWS
+++ b/NEWS
@@ -1,9 +1,140 @@
-2003-12-xy, version 1.1.6
+2007-mm-dd, version 1.2.0
+=========================
+
+Implementation changes
+----------------------
+
+* Added support for huge numbers...
+* CLN now uses C++ exceptions for error handling.
+* Removed cl_boolean. Use built-in C++ bool instead.
+* Dropped the cln-config script. Please use pkg-config instead.
+
+Algorithmic changes
+-------------------
+
+* Save a lot of memory during computation of some constants.
+
+
+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
+=========================
+
+Algorithmic changes
+-------------------
+
+* Input of numbers in bases 2, 4, 8, 16 and 32 is now done in linear bit
+  complexity as opposed to O(N^2). Useful for all kinds of persistency.
+
+Implementation changes
+----------------------
+
+* Fixed several bugs in the integer input and output routines that could be
+  blamed for random crashes in the following cases: output in base 32 for
+  quite large numbers, input in base 2 for fixnums and input in base 3 for
+  fixnums on a 64 bit target.
+
+* Fixed crash when radix specifiers were used in input streams.
+
+* Speed up on x86_64 and ia64 by adding some inline assembly.
+
+Other changes
+-------------
+
+* Fixes for compilation on MacOS X and little endian Mips.
+
+
+2004-07-01, version 1.1.8
+=========================
+
+Implementation changes
+----------------------
+
+* Fix bug in log(a,b) when b is 1/n.
+
+* Fix crash in shared library on AMD64.
+
+Other changes
+-------------
+
+* Fixes for some language conformance issues.
+
+
+2004-05-02, version 1.1.7
+=========================
+
+Implementation changes
+----------------------
+
+* Fixed two corner case bugs in cl_LF multiplication and sqrt.
+
+* Workaround GCC 3.[123] compiler bug.
+
+* Parallel build should work reliably now.
+
+
+2004-01-01, version 1.1.6
+=========================
+
+Functional changes
+------------------
+
+* New function
+  `sintL ldegree(const cl_UP& x)'.
+  (Suggested by Munagala Ramanath.)
 
 Implementation changes
 ----------------------
 
-* Fix a bug in polynomial subtraction.
+* Fixed a bug in polynomial subtraction.
   (Reported by Munagala Ramanath.)
 
 Other changes
@@ -13,7 +144,7 @@ Other changes
 
 * Updated infrastructure to autoconf-2.57.
 
-* Fix compilation issues with GCC-3.4 and on Mac OSX.
+* Fixed compilation issues with GCC-3.4 prereleases and on Mac OSX.
 
 
 2002-05-28, version 1.1.5
@@ -433,7 +564,7 @@ Implementation changes
 ----------------------
 
 * Moved the sources to subdirectories.
-  (Suggested by Jörg Arndt.)
+  (Suggested by Jörg Arndt.)
 
 Other changes
 -------------
@@ -537,7 +668,7 @@ Algorithmic 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