You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

516 lines
14 KiB

24 years ago
24 years ago
24 years ago
24 years ago
25 years ago
  1. 2000-11-xx, version 1.1.0
  2. =========================
  3. Functional changes
  4. ------------------
  5. * ISO/IEC 14882 fashion adjustments:
  6. Put everything into namespace cln. All fundamental data types still
  7. carry their old names. Other non-macro identifiers are now written as
  8. cln::foo instead of cl_foo, except where the cl_ comes from a data type
  9. (as in cl_I_to_int()). Headers are installed into a separate
  10. directory, #include <cln/foo.h> instead of <cl_foo.h>. Applications
  11. must be manually ported to the new style. We apologize for the
  12. inconvenience.
  13. Implementation changes
  14. ----------------------
  15. * Removed internal copy of mpn subdirectory tree from libgmp-2.0.2.
  16. Configuring with --with-gmp now relies on an installed libgmp library
  17. version 3 or above. We recommend libgmp-3.1 or newer.
  18. * Adjusted several break-even points to make better use of a faster libgmp and
  19. better match present-day CPUs.
  20. * Fix several errors for architectures with 64-bit wide words.
  21. (Others than Alpha.)
  22. * Fix compilation errors with current GCC-3.0 snapshots.
  23. Other changes
  24. -------------
  25. * Added package tools: script cln-config and autoconf macro AC_PATH_CLN
  26. (in file cln.m4).
  27. 2000-01-13, version 1.0.3
  28. =========================
  29. Functional changes
  30. ------------------
  31. * New function
  32. `cl_I doublefactorial (uintL n)'.
  33. Implementation changes
  34. ----------------------
  35. * Fix several little configuration errors.
  36. * Fix some compilation errors with gcc-2.96 prereleases.
  37. 1999-09-07, version 1.0.2
  38. =========================
  39. Functional changes
  40. ------------------
  41. * New functions
  42. `cl_I numerator (const cl_RA&)'
  43. `cl_I denominator (const cl_RA&)'.
  44. Suggested by Richard Kreckel and Sylvain Pion.
  45. * New function `cl_equal_hashcode' for the classes cl_N, cl_R, cl_RA, cl_I,
  46. cl_F, cl_SF, cl_FF, cl_DF, cl_LF.
  47. Suggested by Richard Kreckel.
  48. Implementation changes
  49. ----------------------
  50. * Fix an endless loop when either of the functions
  51. `cl_boolean rootp (const cl_RA&, uintL, cl_RA*)',
  52. `cl_boolean rootp (const cl_RA&, const cl_I&, cl_RA*)'
  53. was called with an integer argument. Thanks to Richard Kreckel.
  54. * Fix a bug in the addition and subtraction of rational numbers which could
  55. cause unnormalized rational numbers like 3/1 to be created.
  56. 1999-06-09, version 1.0.1
  57. =========================
  58. Algorithmic changes
  59. -------------------
  60. * Speed up the functions `logand', `lognand', `logandc2'.
  61. Implementation changes
  62. ----------------------
  63. * Fix compilation errors with gcc-2.7.2, egcs-1.1.2 and gcc-2.95.
  64. * Fix compilation errors on HPPA, MIPS, some versions of DEC Alpha, OpenBSD,
  65. and SPARC with LiDIA.
  66. * Fix compilation errors on Win32. Thanks to Mumit Khan.
  67. 1999-01-12, version 1.0
  68. =======================
  69. Functional changes
  70. ------------------
  71. * New include files, containing I/O functions:
  72. <cl_integer_io.h>
  73. <cl_rational_io.h>
  74. <cl_float_io.h>
  75. <cl_sfloat_io.h> <cl_ffloat_io.h> <cl_dfloat_io.h> <cl_lfloat_io.h>
  76. <cl_real_io.h>
  77. <cl_complex_io.h>
  78. The file <cl_io.h> now contains only I/O functions for characters and
  79. C integers.
  80. * To access the base ring of a univariate polynomial ring, now use
  81. `R->basering()' instead of `R->basering'.
  82. * Implement `plusp', `max', `min' for the classes cl_F, cl_SF, cl_FF, cl_DF,
  83. cl_LF, cl_RA, cl_I.
  84. * Implement `abs' for the class cl_RA.
  85. * Replaced `read_number' with specialized functions `read_complex',
  86. `read_real', `read_float', `read_rational', `read_integer'.
  87. * Replaced the functions
  88. `void fprint (cl_ostream stream, int x)'
  89. `void fprint (cl_ostream stream, unsigned int x)'
  90. `void fprint (cl_ostream stream, long x)'
  91. `void fprint (cl_ostream stream, unsigned long x)'
  92. with
  93. `void fprintdecimal (cl_ostream stream, int x)'
  94. `void fprintdecimal (cl_ostream stream, unsigned int x)'
  95. `void fprintdecimal (cl_ostream stream, long x)'
  96. `void fprintdecimal (cl_ostream stream, unsigned long x)'
  97. Algorithmic changes
  98. -------------------
  99. * The function `cl_I xgcd (const cl_I& a, const cl_I& b, cl_I* u, cl_I* v)'
  100. now normalizes the resulting u and v to be of minimum absolute value.
  101. (Suggested by the LiDIA group.)
  102. * The conversion from string to cl_F, cl_R, cl_N now chooses the format of
  103. the resulting float depending on the number of significant digits present
  104. in the input string.
  105. * Speed up the functions
  106. `cl_R operator* (const cl_RA&, const cl_LF&)'
  107. `cl_R operator* (const cl_LF&, const cl_RA&)'
  108. `cl_R operator/ (const cl_RA&, const cl_LF&)'
  109. `cl_LF operator/ (const cl_LF&, const cl_RA&)'
  110. Implementation changes
  111. ----------------------
  112. * Fix for `cl_I ash (const cl_I& x, const cl_I& n)' when |n| is between
  113. 2^29 and 2^37.
  114. (Reported by Thomas Papanikolaou.)
  115. * Fixed a memory leak in the long-float truncate function.
  116. (Reported by Keith Briggs.)
  117. * Fixed a memory leak in the modular integer exponentiation.
  118. * Reduced the stack space consumption. The default stack size (typically
  119. 8 MB on Unix) should now be sufficient in order to run all CLN programs.
  120. * Portability fixes for m68k platforms.
  121. (Reported and fixed by Roman Hodek.)
  122. Other changes
  123. -------------
  124. * Restructured the sources. The subpackages
  125. - base
  126. - base + integer
  127. - base + integer + rational
  128. - base + integer + rational + float
  129. - base + integer + rational + float + real
  130. - base + integer + rational + float + real + complex
  131. - base + integer + modinteger
  132. are now self-contained.
  133. * The configuration script can be called with option `--enable-shared',
  134. to build CLN as a shared library.
  135. * Updated the LiDIA interface.
  136. 1998-05-07, version 0.98
  137. ========================
  138. Implementation changes
  139. ----------------------
  140. * Portability fixes for 64-bit platforms like DEC Alpha.
  141. (Reported by John Cremona and Thomas Papanikolaou.)
  142. 1998-02-27
  143. ==========
  144. Other changes
  145. -------------
  146. * Portability fixes for new ISO/ANSI C++ compilers.
  147. * Updated the LiDIA interface for LiDIA version 1.3 and fixed a couple of
  148. bugs.
  149. 1997-09-06
  150. ==========
  151. Implementation changes
  152. ----------------------
  153. * Portability fix for i686 platforms.
  154. (Reported by Michael Pfeifer.)
  155. 1997-09-01
  156. ==========
  157. Functional changes
  158. ------------------
  159. * New include files:
  160. <cl_ring.h>, declaring general rings,
  161. <cl_GV.h>, <cl_SV.h>, defining vectors,
  162. <cl_univpoly.h>, defining univariate polynomial rings.
  163. Algorithmic changes
  164. -------------------
  165. * Speed up the internal computation of ln(2) and ln(10) by about 20%.
  166. * Speed up the computation of exp (for 1000 digits or more) by about 10%.
  167. Implementation changes
  168. ----------------------
  169. * Portability fix for 64-bit platforms like DEC Alpha:
  170. Fixed a bug: endless loop in `sqrt' for large precision.
  171. (Reported by Blake Jones.)
  172. * Portability fix for RS/6000 platforms.
  173. 1997-02-21
  174. ==========
  175. Algorithmic changes
  176. -------------------
  177. * Speed up the computation of the elementary transcendental functions:
  178. exp, sinh, cosh, asinh, atanh (for 100 digits) by about 30%,
  179. log (for 100 digits) by about 25%,
  180. sin, cos (for 1000 or 10000 digits) by about 20%,
  181. asin, acos, atan (for 1000 digits) by about 25%.
  182. Implementation changes
  183. ----------------------
  184. * Portability fix for SunOS 4 and other BSD platforms.
  185. 1997-01-31
  186. ==========
  187. Algorithmic changes
  188. -------------------
  189. * Fixed a bug: endless recursion in `cl_boolean sqrtp (const cl_RA&, cl_RA*)'.
  190. * Fixed a bug: Only the first 85% of the digits returned by `cl_eulerconst'
  191. for moderate precision (< 11370 digits) were correct.
  192. (Reported by Thomas Papanikolaou.)
  193. Implementation changes
  194. ----------------------
  195. * Fix static initialization order bug. Requires g++ 2.7.0 or newer
  196. (g++ 2.8.0 or newer on HPPA).
  197. * New method `debug_print()', for pretty printing of CLN objects, intended
  198. to be called from the debugger.
  199. 1997-01-07
  200. ==========
  201. Functional changes
  202. ------------------
  203. * New functions `float cl_float_approx (const cl_R&)',
  204. `double cl_double_approx (const cl_R&)'
  205. for converting a real number to a C `float' or `double'.
  206. Algorithmic changes
  207. -------------------
  208. * Speed up `cl_zeta' using Cohen-Villegas-Zagier convergence acceleration.
  209. Implementation changes
  210. ----------------------
  211. * New function `cl_print', for pretty printing of CLN objects, intended to be
  212. called from the debugger.
  213. * Portability fixes for 64-bit platforms like DEC Alpha.
  214. 1996-11-29
  215. ==========
  216. Functional changes
  217. ------------------
  218. * New include files:
  219. <cl_string.h>, defining strings,
  220. <cl_symbol.h>, defining symbols,
  221. <cl_proplist.h>, defining property lists,
  222. <cl_condition.h>, defining conditions/exceptions.
  223. * New functions `cl_F cl_catalanconst ()',
  224. `cl_F cl_catalanconst (const cl_F&)',
  225. `cl_F cl_catalanconst (cl_float_format_t)'
  226. which return Catalan's constant.
  227. (Suggested by Thomas Papanikolaou.)
  228. * New functions `cl_F cl_zeta (int s)',
  229. `cl_F cl_zeta (int s, const cl_F&)',
  230. `cl_F cl_zeta (int s, cl_float_format_t)'
  231. which return the Riemann zeta function at an integral point s>1.
  232. * New functions `cl_F cl_exp1 ()',
  233. `cl_F cl_exp1 (const cl_F&)',
  234. `cl_F cl_exp1 (cl_float_format_t)'
  235. which return e = exp(1).
  236. * New function `cl_I binomial (uintL n, uintL k)' which returns the
  237. binomial coefficient (n choose k).
  238. * New functions `int cl_I_to_int (const cl_I&)',
  239. `unsigned int cl_I_to_uint (const cl_I&)',
  240. `long cl_I_to_long (const cl_I&)',
  241. `unsigned long cl_I_to_ulong (const cl_I&)'
  242. for converting an integer to a C `int' or `long'.
  243. * New functions `float cl_float_approx (const cl_I&)',
  244. `float cl_float_approx (const cl_RA&)',
  245. `double cl_double_approx (const cl_I&)',
  246. `double cl_double_approx (const cl_RA&)'
  247. for converting a rational number to a C `float' or `double'.
  248. Implementation changes
  249. ----------------------
  250. * Moved the sources to subdirectories.
  251. (Suggested by J�rg Arndt.)
  252. Other changes
  253. -------------
  254. * New benchmark for better comparing LiDIA, Pari and CLN.
  255. * Added an interface to LiDIA, allows using CLN as a replacement of libI.
  256. (Suggested by Thomas Papanikolaou.)
  257. * Added an ILOG Talk interface, for interactive use of the library.
  258. 1996-10-13
  259. ==========
  260. Functional changes
  261. ------------------
  262. * New include file <cl_modinteger.h>, defining modular integer rings.
  263. * New functions `cl_F cl_eulerconst ()', `cl_F cl_eulerconst (const cl_F&)',
  264. `cl_F cl_eulerconst (cl_float_format_t)' which return Euler's constant.
  265. Algorithmic changes
  266. -------------------
  267. * Speed up square root of large numbers by use of Newton's algorithm.
  268. * Speed up multiplication and division of large long-floats by small integers.
  269. * Speed up the computation of pi, e, exp, log, sin, cos, tan, sinh, cosh, tanh,
  270. asin, acos, atan, asinh, acosh, atanh.
  271. All of them are now computed with asymptotically fast algorithms, of
  272. bit complexity O(log(N)^2*M(N)) = O(N^(1+epsilon)) for N digits.
  273. * Fixed several bugs in the transcendental functions routines. In particular,
  274. the `log' function went into an endless loop.
  275. * Fixed a bug: The cl_I -> cl_DF and cl_I -> cl_LF conversions didn't work
  276. correctly for negative integers.
  277. 1996-09-08
  278. ==========
  279. Functional changes
  280. ------------------
  281. * New include file <cl_numtheory.h>, containing number theoretic functions,
  282. for now only the Jacobi symbol.
  283. Algorithmic changes
  284. -------------------
  285. * Speed up squaring of large numbers by 30%.
  286. * Speed up division of large numbers by use of Newton's algorithm. The
  287. improvement is noticeable for numbers with at least about 1000 words =
  288. 32000 bits = 10000 decimal digits.
  289. * Speed up the binary-to-decimal conversion of large numbers by use of
  290. a divide-and-conquer method. The improvement is noticeable for numbers
  291. of at least 1250 words = 40000 bits = 12000 decimal digits.
  292. * Fixed a bug: The functions `cl_boolean minusp (const type&)' and
  293. `cl_boolean zerop (const type&)' were missing for type=cl_I and type=cl_RA.
  294. * Fixed a bug: The function `cl_boolean logtest (const cl_I&, const cl_I&)'
  295. didn't work correctly if both arguments were bignums.
  296. * Fixed a bug: The function `cl_I mod (const cl_I&, const cl_I&)', when called
  297. as `mod(-n*m,m)' (n>0), returned m instead of 0.
  298. * Fixed a bug: The function `uintL power2p (const cl_I&)' returned wrong
  299. values for arguments x = 2^n, n >= 29.
  300. Implementation changes
  301. ----------------------
  302. * Speed up CLN by using the low-level addition/subtraction, shift and
  303. multiplication loops from GNU gmp-2.0.2.
  304. * Fixed a severe reference counting bug in the constructors
  305. `type::type (const long)' and `type::type (const unsigned long)'
  306. for type=cl_number, type=cl_N, type=cl_RA, type=cl_I that most often
  307. caused a core dump.
  308. * CLN's word sequences can be chosen to be stored big-endian in memory
  309. (like it was up to now) or little-endian (needed for interfacing to GMP).
  310. 1996-05-20
  311. ==========
  312. Functional changes
  313. ------------------
  314. * New include file <cl_timing.h>, contains timing facilities.
  315. Algorithmic changes
  316. -------------------
  317. * Speed up the multiplication of large numbers by use of an FFT based
  318. algorithm (Sch�nhage-Strassen). The improvement is noticeable when both
  319. factors have at least 1250 words = 40000 bits = 12000 decimal digits.
  320. * Speed up the functions `cl_I gcd (const cl_I&, const cl_I&)' and
  321. `cl_I xgcd (const cl_I&, const cl_I&, cl_I*, cl_I*)' by a factor
  322. of 1.5. Simple trick.
  323. * Speed up the function `cl_boolean sqrtp (const cl_I&, cl_I*)' using a
  324. trick from Henri Cohen.
  325. * Fixed an endless loop in the function `uint32 gcd (uint32, uint32)'
  326. which occurred when one of the arguments is zero.
  327. * Fixed an endless loop in the function `cl_I factorial (uintL)'.
  328. Implementation changes
  329. ----------------------
  330. * <cl_io.h> now uses iostreams by default instead of stdio FILE pointers.
  331. (Reported by Tito Flagella.)
  332. * Fixed linking error when compiling without -O.
  333. (Reported by Tito Flagella.)
  334. * Fixed syntax error in <cl_input.h>.
  335. (Reported by Tito Flagella.)
  336. * Fixed syntax errors in src/cl_DS.h and src/cl_FF_plus.h.
  337. (Reported by Marcus Daniels.)
  338. * More portability fixes.
  339. * Configuration now supports the --srcdir option.
  340. (Reported by Marcus Daniels.)
  341. 1996-01-03
  342. ==========
  343. * Compiles well on Sparc, using gcc.
  344. * Mail to beta testers.
  345. 1995-12-06
  346. ==========
  347. * Compiles well on Linux, using gcc.