1 2000-11-xx, version 1.1.0
2 =========================
7 * ISO/IEC 14882 fashion adjustments:
8 Put everything into namespace cln. All fundamental data types still
9 carry their old names. Other non-macro identifiers are now written as
10 cln::foo instead of cl_foo, except where the cl_ comes from a data type
11 (as in cl_I_to_int()). Headers are installed into a separate
12 directory, #include <cln/foo.h> instead of <cl_foo.h>. Applications
13 must be manually ported to the new style. We apologize for the
16 Implementation changes
17 ----------------------
19 * Removed internal copy of mpn subdirectory tree from libgmp-2.0.2.
20 Configuring with --with-gmp now relies on an installed libgmp library
21 version 3 or above. We recommend libgmp-3.1 or newer.
23 * Adjusted several break-even points to make better use of a faster libgmp and
24 better match present-day CPUs.
26 * Fix several errors for architectures with 64-bit wide words.
29 * Fix compilation errors with current GCC-3.0 snapshots.
34 * Added package tools: script cln-config and autoconf macro AC_PATH_CLN
38 2000-01-13, version 1.0.3
39 =========================
45 `cl_I doublefactorial (uintL n)'.
47 Implementation changes
48 ----------------------
50 * Fix several little configuration errors.
52 * Fix some compilation errors with gcc-2.96 prereleases.
55 1999-09-07, version 1.0.2
56 =========================
62 `cl_I numerator (const cl_RA&)'
63 `cl_I denominator (const cl_RA&)'.
64 Suggested by Richard Kreckel and Sylvain Pion.
66 * New function `cl_equal_hashcode' for the classes cl_N, cl_R, cl_RA, cl_I,
67 cl_F, cl_SF, cl_FF, cl_DF, cl_LF.
68 Suggested by Richard Kreckel.
70 Implementation changes
71 ----------------------
73 * Fix an endless loop when either of the functions
74 `cl_boolean rootp (const cl_RA&, uintL, cl_RA*)',
75 `cl_boolean rootp (const cl_RA&, const cl_I&, cl_RA*)'
76 was called with an integer argument. Thanks to Richard Kreckel.
78 * Fix a bug in the addition and subtraction of rational numbers which could
79 cause unnormalized rational numbers like 3/1 to be created.
82 1999-06-09, version 1.0.1
83 =========================
88 * Speed up the functions `logand', `lognand', `logandc2'.
90 Implementation changes
91 ----------------------
93 * Fix compilation errors with gcc-2.7.2, egcs-1.1.2 and gcc-2.95.
95 * Fix compilation errors on HPPA, MIPS, some versions of DEC Alpha, OpenBSD,
98 * Fix compilation errors on Win32. Thanks to Mumit Khan.
101 1999-01-12, version 1.0
102 =======================
107 * New include files, containing I/O functions:
111 <cl_sfloat_io.h> <cl_ffloat_io.h> <cl_dfloat_io.h> <cl_lfloat_io.h>
114 The file <cl_io.h> now contains only I/O functions for characters and
117 * To access the base ring of a univariate polynomial ring, now use
118 `R->basering()' instead of `R->basering'.
120 * Implement `plusp', `max', `min' for the classes cl_F, cl_SF, cl_FF, cl_DF,
123 * Implement `abs' for the class cl_RA.
125 * Replaced `read_number' with specialized functions `read_complex',
126 `read_real', `read_float', `read_rational', `read_integer'.
128 * Replaced the functions
129 `void fprint (cl_ostream stream, int x)'
130 `void fprint (cl_ostream stream, unsigned int x)'
131 `void fprint (cl_ostream stream, long x)'
132 `void fprint (cl_ostream stream, unsigned long x)'
134 `void fprintdecimal (cl_ostream stream, int x)'
135 `void fprintdecimal (cl_ostream stream, unsigned int x)'
136 `void fprintdecimal (cl_ostream stream, long x)'
137 `void fprintdecimal (cl_ostream stream, unsigned long x)'
142 * The function `cl_I xgcd (const cl_I& a, const cl_I& b, cl_I* u, cl_I* v)'
143 now normalizes the resulting u and v to be of minimum absolute value.
144 (Suggested by the LiDIA group.)
146 * The conversion from string to cl_F, cl_R, cl_N now chooses the format of
147 the resulting float depending on the number of significant digits present
150 * Speed up the functions
151 `cl_R operator* (const cl_RA&, const cl_LF&)'
152 `cl_R operator* (const cl_LF&, const cl_RA&)'
153 `cl_R operator/ (const cl_RA&, const cl_LF&)'
154 `cl_LF operator/ (const cl_LF&, const cl_RA&)'
156 Implementation changes
157 ----------------------
159 * Fix for `cl_I ash (const cl_I& x, const cl_I& n)' when |n| is between
161 (Reported by Thomas Papanikolaou.)
163 * Fixed a memory leak in the long-float truncate function.
164 (Reported by Keith Briggs.)
166 * Fixed a memory leak in the modular integer exponentiation.
168 * Reduced the stack space consumption. The default stack size (typically
169 8 MB on Unix) should now be sufficient in order to run all CLN programs.
171 * Portability fixes for m68k platforms.
172 (Reported and fixed by Roman Hodek.)
177 * Restructured the sources. The subpackages
180 - base + integer + rational
181 - base + integer + rational + float
182 - base + integer + rational + float + real
183 - base + integer + rational + float + real + complex
184 - base + integer + modinteger
185 are now self-contained.
187 * The configuration script can be called with option `--enable-shared',
188 to build CLN as a shared library.
190 * Updated the LiDIA interface.
193 1998-05-07, version 0.98
194 ========================
196 Implementation changes
197 ----------------------
199 * Portability fixes for 64-bit platforms like DEC Alpha.
200 (Reported by John Cremona and Thomas Papanikolaou.)
209 * Portability fixes for new ISO/ANSI C++ compilers.
211 * Updated the LiDIA interface for LiDIA version 1.3 and fixed a couple of
218 Implementation changes
219 ----------------------
221 * Portability fix for i686 platforms.
222 (Reported by Michael Pfeifer.)
232 <cl_ring.h>, declaring general rings,
233 <cl_GV.h>, <cl_SV.h>, defining vectors,
234 <cl_univpoly.h>, defining univariate polynomial rings.
239 * Speed up the internal computation of ln(2) and ln(10) by about 20%.
241 * Speed up the computation of exp (for 1000 digits or more) by about 10%.
243 Implementation changes
244 ----------------------
246 * Portability fix for 64-bit platforms like DEC Alpha:
247 Fixed a bug: endless loop in `sqrt' for large precision.
248 (Reported by Blake Jones.)
250 * Portability fix for RS/6000 platforms.
259 * Speed up the computation of the elementary transcendental functions:
260 exp, sinh, cosh, asinh, atanh (for 100 digits) by about 30%,
261 log (for 100 digits) by about 25%,
262 sin, cos (for 1000 or 10000 digits) by about 20%,
263 asin, acos, atan (for 1000 digits) by about 25%.
265 Implementation changes
266 ----------------------
268 * Portability fix for SunOS 4 and other BSD platforms.
277 * Fixed a bug: endless recursion in `cl_boolean sqrtp (const cl_RA&, cl_RA*)'.
279 * Fixed a bug: Only the first 85% of the digits returned by `cl_eulerconst'
280 for moderate precision (< 11370 digits) were correct.
281 (Reported by Thomas Papanikolaou.)
283 Implementation changes
284 ----------------------
286 * Fix static initialization order bug. Requires g++ 2.7.0 or newer
287 (g++ 2.8.0 or newer on HPPA).
289 * New method `debug_print()', for pretty printing of CLN objects, intended
290 to be called from the debugger.
299 * New functions `float cl_float_approx (const cl_R&)',
300 `double cl_double_approx (const cl_R&)'
301 for converting a real number to a C `float' or `double'.
306 * Speed up `cl_zeta' using Cohen-Villegas-Zagier convergence acceleration.
308 Implementation changes
309 ----------------------
311 * New function `cl_print', for pretty printing of CLN objects, intended to be
312 called from the debugger.
314 * Portability fixes for 64-bit platforms like DEC Alpha.
324 <cl_string.h>, defining strings,
325 <cl_symbol.h>, defining symbols,
326 <cl_proplist.h>, defining property lists,
327 <cl_condition.h>, defining conditions/exceptions.
329 * New functions `cl_F cl_catalanconst ()',
330 `cl_F cl_catalanconst (const cl_F&)',
331 `cl_F cl_catalanconst (cl_float_format_t)'
332 which return Catalan's constant.
333 (Suggested by Thomas Papanikolaou.)
335 * New functions `cl_F cl_zeta (int s)',
336 `cl_F cl_zeta (int s, const cl_F&)',
337 `cl_F cl_zeta (int s, cl_float_format_t)'
338 which return the Riemann zeta function at an integral point s>1.
340 * New functions `cl_F cl_exp1 ()',
341 `cl_F cl_exp1 (const cl_F&)',
342 `cl_F cl_exp1 (cl_float_format_t)'
343 which return e = exp(1).
345 * New function `cl_I binomial (uintL n, uintL k)' which returns the
346 binomial coefficient (n choose k).
348 * New functions `int cl_I_to_int (const cl_I&)',
349 `unsigned int cl_I_to_uint (const cl_I&)',
350 `long cl_I_to_long (const cl_I&)',
351 `unsigned long cl_I_to_ulong (const cl_I&)'
352 for converting an integer to a C `int' or `long'.
354 * New functions `float cl_float_approx (const cl_I&)',
355 `float cl_float_approx (const cl_RA&)',
356 `double cl_double_approx (const cl_I&)',
357 `double cl_double_approx (const cl_RA&)'
358 for converting a rational number to a C `float' or `double'.
360 Implementation changes
361 ----------------------
363 * Moved the sources to subdirectories.
364 (Suggested by Jörg Arndt.)
369 * New benchmark for better comparing LiDIA, Pari and CLN.
371 * Added an interface to LiDIA, allows using CLN as a replacement of libI.
372 (Suggested by Thomas Papanikolaou.)
374 * Added an ILOG Talk interface, for interactive use of the library.
383 * New include file <cl_modinteger.h>, defining modular integer rings.
385 * New functions `cl_F cl_eulerconst ()', `cl_F cl_eulerconst (const cl_F&)',
386 `cl_F cl_eulerconst (cl_float_format_t)' which return Euler's constant.
391 * Speed up square root of large numbers by use of Newton's algorithm.
393 * Speed up multiplication and division of large long-floats by small integers.
395 * Speed up the computation of pi, e, exp, log, sin, cos, tan, sinh, cosh, tanh,
396 asin, acos, atan, asinh, acosh, atanh.
397 All of them are now computed with asymptotically fast algorithms, of
398 bit complexity O(log(N)^2*M(N)) = O(N^(1+epsilon)) for N digits.
400 * Fixed several bugs in the transcendental functions routines. In particular,
401 the `log' function went into an endless loop.
403 * Fixed a bug: The cl_I -> cl_DF and cl_I -> cl_LF conversions didn't work
404 correctly for negative integers.
413 * New include file <cl_numtheory.h>, containing number theoretic functions,
414 for now only the Jacobi symbol.
419 * Speed up squaring of large numbers by 30%.
421 * Speed up division of large numbers by use of Newton's algorithm. The
422 improvement is noticeable for numbers with at least about 1000 words =
423 32000 bits = 10000 decimal digits.
425 * Speed up the binary-to-decimal conversion of large numbers by use of
426 a divide-and-conquer method. The improvement is noticeable for numbers
427 of at least 1250 words = 40000 bits = 12000 decimal digits.
429 * Fixed a bug: The functions `cl_boolean minusp (const type&)' and
430 `cl_boolean zerop (const type&)' were missing for type=cl_I and type=cl_RA.
432 * Fixed a bug: The function `cl_boolean logtest (const cl_I&, const cl_I&)'
433 didn't work correctly if both arguments were bignums.
435 * Fixed a bug: The function `cl_I mod (const cl_I&, const cl_I&)', when called
436 as `mod(-n*m,m)' (n>0), returned m instead of 0.
438 * Fixed a bug: The function `uintL power2p (const cl_I&)' returned wrong
439 values for arguments x = 2^n, n >= 29.
441 Implementation changes
442 ----------------------
444 * Speed up CLN by using the low-level addition/subtraction, shift and
445 multiplication loops from GNU gmp-2.0.2.
447 * Fixed a severe reference counting bug in the constructors
448 `type::type (const long)' and `type::type (const unsigned long)'
449 for type=cl_number, type=cl_N, type=cl_RA, type=cl_I that most often
452 * CLN's word sequences can be chosen to be stored big-endian in memory
453 (like it was up to now) or little-endian (needed for interfacing to GMP).
462 * New include file <cl_timing.h>, contains timing facilities.
467 * Speed up the multiplication of large numbers by use of an FFT based
468 algorithm (Schönhage-Strassen). The improvement is noticeable when both
469 factors have at least 1250 words = 40000 bits = 12000 decimal digits.
471 * Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
472 `cl_I xgcd (const cl_I&, const cl_I&, cl_I*, cl_I*)' by a factor
473 of 1.5. Simple trick.
475 * Speed up the function `cl_boolean sqrtp (const cl_I&, cl_I*)' using a
476 trick from Henri Cohen.
478 * Fixed an endless loop in the function `uint32 gcd (uint32, uint32)'
479 which occurred when one of the arguments is zero.
481 * Fixed an endless loop in the function `cl_I factorial (uintL)'.
483 Implementation changes
484 ----------------------
486 * <cl_io.h> now uses iostreams by default instead of stdio FILE pointers.
487 (Reported by Tito Flagella.)
489 * Fixed linking error when compiling without -O.
490 (Reported by Tito Flagella.)
492 * Fixed syntax error in <cl_input.h>.
493 (Reported by Tito Flagella.)
495 * Fixed syntax errors in src/cl_DS.h and src/cl_FF_plus.h.
496 (Reported by Marcus Daniels.)
498 * More portability fixes.
500 * Configuration now supports the --srcdir option.
501 (Reported by Marcus Daniels.)
507 * Compiles well on Sparc, using gcc.
509 * Mail to beta testers.
515 * Compiles well on Linux, using gcc.