1 2008-03-24, version 1.2.1
2 =========================
7 * Fixed some bugs in the output of numbers larger than 2^32 decimal digits.
12 * Modifying C/C++ operators like +=, ++, etc. are now enabled by default.
15 2008-01-19, version 1.2.0
16 =========================
21 * Save big amounts of memory in computation of some functions and constants by:
22 - Avoiding pre-computation of series terms and instead computing them in a
24 - Avoiding computation with excess precision in binary splitting algorithm
25 by coercion of intermediate integer values to floating-point as early as
28 Implementation changes
29 ----------------------
31 * Added support for huge numbers:
32 - intC used for all counter loops.
33 - intE is now a 64-bit type on all 64-bit platforms and even on selected
36 * CLN now uses C++ exceptions for error handling. The cl_abort() hook is not
37 supported any more. Please refer to the documentation to learn about existing
40 * Fixed a bug on i386 where comparing Z/2Z ring zeros returnd random results.
42 * Removed cl_boolean. Use built-in C++ bool instead.
47 * Dropped the cln-config script. Please use pkg-config instead.
49 * Updated infrastructure to that of libtool-1.5.24.
51 * Changed encoding of all files to UTF-8.
53 * Fix compilation issues with GCC-4.3.
55 * Fix linking issues on platforms that don't feature weak symbols (like win32).
58 2006-08-08, version 1.1.13
59 ==========================
61 * Compilation fixes for 64-bit brokenness introduced in last release.
64 2006-08-06, version 1.1.12
65 ==========================
67 Implementation changes
68 ----------------------
70 * Fix rare assertion when printing quite large floats.
75 * Compilation fixes for several platforms: *BSD, Intel Mac, and MinGW.
78 2005-11-23, version 1.1.11
79 ==========================
84 * Considerably improved performance of number input.
87 2005-10-22, version 1.1.10
88 ==========================
90 Implementation changes
91 ----------------------
93 * Removed the vptr of modular integer and univariate polynomial
94 classes in order to fix some crashes in that sector of CLN. Code
95 using this needs to be recompiled.
97 * Many more operator signatures make the integration of CLN types with
103 * Several compilation fixes.
105 * Made it possible to cross-compile CLN.
108 2004-11-03, version 1.1.9
109 =========================
114 * Input of numbers in bases 2, 4, 8, 16 and 32 is now done in linear bit
115 complexity as opposed to O(N^2). Useful for all kinds of persistency.
117 Implementation changes
118 ----------------------
120 * Fixed several bugs in the integer input and output routines that could be
121 blamed for random crashes in the following cases: output in base 32 for
122 quite large numbers, input in base 2 for fixnums and input in base 3 for
123 fixnums on a 64 bit target.
125 * Fixed crash when radix specifiers were used in input streams.
127 * Speed up on x86_64 and ia64 by adding some inline assembly.
132 * Fixes for compilation on MacOS X and little endian Mips.
135 2004-07-01, version 1.1.8
136 =========================
138 Implementation changes
139 ----------------------
141 * Fix bug in log(a,b) when b is 1/n.
143 * Fix crash in shared library on AMD64.
148 * Fixes for some language conformance issues.
151 2004-05-02, version 1.1.7
152 =========================
154 Implementation changes
155 ----------------------
157 * Fixed two corner case bugs in cl_LF multiplication and sqrt.
159 * Workaround GCC 3.[123] compiler bug.
161 * Parallel build should work reliably now.
164 2004-01-01, version 1.1.6
165 =========================
171 `sintL ldegree(const cl_UP& x)'.
172 (Suggested by Munagala Ramanath.)
174 Implementation changes
175 ----------------------
177 * Fixed a bug in polynomial subtraction.
178 (Reported by Munagala Ramanath.)
183 * Provide a package control file cln.pc.
185 * Updated infrastructure to autoconf-2.57.
187 * Fixed compilation issues with GCC-3.4 prereleases and on Mac OSX.
190 2002-05-28, version 1.1.5
191 =========================
196 * Fix compilation issues with GCC-3.1.
199 2002-01-04, version 1.1.4
200 =========================
205 * Fix compilation issues with GMP-4.0 and on IBM s390.
207 * Updated infrastructure to autoconf-2.52.
210 2001-11-05, version 1.1.3
211 =========================
213 Implementation changes
214 ----------------------
216 * Fix a computation error of sin and sinh for small arguments.
217 (Reported by Christopher Kennedy.)
219 * Module ordering works with gcc-3.0 -fuse-cxa-atexit now.
221 * -DNO_ASM works properly on Sparc.
224 2001-07-25, version 1.1.2
226 Implementation changes
227 ----------------------
229 * Minor cleanups and portability issues.
230 (No need to upgrade if you have been happy so far.)
233 2001-05-31, version 1.1.1
234 =========================
236 Implementation changes
237 ----------------------
239 * Minor cleanups for GCC 3.0 and libstdc++-v3.
241 * Fixes several little bugs and portability issues.
244 2000-12-14, version 1.1.0
245 =========================
250 * ISO/IEC 14882 fashion adjustments:
251 Put everything into namespace cln. All fundamental data types still
252 carry their old names. Other non-macro identifiers are now written as
253 cln::foo instead of cl_foo, except where the cl_ comes from a data type
254 (as in cl_I_to_int()). Headers are installed into a separate
255 directory, #include <cln/foo.h> instead of <cl_foo.h>. Applications
256 must be manually ported to the new style. We apologize for the
259 Implementation changes
260 ----------------------
262 * Removed internal copy of mpn subdirectory tree from libgmp-2.0.2.
263 Configuring with --with-gmp now relies on an installed libgmp library
264 version 3 or above. We recommend libgmp-3.1 or newer.
266 * Adjusted several break-even points to make better use of a faster libgmp and
267 better match present-day CPUs.
269 * Fix several errors for architectures with 64-bit wide words.
270 (Others than Alpha, which worked already.)
272 * Fix compilation errors with current GCC-3.0 snapshots.
277 * Added package tools: script cln-config and autoconf macro AC_PATH_CLN
281 2000-01-13, version 1.0.3
282 =========================
288 `cl_I doublefactorial (uintL n)'.
290 Implementation changes
291 ----------------------
293 * Fix several little configuration errors.
295 * Fix some compilation errors with gcc-2.96 prereleases.
298 1999-09-07, version 1.0.2
299 =========================
305 `cl_I numerator (const cl_RA&)'
306 `cl_I denominator (const cl_RA&)'.
307 Suggested by Richard Kreckel and Sylvain Pion.
309 * New function `cl_equal_hashcode' for the classes cl_N, cl_R, cl_RA, cl_I,
310 cl_F, cl_SF, cl_FF, cl_DF, cl_LF.
311 Suggested by Richard Kreckel.
313 Implementation changes
314 ----------------------
316 * Fix an endless loop when either of the functions
317 `cl_boolean rootp (const cl_RA&, uintL, cl_RA*)',
318 `cl_boolean rootp (const cl_RA&, const cl_I&, cl_RA*)'
319 was called with an integer argument. Thanks to Richard Kreckel.
321 * Fix a bug in the addition and subtraction of rational numbers which could
322 cause unnormalized rational numbers like 3/1 to be created.
325 1999-06-09, version 1.0.1
326 =========================
331 * Speed up the functions `logand', `lognand', `logandc2'.
333 Implementation changes
334 ----------------------
336 * Fix compilation errors with gcc-2.7.2, egcs-1.1.2 and gcc-2.95.
338 * Fix compilation errors on HPPA, MIPS, some versions of DEC Alpha, OpenBSD,
339 and SPARC with LiDIA.
341 * Fix compilation errors on Win32. Thanks to Mumit Khan.
344 1999-01-12, version 1.0
345 =======================
350 * New include files, containing I/O functions:
354 <cl_sfloat_io.h> <cl_ffloat_io.h> <cl_dfloat_io.h> <cl_lfloat_io.h>
357 The file <cl_io.h> now contains only I/O functions for characters and
360 * To access the base ring of a univariate polynomial ring, now use
361 `R->basering()' instead of `R->basering'.
363 * Implement `plusp', `max', `min' for the classes cl_F, cl_SF, cl_FF, cl_DF,
366 * Implement `abs' for the class cl_RA.
368 * Replaced `read_number' with specialized functions `read_complex',
369 `read_real', `read_float', `read_rational', `read_integer'.
371 * Replaced the functions
372 `void fprint (cl_ostream stream, int x)'
373 `void fprint (cl_ostream stream, unsigned int x)'
374 `void fprint (cl_ostream stream, long x)'
375 `void fprint (cl_ostream stream, unsigned long x)'
377 `void fprintdecimal (cl_ostream stream, int x)'
378 `void fprintdecimal (cl_ostream stream, unsigned int x)'
379 `void fprintdecimal (cl_ostream stream, long x)'
380 `void fprintdecimal (cl_ostream stream, unsigned long x)'
385 * The function `cl_I xgcd (const cl_I& a, const cl_I& b, cl_I* u, cl_I* v)'
386 now normalizes the resulting u and v to be of minimum absolute value.
387 (Suggested by the LiDIA group.)
389 * The conversion from string to cl_F, cl_R, cl_N now chooses the format of
390 the resulting float depending on the number of significant digits present
393 * Speed up the functions
394 `cl_R operator* (const cl_RA&, const cl_LF&)'
395 `cl_R operator* (const cl_LF&, const cl_RA&)'
396 `cl_R operator/ (const cl_RA&, const cl_LF&)'
397 `cl_LF operator/ (const cl_LF&, const cl_RA&)'
399 Implementation changes
400 ----------------------
402 * Fix for `cl_I ash (const cl_I& x, const cl_I& n)' when |n| is between
404 (Reported by Thomas Papanikolaou.)
406 * Fixed a memory leak in the long-float truncate function.
407 (Reported by Keith Briggs.)
409 * Fixed a memory leak in the modular integer exponentiation.
411 * Reduced the stack space consumption. The default stack size (typically
412 8 MB on Unix) should now be sufficient in order to run all CLN programs.
414 * Portability fixes for m68k platforms.
415 (Reported and fixed by Roman Hodek.)
420 * Restructured the sources. The subpackages
423 - base + integer + rational
424 - base + integer + rational + float
425 - base + integer + rational + float + real
426 - base + integer + rational + float + real + complex
427 - base + integer + modinteger
428 are now self-contained.
430 * The configuration script can be called with option `--enable-shared',
431 to build CLN as a shared library.
433 * Updated the LiDIA interface.
436 1998-05-07, version 0.98
437 ========================
439 Implementation changes
440 ----------------------
442 * Portability fixes for 64-bit platforms like DEC Alpha.
443 (Reported by John Cremona and Thomas Papanikolaou.)
452 * Portability fixes for new ISO/ANSI C++ compilers.
454 * Updated the LiDIA interface for LiDIA version 1.3 and fixed a couple of
461 Implementation changes
462 ----------------------
464 * Portability fix for i686 platforms.
465 (Reported by Michael Pfeifer.)
475 <cl_ring.h>, declaring general rings,
476 <cl_GV.h>, <cl_SV.h>, defining vectors,
477 <cl_univpoly.h>, defining univariate polynomial rings.
482 * Speed up the internal computation of ln(2) and ln(10) by about 20%.
484 * Speed up the computation of exp (for 1000 digits or more) by about 10%.
486 Implementation changes
487 ----------------------
489 * Portability fix for 64-bit platforms like DEC Alpha:
490 Fixed a bug: endless loop in `sqrt' for large precision.
491 (Reported by Blake Jones.)
493 * Portability fix for RS/6000 platforms.
502 * Speed up the computation of the elementary transcendental functions:
503 exp, sinh, cosh, asinh, atanh (for 100 digits) by about 30%,
504 log (for 100 digits) by about 25%,
505 sin, cos (for 1000 or 10000 digits) by about 20%,
506 asin, acos, atan (for 1000 digits) by about 25%.
508 Implementation changes
509 ----------------------
511 * Portability fix for SunOS 4 and other BSD platforms.
520 * Fixed a bug: endless recursion in `cl_boolean sqrtp (const cl_RA&, cl_RA*)'.
522 * Fixed a bug: Only the first 85% of the digits returned by `cl_eulerconst'
523 for moderate precision (< 11370 digits) were correct.
524 (Reported by Thomas Papanikolaou.)
526 Implementation changes
527 ----------------------
529 * Fix static initialization order bug. Requires g++ 2.7.0 or newer
530 (g++ 2.8.0 or newer on HPPA).
532 * New method `debug_print()', for pretty printing of CLN objects, intended
533 to be called from the debugger.
542 * New functions `float cl_float_approx (const cl_R&)',
543 `double cl_double_approx (const cl_R&)'
544 for converting a real number to a C `float' or `double'.
549 * Speed up `cl_zeta' using Cohen-Villegas-Zagier convergence acceleration.
551 Implementation changes
552 ----------------------
554 * New function `cl_print', for pretty printing of CLN objects, intended to be
555 called from the debugger.
557 * Portability fixes for 64-bit platforms like DEC Alpha.
567 <cl_string.h>, defining strings,
568 <cl_symbol.h>, defining symbols,
569 <cl_proplist.h>, defining property lists,
570 <cl_condition.h>, defining conditions/exceptions.
572 * New functions `cl_F cl_catalanconst ()',
573 `cl_F cl_catalanconst (const cl_F&)',
574 `cl_F cl_catalanconst (cl_float_format_t)'
575 which return Catalan's constant.
576 (Suggested by Thomas Papanikolaou.)
578 * New functions `cl_F cl_zeta (int s)',
579 `cl_F cl_zeta (int s, const cl_F&)',
580 `cl_F cl_zeta (int s, cl_float_format_t)'
581 which return the Riemann zeta function at an integral point s>1.
583 * New functions `cl_F cl_exp1 ()',
584 `cl_F cl_exp1 (const cl_F&)',
585 `cl_F cl_exp1 (cl_float_format_t)'
586 which return e = exp(1).
588 * New function `cl_I binomial (uintL n, uintL k)' which returns the
589 binomial coefficient (n choose k).
591 * New functions `int cl_I_to_int (const cl_I&)',
592 `unsigned int cl_I_to_uint (const cl_I&)',
593 `long cl_I_to_long (const cl_I&)',
594 `unsigned long cl_I_to_ulong (const cl_I&)'
595 for converting an integer to a C `int' or `long'.
597 * New functions `float cl_float_approx (const cl_I&)',
598 `float cl_float_approx (const cl_RA&)',
599 `double cl_double_approx (const cl_I&)',
600 `double cl_double_approx (const cl_RA&)'
601 for converting a rational number to a C `float' or `double'.
603 Implementation changes
604 ----------------------
606 * Moved the sources to subdirectories.
607 (Suggested by Jörg Arndt.)
612 * New benchmark for better comparing LiDIA, Pari and CLN.
614 * Added an interface to LiDIA, allows using CLN as a replacement of libI.
615 (Suggested by Thomas Papanikolaou.)
617 * Added an ILOG Talk interface, for interactive use of the library.
626 * New include file <cl_modinteger.h>, defining modular integer rings.
628 * New functions `cl_F cl_eulerconst ()', `cl_F cl_eulerconst (const cl_F&)',
629 `cl_F cl_eulerconst (cl_float_format_t)' which return Euler's constant.
634 * Speed up square root of large numbers by use of Newton's algorithm.
636 * Speed up multiplication and division of large long-floats by small integers.
638 * Speed up the computation of pi, e, exp, log, sin, cos, tan, sinh, cosh, tanh,
639 asin, acos, atan, asinh, acosh, atanh.
640 All of them are now computed with asymptotically fast algorithms, of
641 bit complexity O(log(N)^2*M(N)) = O(N^(1+epsilon)) for N digits.
643 * Fixed several bugs in the transcendental functions routines. In particular,
644 the `log' function went into an endless loop.
646 * Fixed a bug: The cl_I -> cl_DF and cl_I -> cl_LF conversions didn't work
647 correctly for negative integers.
656 * New include file <cl_numtheory.h>, containing number theoretic functions,
657 for now only the Jacobi symbol.
662 * Speed up squaring of large numbers by 30%.
664 * Speed up division of large numbers by use of Newton's algorithm. The
665 improvement is noticeable for numbers with at least about 1000 words =
666 32000 bits = 10000 decimal digits.
668 * Speed up the binary-to-decimal conversion of large numbers by use of
669 a divide-and-conquer method. The improvement is noticeable for numbers
670 of at least 1250 words = 40000 bits = 12000 decimal digits.
672 * Fixed a bug: The functions `cl_boolean minusp (const type&)' and
673 `cl_boolean zerop (const type&)' were missing for type=cl_I and type=cl_RA.
675 * Fixed a bug: The function `cl_boolean logtest (const cl_I&, const cl_I&)'
676 didn't work correctly if both arguments were bignums.
678 * Fixed a bug: The function `cl_I mod (const cl_I&, const cl_I&)', when called
679 as `mod(-n*m,m)' (n>0), returned m instead of 0.
681 * Fixed a bug: The function `uintL power2p (const cl_I&)' returned wrong
682 values for arguments x = 2^n, n >= 29.
684 Implementation changes
685 ----------------------
687 * Speed up CLN by using the low-level addition/subtraction, shift and
688 multiplication loops from GNU gmp-2.0.2.
690 * Fixed a severe reference counting bug in the constructors
691 `type::type (const long)' and `type::type (const unsigned long)'
692 for type=cl_number, type=cl_N, type=cl_RA, type=cl_I that most often
695 * CLN's word sequences can be chosen to be stored big-endian in memory
696 (like it was up to now) or little-endian (needed for interfacing to GMP).
705 * New include file <cl_timing.h>, contains timing facilities.
710 * Speed up the multiplication of large numbers by use of an FFT based
711 algorithm (Schönhage-Strassen). The improvement is noticeable when both
712 factors have at least 1250 words = 40000 bits = 12000 decimal digits.
714 * Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
715 `cl_I xgcd (const cl_I&, const cl_I&, cl_I*, cl_I*)' by a factor
716 of 1.5. Simple trick.
718 * Speed up the function `cl_boolean sqrtp (const cl_I&, cl_I*)' using a
719 trick from Henri Cohen.
721 * Fixed an endless loop in the function `uint32 gcd (uint32, uint32)'
722 which occurred when one of the arguments is zero.
724 * Fixed an endless loop in the function `cl_I factorial (uintL)'.
726 Implementation changes
727 ----------------------
729 * <cl_io.h> now uses iostreams by default instead of stdio FILE pointers.
730 (Reported by Tito Flagella.)
732 * Fixed linking error when compiling without -O.
733 (Reported by Tito Flagella.)
735 * Fixed syntax error in <cl_input.h>.
736 (Reported by Tito Flagella.)
738 * Fixed syntax errors in src/cl_DS.h and src/cl_FF_plus.h.
739 (Reported by Marcus Daniels.)
741 * More portability fixes.
743 * Configuration now supports the --srcdir option.
744 (Reported by Marcus Daniels.)
750 * Compiles well on Sparc, using gcc.
752 * Mail to beta testers.
758 * Compiles well on Linux, using gcc.