Matt McCutchen's Web Site / bigint / bigint.git / blame
| Commit | Line | Data |
|---|---|---|
| 826c7bda | 1 | +===================================================================+ |
| a8b42b68 | 2 | Matt McCutchen's Big Integer Library |
| a8b42b68 MM |
3 | |
| 4 | Change Log | |
| 5 | ========== | |
| 6 | These entries tell you what was added, fixed, or improved in each version as compared to the previous one. In case you haven't noticed, a version number roughly corresponds to the release date of that version in `YYYY.MM.DD[.N]' format, where `.N' goes `.2', `.3', etc. if there are multiple versions on the same day. | |
| 7 | ||
| 8c16728a MM |
8 | 2007.02.13 |
| 9 | ---------- | |
| 10 | Boris Dessy pointed out that the library threw an exception on "a *= a", so I changed all the put-here operations to handle aliased calls correctly using a temporary copy instead of throwing exceptions. | |
| 11 | ||
| 3aaa5ce6 MM |
12 | 2006.08.14 |
| 13 | ---------- | |
| 14 | In BigUnsigned::bitXor, change allocate(b2->len) to allocate(a2->len): we should allocate enough space for the longer number, not the shorter one! Thanks to Sriram Sankararaman for pointing this out. | |
| 15 | ||
| be1bdfe2 MM |
16 | 2006.05.03 |
| 17 | ---------- | |
| 18 | I ran the sample program using valgrind and discovered a `delete s' that should be `delete [] s' and a `len++' before an `allocateAndCopy(len)' that should have been after an `allocateAndCopy(len + 1)'. I fixed both. Yay for valgrind! | |
| 19 | ||
| 26a5f52b MM |
20 | 2006.05.01 |
| 21 | ---------- | |
| 22 | I fixed incorrect results reported by Mohand Mezmaz and related memory corruption on platforms where Blk is bigger than int. I replaced (1 << x) with (Blk(1) << x) in two places in BigUnsigned.cc. | |
| 23 | ||
| 918d66f2 MM |
24 | 2006.04.24 |
| 25 | ---------- | |
| 26 | Two bug fixes: BigUnsigned "++x" no longer segfaults when x grows in length, and BigUnsigned == and != are now redeclared so as to be usable. I redid the Makefile: I removed the *.tag mechanism and hard-coded the library's header dependencies, I added comments, and I made the Makefile more useful for building one's own programs instead of just the sample. | |
| 27 | ||
| b1f5f69e MM |
28 | 2006.02.26 |
| 29 | ---------- | |
| 30 | A few tweaks in preparation for a group to distribute the library. The project Web site has moved; I updated the references. I fixed a typo and added a missing function in NumberlikeArray.hh. I'm using Eclipse now, so you get Eclipse project files. | |
| 31 | ||
| f316def7 MM |
32 | 2005.03.30 |
| 33 | ---------- | |
| 34 | Sam Larkin found a bug in `BigInteger::subtract'; I fixed it. | |
| 35 | ||
| 3260eb33 MM |
36 | 2005.01.18 |
| 37 | ---------- | |
| 38 | I fixed some problems with `easyDataToBI'. Due to some multiply declared variables, this function would not compile. However, it is a template function, so the compiler parses it and doesn't compile the parsed representation until something uses the function; this is how I missed the problems. I also removed debugging output from this function. | |
| 39 | ||
| 826c7bda | 40 | 2005.01.17 |
| a8b42b68 | 41 | ---------- |
| 826c7bda | 42 | A fix to some out-of-bounds accesses reported by Milan Tomic (see the comment under `BigUnsigned::divideWithRemainder'). `BigUnsigned::multiply' and `BigUnsigned::divideWithRemainder' implementations neatened up a bit with the help of a function `getShiftedBlock'. I (finally!) introduced a constant `BigUnsigned::N', the number of bits in a `BigUnsigned::Blk', which varies depending on machine word size. In both code and comments, it replaces the much clunkier `8*sizeof(Blk)'. Numerous other small changes. There's a new conversion routine `easyDataToBI' that will convert almost any format of binary data to a `BigInteger'. |
| a8b42b68 MM |
43 | |
| 44 | I have inserted a significant number of new comments. Most explain unobvious aspects of the code. | |
| 45 | ||
| 46 | 2005.01.06 | |
| 47 | ---------- | |
| 48 | Some changes to the way zero-length arrays are handled by `NumberlikeArray', which fixed a memory leak reported by Milan Tomic. | |
| 49 | ||
| 50 | 2004.12.24.2 | |
| 51 | ------------ | |
| 52 | I tied down a couple of loose ends involving division/modulo. I added an explanation of put-here vs. overloaded operators in the sample program; this has confused too many people. Miscellaneous other improvements. | |
| 53 | ||
| 54 | I believe that, at this point, the Big Integer Library makes no assumptions about the word size of the machine it is using. `BigUnsigned::Blk' is always an `unsigned long', whatever that may be, and its size is computed with `sizeof' when necessary. However, just in case, I would be interested to have someone test the library on a non-32-bit machine to see if it works. | |
| 55 | ||
| 56 | 2004.12.24 | |
| 57 | ---------- | |
| 58 | This is a _major_ upgrade to the library. Among the things that have changed: | |
| 59 | ||
| 60 | I wrote the original version of the library, particularly the four ``classical algorithms'' in `BigUnsigned.cc', using array indexing. Then I rewrote it to use pointers because I thought that would be faster. But recently, I revisited the code in `BigUnsigned.cc' and found that I could not begin to understand what it was doing. | |
| 61 | ||
| 62 | I have decided that the drawbacks of pointers, increased coding difficulty and reduced code readability, far outweigh their speed benefits. Plus, any modern optimizing compiler should produce fast code either way. Therefore, I rewrote the library to use array indexing again. (Thank goodness for regular-expression find-and-replace. It saved me a lot of time.) | |
| 63 | ||
| 64 | The put-here operations `divide' and `modulo' of each of `BigUnsigned' and `BigInteger' have been supplanted by a single operation `divideWithRemainder'. Read the profuse comments for more information on its exact behavior. | |
| 65 | ||
| 66 | There is a new class `BigUnsignedInABase' that is like `BigUnsigned' but uses a user-specified, small base instead of `256 ^ sizeof(unsigned long)'. Much of the code common to the two has been factored out into `NumberlikeArray'. | |
| 67 | ||
| 68 | `BigUnsignedInABase' facilitates conversion between `BigUnsigned's and digit-by-digit string representations using `std::string'. Convenience routines to do this conversion are in `BigIntegerUtils.hh'. `iostream' compatibility has been improved. | |
| 69 | ||
| 70 | I would like to thank Chris Morbitzer for the e-mail message that catalyzed this major upgrade. He wanted a way to convert a string to a BigInteger. One thing just led to another, roughly in reverse order from how they are listed here. | |
| 71 | ||
| 72 | 2004.1216 | |
| 73 | --------- | |
| 74 | Brad Spencer pointed out a memory leak in `BigUnsigned::divide'. It is fixed in the December 16, 2004 version. | |
| 75 | ||
| 76 | 2004.1205 | |
| 77 | --------- | |
| 78 | After months of inactivity, I fixed a bug in the `BigInteger' division routine; thanks to David Allen for reporting the bug. I also added simple routines for decimal output to `std::ostream's, and there is a demo that prints out powers of 3. | |
| 79 | ||
| be1bdfe2 | 80 | +===================================================================+ |