1 2000-11-xx, version 1.1.0
2 =========================
7 * ISO/IEC 14882 fashion adjustments:
8 Put everything into namespace cln. All funcamental 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 apologizes for the
16 Implementation changes
17 ----------------------
19 * Removed internal copy of mpn/-tree from libgmp-2.0.2. Configuring with
20 --with-gmp now predepends on an installed libgmp library version 3 or above.
22 * Adjusted several break-even points to make better use of a faster libgmp and
23 better match present-day CPUs.
25 * Fix several errors for architectures with 64-bit wide words.
28 * Fix compilation errors with current GCC3.0 snapshots.
31 2000-01-13, version 1.0.3
32 =========================
38 `cl_I doublefactorial (uintL n)'.
40 Implementation changes
41 ----------------------
43 * Fix several little configuration errors.
45 * Fix some compilation errors with gcc-2.96 prereleases.
48 1999-09-07, version 1.0.2
49 =========================
55 `cl_I numerator (const cl_RA&)'
56 `cl_I denominator (const cl_RA&)'.
57 Suggested by Richard Kreckel and Sylvain Pion.
59 * New function `cl_equal_hashcode' for the classes cl_N, cl_R, cl_RA, cl_I,
60 cl_F, cl_SF, cl_FF, cl_DF, cl_LF.
61 Suggested by Richard Kreckel.
63 Implementation changes
64 ----------------------
66 * Fix an endless loop when either of the functions
67 `cl_boolean rootp (const cl_RA&, uintL, cl_RA*)',
68 `cl_boolean rootp (const cl_RA&, const cl_I&, cl_RA*)'
69 was called with an integer argument. Thanks to Richard Kreckel.
71 * Fix a bug in the addition and subtraction of rational numbers which could
72 cause unnormalized rational numbers like 3/1 to be created.
75 1999-06-09, version 1.0.1
76 =========================
81 * Speed up the functions `logand', `lognand', `logandc2'.
83 Implementation changes
84 ----------------------
86 * Fix compilation errors with gcc-2.7.2, egcs-1.1.2 and gcc-2.95.
88 * Fix compilation errors on HPPA, MIPS, some versions of DEC Alpha, OpenBSD,
91 * Fix compilation errors on Win32. Thanks to Mumit Khan.
94 1999-01-12, version 1.0
95 =======================
100 * New include files, containing I/O functions:
104 <cl_sfloat_io.h> <cl_ffloat_io.h> <cl_dfloat_io.h> <cl_lfloat_io.h>
107 The file <cl_io.h> now contains only I/O functions for characters and
110 * To access the base ring of a univariate polynomial ring, now use
111 `R->basering()' instead of `R->basering'.
113 * Implement `plusp', `max', `min' for the classes cl_F, cl_SF, cl_FF, cl_DF,
116 * Implement `abs' for the class cl_RA.
118 * Replaced `read_number' with specialized functions `read_complex',
119 `read_real', `read_float', `read_rational', `read_integer'.
121 * Replaced the functions
122 `void fprint (cl_ostream stream, int x)'
123 `void fprint (cl_ostream stream, unsigned int x)'
124 `void fprint (cl_ostream stream, long x)'
125 `void fprint (cl_ostream stream, unsigned long x)'
127 `void fprintdecimal (cl_ostream stream, int x)'
128 `void fprintdecimal (cl_ostream stream, unsigned int x)'
129 `void fprintdecimal (cl_ostream stream, long x)'
130 `void fprintdecimal (cl_ostream stream, unsigned long x)'
135 * The function `cl_I xgcd (const cl_I& a, const cl_I& b, cl_I* u, cl_I* v)'
136 now normalizes the resulting u and v to be of minimum absolute value.
137 (Suggested by the LiDIA group.)
139 * The conversion from string to cl_F, cl_R, cl_N now chooses the format of
140 the resulting float depending on the number of significant digits present
143 * Speed up the functions
144 `cl_R operator* (const cl_RA&, const cl_LF&)'
145 `cl_R operator* (const cl_LF&, const cl_RA&)'
146 `cl_R operator/ (const cl_RA&, const cl_LF&)'
147 `cl_LF operator/ (const cl_LF&, const cl_RA&)'
149 Implementation changes
150 ----------------------
152 * Fix for `cl_I ash (const cl_I& x, const cl_I& n)' when |n| is between
154 (Reported by Thomas Papanikolaou.)
156 * Fixed a memory leak in the long-float truncate function.
157 (Reported by Keith Briggs.)
159 * Fixed a memory leak in the modular integer exponentiation.
161 * Reduced the stack space consumption. The default stack size (typically
162 8 MB on Unix) should now be sufficient in order to run all CLN programs.
164 * Portability fixes for m68k platforms.
165 (Reported and fixed by Roman Hodek.)
170 * Restructured the sources. The subpackages
173 - base + integer + rational
174 - base + integer + rational + float
175 - base + integer + rational + float + real
176 - base + integer + rational + float + real + complex
177 - base + integer + modinteger
178 are now self-contained.
180 * The configuration script can be called with option `--enable-shared',
181 to build CLN as a shared library.
183 * Updated the LiDIA interface.
186 1998-05-07, version 0.98
187 ========================
189 Implementation changes
190 ----------------------
192 * Portability fixes for 64-bit platforms like DEC Alpha.
193 (Reported by John Cremona and Thomas Papanikolaou.)
202 * Portability fixes for new ISO/ANSI C++ compilers.
204 * Updated the LiDIA interface for LiDIA version 1.3 and fixed a couple of
211 Implementation changes
212 ----------------------
214 * Portability fix for i686 platforms.
215 (Reported by Michael Pfeifer.)
225 <cl_ring.h>, declaring general rings,
226 <cl_GV.h>, <cl_SV.h>, defining vectors,
227 <cl_univpoly.h>, defining univariate polynomial rings.
232 * Speed up the internal computation of ln(2) and ln(10) by about 20%.
234 * Speed up the computation of exp (for 1000 digits or more) by about 10%.
236 Implementation changes
237 ----------------------
239 * Portability fix for 64-bit platforms like DEC Alpha:
240 Fixed a bug: endless loop in `sqrt' for large precision.
241 (Reported by Blake Jones.)
243 * Portability fix for RS/6000 platforms.
252 * Speed up the computation of the elementary transcendental functions:
253 exp, sinh, cosh, asinh, atanh (for 100 digits) by about 30%,
254 log (for 100 digits) by about 25%,
255 sin, cos (for 1000 or 10000 digits) by about 20%,
256 asin, acos, atan (for 1000 digits) by about 25%.
258 Implementation changes
259 ----------------------
261 * Portability fix for SunOS 4 and other BSD platforms.
270 * Fixed a bug: endless recursion in `cl_boolean sqrtp (const cl_RA&, cl_RA*)'.
272 * Fixed a bug: Only the first 85% of the digits returned by `cl_eulerconst'
273 for moderate precision (< 11370 digits) were correct.
274 (Reported by Thomas Papanikolaou.)
276 Implementation changes
277 ----------------------
279 * Fix static initialization order bug. Requires g++ 2.7.0 or newer
280 (g++ 2.8.0 or newer on HPPA).
282 * New method `debug_print()', for pretty printing of CLN objects, intended
283 to be called from the debugger.
292 * New functions `float cl_float_approx (const cl_R&)',
293 `double cl_double_approx (const cl_R&)'
294 for converting a real number to a C `float' or `double'.
299 * Speed up `cl_zeta' using Cohen-Villegas-Zagier convergence acceleration.
301 Implementation changes
302 ----------------------
304 * New function `cl_print', for pretty printing of CLN objects, intended to be
305 called from the debugger.
307 * Portability fixes for 64-bit platforms like DEC Alpha.
317 <cl_string.h>, defining strings,
318 <cl_symbol.h>, defining symbols,
319 <cl_proplist.h>, defining property lists,
320 <cl_condition.h>, defining conditions/exceptions.
322 * New functions `cl_F cl_catalanconst ()',
323 `cl_F cl_catalanconst (const cl_F&)',
324 `cl_F cl_catalanconst (cl_float_format_t)'
325 which return Catalan's constant.
326 (Suggested by Thomas Papanikolaou.)
328 * New functions `cl_F cl_zeta (int s)',
329 `cl_F cl_zeta (int s, const cl_F&)',
330 `cl_F cl_zeta (int s, cl_float_format_t)'
331 which return the Riemann zeta function at an integral point s>1.
333 * New functions `cl_F cl_exp1 ()',
334 `cl_F cl_exp1 (const cl_F&)',
335 `cl_F cl_exp1 (cl_float_format_t)'
336 which return e = exp(1).
338 * New function `cl_I binomial (uintL n, uintL k)' which returns the
339 binomial coefficient (n choose k).
341 * New functions `int cl_I_to_int (const cl_I&)',
342 `unsigned int cl_I_to_uint (const cl_I&)',
343 `long cl_I_to_long (const cl_I&)',
344 `unsigned long cl_I_to_ulong (const cl_I&)'
345 for converting an integer to a C `int' or `long'.
347 * New functions `float cl_float_approx (const cl_I&)',
348 `float cl_float_approx (const cl_RA&)',
349 `double cl_double_approx (const cl_I&)',
350 `double cl_double_approx (const cl_RA&)'
351 for converting a rational number to a C `float' or `double'.
353 Implementation changes
354 ----------------------
356 * Moved the sources to subdirectories.
357 (Suggested by Jörg Arndt.)
362 * New benchmark for better comparing LiDIA, Pari and CLN.
364 * Added an interface to LiDIA, allows using CLN as a replacement of libI.
365 (Suggested by Thomas Papanikolaou.)
367 * Added an ILOG Talk interface, for interactive use of the library.
376 * New include file <cl_modinteger.h>, defining modular integer rings.
378 * New functions `cl_F cl_eulerconst ()', `cl_F cl_eulerconst (const cl_F&)',
379 `cl_F cl_eulerconst (cl_float_format_t)' which return Euler's constant.
384 * Speed up square root of large numbers by use of Newton's algorithm.
386 * Speed up multiplication and division of large long-floats by small integers.
388 * Speed up the computation of pi, e, exp, log, sin, cos, tan, sinh, cosh, tanh,
389 asin, acos, atan, asinh, acosh, atanh.
390 All of them are now computed with asymptotically fast algorithms, of
391 bit complexity O(log(N)^2*M(N)) = O(N^(1+epsilon)) for N digits.
393 * Fixed several bugs in the transcendental functions routines. In particular,
394 the `log' function went into an endless loop.
396 * Fixed a bug: The cl_I -> cl_DF and cl_I -> cl_LF conversions didn't work
397 correctly for negative integers.
406 * New include file <cl_numtheory.h>, containing number theoretic functions,
407 for now only the Jacobi symbol.
412 * Speed up squaring of large numbers by 30%.
414 * Speed up division of large numbers by use of Newton's algorithm. The
415 improvement is noticeable for numbers with at least about 1000 words =
416 32000 bits = 10000 decimal digits.
418 * Speed up the binary-to-decimal conversion of large numbers by use of
419 a divide-and-conquer method. The improvement is noticeable for numbers
420 of at least 1250 words = 40000 bits = 12000 decimal digits.
422 * Fixed a bug: The functions `cl_boolean minusp (const type&)' and
423 `cl_boolean zerop (const type&)' were missing for type=cl_I and type=cl_RA.
425 * Fixed a bug: The function `cl_boolean logtest (const cl_I&, const cl_I&)'
426 didn't work correctly if both arguments were bignums.
428 * Fixed a bug: The function `cl_I mod (const cl_I&, const cl_I&)', when called
429 as `mod(-n*m,m)' (n>0), returned m instead of 0.
431 * Fixed a bug: The function `uintL power2p (const cl_I&)' returned wrong
432 values for arguments x = 2^n, n >= 29.
434 Implementation changes
435 ----------------------
437 * Speed up CLN by using the low-level addition/subtraction, shift and
438 multiplication loops from GNU gmp-2.0.2.
440 * Fixed a severe reference counting bug in the constructors
441 `type::type (const long)' and `type::type (const unsigned long)'
442 for type=cl_number, type=cl_N, type=cl_RA, type=cl_I that most often
445 * CLN's word sequences can be chosen to be stored big-endian in memory
446 (like it was up to now) or little-endian (needed for interfacing to GMP).
455 * New include file <cl_timing.h>, contains timing facilities.
460 * Speed up the multiplication of large numbers by use of an FFT based
461 algorithm (Schönhage-Strassen). The improvement is noticeable when both
462 factors have at least 1250 words = 40000 bits = 12000 decimal digits.
464 * Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
465 `cl_I xgcd (const cl_I&, const cl_I&, cl_I*, cl_I*)' by a factor
466 of 1.5. Simple trick.
468 * Speed up the function `cl_boolean sqrtp (const cl_I&, cl_I*)' using a
469 trick from Henri Cohen.
471 * Fixed an endless loop in the function `uint32 gcd (uint32, uint32)'
472 which occurred when one of the arguments is zero.
474 * Fixed an endless loop in the function `cl_I factorial (uintL)'.
476 Implementation changes
477 ----------------------
479 * <cl_io.h> now uses iostreams by default instead of stdio FILE pointers.
480 (Reported by Tito Flagella.)
482 * Fixed linking error when compiling without -O.
483 (Reported by Tito Flagella.)
485 * Fixed syntax error in <cl_input.h>.
486 (Reported by Tito Flagella.)
488 * Fixed syntax errors in src/cl_DS.h and src/cl_FF_plus.h.
489 (Reported by Marcus Daniels.)
491 * More portability fixes.
493 * Configuration now supports the --srcdir option.
494 (Reported by Marcus Daniels.)
500 * Compiles well on Sparc, using gcc.
502 * Mail to beta testers.
508 * Compiles well on Linux, using gcc.