1 2005-10-22, version 1.1.10
2 ==========================
7 * Removed the vptr of modular integer and univariate polynomial
8 classes in order to fix some crashes in that sector of CLN. Code
9 using this needs to be recompiled.
11 * Many more operator signatures make the integration of CLN types with
17 * Several compilation fixes.
19 * Made it possible to cross-compile CLN.
22 2004-11-03, version 1.1.9
23 =========================
28 * Input of numbers in bases 2, 4, 8, 16 and 32 is now done in linear bit
29 complexity as opposed to O(N^2). Useful for all kinds of persistency.
31 Implementation changes
32 ----------------------
34 * Fixed several bugs in the integer input and output routines that could be
35 blamed for random crashes in the following cases: output in base 32 for
36 quite large numbers, input in base 2 for fixnums and input in base 3 for
37 fixnums on a 64 bit target.
39 * Fixed crash when radix specifiers were used in input streams.
41 * Speed up on x86_64 and ia64 by adding some inline assembly.
46 * Fixes for compilation on MacOS X and little endian Mips.
49 2004-07-01, version 1.1.8
50 =========================
52 Implementation changes
53 ----------------------
55 * Fix bug in log(a,b) when b is 1/n.
57 * Fix crash in shared library on AMD64.
62 * Fixes for some language conformance issues.
65 2004-05-02, version 1.1.7
66 =========================
68 Implementation changes
69 ----------------------
71 * Fixed two corner case bugs in cl_LF multiplication and sqrt.
73 * Workaround GCC 3.[123] compiler bug.
75 * Parallel build should work reliably now.
78 2004-01-01, version 1.1.6
79 =========================
85 `sintL ldegree(const cl_UP& x)'.
86 (Suggested by Munagala Ramanath.)
88 Implementation changes
89 ----------------------
91 * Fixed a bug in polynomial subtraction.
92 (Reported by Munagala Ramanath.)
97 * Provide a package control file cln.pc.
99 * Updated infrastructure to autoconf-2.57.
101 * Fixed compilation issues with GCC-3.4 prereleases and on Mac OSX.
104 2002-05-28, version 1.1.5
105 =========================
110 * Fix compilation issues with GCC-3.1.
113 2002-01-04, version 1.1.4
114 =========================
119 * Fix compilation issues with GMP-4.0 and on IBM s390.
121 * Updated infrastructure to autoconf-2.52.
124 2001-11-05, version 1.1.3
125 =========================
127 Implementation changes
128 ----------------------
130 * Fix a computation error of sin and sinh for small arguments.
131 (Reported by Christopher Kennedy.)
133 * Module ordering works with gcc-3.0 -fuse-cxa-atexit now.
135 * -DNO_ASM works properly on Sparc.
138 2001-07-25, version 1.1.2
140 Implementation changes
141 ----------------------
143 * Minor cleanups and portability issues.
144 (No need to upgrade if you have been happy so far.)
147 2001-05-31, version 1.1.1
148 =========================
150 Implementation changes
151 ----------------------
153 * Minor cleanups for GCC 3.0 and libstdc++-v3.
155 * Fixes several little bugs and portability issues.
158 2000-12-14, version 1.1.0
159 =========================
164 * ISO/IEC 14882 fashion adjustments:
165 Put everything into namespace cln. All fundamental data types still
166 carry their old names. Other non-macro identifiers are now written as
167 cln::foo instead of cl_foo, except where the cl_ comes from a data type
168 (as in cl_I_to_int()). Headers are installed into a separate
169 directory, #include <cln/foo.h> instead of <cl_foo.h>. Applications
170 must be manually ported to the new style. We apologize for the
173 Implementation changes
174 ----------------------
176 * Removed internal copy of mpn subdirectory tree from libgmp-2.0.2.
177 Configuring with --with-gmp now relies on an installed libgmp library
178 version 3 or above. We recommend libgmp-3.1 or newer.
180 * Adjusted several break-even points to make better use of a faster libgmp and
181 better match present-day CPUs.
183 * Fix several errors for architectures with 64-bit wide words.
184 (Others than Alpha, which worked already.)
186 * Fix compilation errors with current GCC-3.0 snapshots.
191 * Added package tools: script cln-config and autoconf macro AC_PATH_CLN
195 2000-01-13, version 1.0.3
196 =========================
202 `cl_I doublefactorial (uintL n)'.
204 Implementation changes
205 ----------------------
207 * Fix several little configuration errors.
209 * Fix some compilation errors with gcc-2.96 prereleases.
212 1999-09-07, version 1.0.2
213 =========================
219 `cl_I numerator (const cl_RA&)'
220 `cl_I denominator (const cl_RA&)'.
221 Suggested by Richard Kreckel and Sylvain Pion.
223 * New function `cl_equal_hashcode' for the classes cl_N, cl_R, cl_RA, cl_I,
224 cl_F, cl_SF, cl_FF, cl_DF, cl_LF.
225 Suggested by Richard Kreckel.
227 Implementation changes
228 ----------------------
230 * Fix an endless loop when either of the functions
231 `cl_boolean rootp (const cl_RA&, uintL, cl_RA*)',
232 `cl_boolean rootp (const cl_RA&, const cl_I&, cl_RA*)'
233 was called with an integer argument. Thanks to Richard Kreckel.
235 * Fix a bug in the addition and subtraction of rational numbers which could
236 cause unnormalized rational numbers like 3/1 to be created.
239 1999-06-09, version 1.0.1
240 =========================
245 * Speed up the functions `logand', `lognand', `logandc2'.
247 Implementation changes
248 ----------------------
250 * Fix compilation errors with gcc-2.7.2, egcs-1.1.2 and gcc-2.95.
252 * Fix compilation errors on HPPA, MIPS, some versions of DEC Alpha, OpenBSD,
253 and SPARC with LiDIA.
255 * Fix compilation errors on Win32. Thanks to Mumit Khan.
258 1999-01-12, version 1.0
259 =======================
264 * New include files, containing I/O functions:
268 <cl_sfloat_io.h> <cl_ffloat_io.h> <cl_dfloat_io.h> <cl_lfloat_io.h>
271 The file <cl_io.h> now contains only I/O functions for characters and
274 * To access the base ring of a univariate polynomial ring, now use
275 `R->basering()' instead of `R->basering'.
277 * Implement `plusp', `max', `min' for the classes cl_F, cl_SF, cl_FF, cl_DF,
280 * Implement `abs' for the class cl_RA.
282 * Replaced `read_number' with specialized functions `read_complex',
283 `read_real', `read_float', `read_rational', `read_integer'.
285 * Replaced the functions
286 `void fprint (cl_ostream stream, int x)'
287 `void fprint (cl_ostream stream, unsigned int x)'
288 `void fprint (cl_ostream stream, long x)'
289 `void fprint (cl_ostream stream, unsigned long x)'
291 `void fprintdecimal (cl_ostream stream, int x)'
292 `void fprintdecimal (cl_ostream stream, unsigned int x)'
293 `void fprintdecimal (cl_ostream stream, long x)'
294 `void fprintdecimal (cl_ostream stream, unsigned long x)'
299 * The function `cl_I xgcd (const cl_I& a, const cl_I& b, cl_I* u, cl_I* v)'
300 now normalizes the resulting u and v to be of minimum absolute value.
301 (Suggested by the LiDIA group.)
303 * The conversion from string to cl_F, cl_R, cl_N now chooses the format of
304 the resulting float depending on the number of significant digits present
307 * Speed up the functions
308 `cl_R operator* (const cl_RA&, const cl_LF&)'
309 `cl_R operator* (const cl_LF&, const cl_RA&)'
310 `cl_R operator/ (const cl_RA&, const cl_LF&)'
311 `cl_LF operator/ (const cl_LF&, const cl_RA&)'
313 Implementation changes
314 ----------------------
316 * Fix for `cl_I ash (const cl_I& x, const cl_I& n)' when |n| is between
318 (Reported by Thomas Papanikolaou.)
320 * Fixed a memory leak in the long-float truncate function.
321 (Reported by Keith Briggs.)
323 * Fixed a memory leak in the modular integer exponentiation.
325 * Reduced the stack space consumption. The default stack size (typically
326 8 MB on Unix) should now be sufficient in order to run all CLN programs.
328 * Portability fixes for m68k platforms.
329 (Reported and fixed by Roman Hodek.)
334 * Restructured the sources. The subpackages
337 - base + integer + rational
338 - base + integer + rational + float
339 - base + integer + rational + float + real
340 - base + integer + rational + float + real + complex
341 - base + integer + modinteger
342 are now self-contained.
344 * The configuration script can be called with option `--enable-shared',
345 to build CLN as a shared library.
347 * Updated the LiDIA interface.
350 1998-05-07, version 0.98
351 ========================
353 Implementation changes
354 ----------------------
356 * Portability fixes for 64-bit platforms like DEC Alpha.
357 (Reported by John Cremona and Thomas Papanikolaou.)
366 * Portability fixes for new ISO/ANSI C++ compilers.
368 * Updated the LiDIA interface for LiDIA version 1.3 and fixed a couple of
375 Implementation changes
376 ----------------------
378 * Portability fix for i686 platforms.
379 (Reported by Michael Pfeifer.)
389 <cl_ring.h>, declaring general rings,
390 <cl_GV.h>, <cl_SV.h>, defining vectors,
391 <cl_univpoly.h>, defining univariate polynomial rings.
396 * Speed up the internal computation of ln(2) and ln(10) by about 20%.
398 * Speed up the computation of exp (for 1000 digits or more) by about 10%.
400 Implementation changes
401 ----------------------
403 * Portability fix for 64-bit platforms like DEC Alpha:
404 Fixed a bug: endless loop in `sqrt' for large precision.
405 (Reported by Blake Jones.)
407 * Portability fix for RS/6000 platforms.
416 * Speed up the computation of the elementary transcendental functions:
417 exp, sinh, cosh, asinh, atanh (for 100 digits) by about 30%,
418 log (for 100 digits) by about 25%,
419 sin, cos (for 1000 or 10000 digits) by about 20%,
420 asin, acos, atan (for 1000 digits) by about 25%.
422 Implementation changes
423 ----------------------
425 * Portability fix for SunOS 4 and other BSD platforms.
434 * Fixed a bug: endless recursion in `cl_boolean sqrtp (const cl_RA&, cl_RA*)'.
436 * Fixed a bug: Only the first 85% of the digits returned by `cl_eulerconst'
437 for moderate precision (< 11370 digits) were correct.
438 (Reported by Thomas Papanikolaou.)
440 Implementation changes
441 ----------------------
443 * Fix static initialization order bug. Requires g++ 2.7.0 or newer
444 (g++ 2.8.0 or newer on HPPA).
446 * New method `debug_print()', for pretty printing of CLN objects, intended
447 to be called from the debugger.
456 * New functions `float cl_float_approx (const cl_R&)',
457 `double cl_double_approx (const cl_R&)'
458 for converting a real number to a C `float' or `double'.
463 * Speed up `cl_zeta' using Cohen-Villegas-Zagier convergence acceleration.
465 Implementation changes
466 ----------------------
468 * New function `cl_print', for pretty printing of CLN objects, intended to be
469 called from the debugger.
471 * Portability fixes for 64-bit platforms like DEC Alpha.
481 <cl_string.h>, defining strings,
482 <cl_symbol.h>, defining symbols,
483 <cl_proplist.h>, defining property lists,
484 <cl_condition.h>, defining conditions/exceptions.
486 * New functions `cl_F cl_catalanconst ()',
487 `cl_F cl_catalanconst (const cl_F&)',
488 `cl_F cl_catalanconst (cl_float_format_t)'
489 which return Catalan's constant.
490 (Suggested by Thomas Papanikolaou.)
492 * New functions `cl_F cl_zeta (int s)',
493 `cl_F cl_zeta (int s, const cl_F&)',
494 `cl_F cl_zeta (int s, cl_float_format_t)'
495 which return the Riemann zeta function at an integral point s>1.
497 * New functions `cl_F cl_exp1 ()',
498 `cl_F cl_exp1 (const cl_F&)',
499 `cl_F cl_exp1 (cl_float_format_t)'
500 which return e = exp(1).
502 * New function `cl_I binomial (uintL n, uintL k)' which returns the
503 binomial coefficient (n choose k).
505 * New functions `int cl_I_to_int (const cl_I&)',
506 `unsigned int cl_I_to_uint (const cl_I&)',
507 `long cl_I_to_long (const cl_I&)',
508 `unsigned long cl_I_to_ulong (const cl_I&)'
509 for converting an integer to a C `int' or `long'.
511 * New functions `float cl_float_approx (const cl_I&)',
512 `float cl_float_approx (const cl_RA&)',
513 `double cl_double_approx (const cl_I&)',
514 `double cl_double_approx (const cl_RA&)'
515 for converting a rational number to a C `float' or `double'.
517 Implementation changes
518 ----------------------
520 * Moved the sources to subdirectories.
521 (Suggested by Jörg Arndt.)
526 * New benchmark for better comparing LiDIA, Pari and CLN.
528 * Added an interface to LiDIA, allows using CLN as a replacement of libI.
529 (Suggested by Thomas Papanikolaou.)
531 * Added an ILOG Talk interface, for interactive use of the library.
540 * New include file <cl_modinteger.h>, defining modular integer rings.
542 * New functions `cl_F cl_eulerconst ()', `cl_F cl_eulerconst (const cl_F&)',
543 `cl_F cl_eulerconst (cl_float_format_t)' which return Euler's constant.
548 * Speed up square root of large numbers by use of Newton's algorithm.
550 * Speed up multiplication and division of large long-floats by small integers.
552 * Speed up the computation of pi, e, exp, log, sin, cos, tan, sinh, cosh, tanh,
553 asin, acos, atan, asinh, acosh, atanh.
554 All of them are now computed with asymptotically fast algorithms, of
555 bit complexity O(log(N)^2*M(N)) = O(N^(1+epsilon)) for N digits.
557 * Fixed several bugs in the transcendental functions routines. In particular,
558 the `log' function went into an endless loop.
560 * Fixed a bug: The cl_I -> cl_DF and cl_I -> cl_LF conversions didn't work
561 correctly for negative integers.
570 * New include file <cl_numtheory.h>, containing number theoretic functions,
571 for now only the Jacobi symbol.
576 * Speed up squaring of large numbers by 30%.
578 * Speed up division of large numbers by use of Newton's algorithm. The
579 improvement is noticeable for numbers with at least about 1000 words =
580 32000 bits = 10000 decimal digits.
582 * Speed up the binary-to-decimal conversion of large numbers by use of
583 a divide-and-conquer method. The improvement is noticeable for numbers
584 of at least 1250 words = 40000 bits = 12000 decimal digits.
586 * Fixed a bug: The functions `cl_boolean minusp (const type&)' and
587 `cl_boolean zerop (const type&)' were missing for type=cl_I and type=cl_RA.
589 * Fixed a bug: The function `cl_boolean logtest (const cl_I&, const cl_I&)'
590 didn't work correctly if both arguments were bignums.
592 * Fixed a bug: The function `cl_I mod (const cl_I&, const cl_I&)', when called
593 as `mod(-n*m,m)' (n>0), returned m instead of 0.
595 * Fixed a bug: The function `uintL power2p (const cl_I&)' returned wrong
596 values for arguments x = 2^n, n >= 29.
598 Implementation changes
599 ----------------------
601 * Speed up CLN by using the low-level addition/subtraction, shift and
602 multiplication loops from GNU gmp-2.0.2.
604 * Fixed a severe reference counting bug in the constructors
605 `type::type (const long)' and `type::type (const unsigned long)'
606 for type=cl_number, type=cl_N, type=cl_RA, type=cl_I that most often
609 * CLN's word sequences can be chosen to be stored big-endian in memory
610 (like it was up to now) or little-endian (needed for interfacing to GMP).
619 * New include file <cl_timing.h>, contains timing facilities.
624 * Speed up the multiplication of large numbers by use of an FFT based
625 algorithm (Schönhage-Strassen). The improvement is noticeable when both
626 factors have at least 1250 words = 40000 bits = 12000 decimal digits.
628 * Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
629 `cl_I xgcd (const cl_I&, const cl_I&, cl_I*, cl_I*)' by a factor
630 of 1.5. Simple trick.
632 * Speed up the function `cl_boolean sqrtp (const cl_I&, cl_I*)' using a
633 trick from Henri Cohen.
635 * Fixed an endless loop in the function `uint32 gcd (uint32, uint32)'
636 which occurred when one of the arguments is zero.
638 * Fixed an endless loop in the function `cl_I factorial (uintL)'.
640 Implementation changes
641 ----------------------
643 * <cl_io.h> now uses iostreams by default instead of stdio FILE pointers.
644 (Reported by Tito Flagella.)
646 * Fixed linking error when compiling without -O.
647 (Reported by Tito Flagella.)
649 * Fixed syntax error in <cl_input.h>.
650 (Reported by Tito Flagella.)
652 * Fixed syntax errors in src/cl_DS.h and src/cl_FF_plus.h.
653 (Reported by Marcus Daniels.)
655 * More portability fixes.
657 * Configuration now supports the --srcdir option.
658 (Reported by Marcus Daniels.)
664 * Compiles well on Sparc, using gcc.
666 * Mail to beta testers.
672 * Compiles well on Linux, using gcc.