X-Git-Url: https://mattmccutchen.net/bigint/bigint.git/blobdiff_plain/b1f5f69ee6a55e326f1336a3967513fd22f57d7f..26a5f52b24d9c9733139a6cf29647f1de7915a56:/BigUnsigned.cc

diff --git a/BigUnsigned.cc b/BigUnsigned.cc
index a2ab58c..33fe0af 100644
--- a/BigUnsigned.cc
+++ b/BigUnsigned.cc
@@ -1,6 +1,5 @@
 /*
 * Matt McCutchen's Big Integer Library
-* http://hashproduct.metaesthetics.net/bigint/
 */
 
 #include "BigUnsigned.hh"
@@ -428,7 +427,7 @@ void BigUnsigned::multiply(const BigUnsigned &a, const BigUnsigned &b) {
 	for (i = 0; i < a.len; i++) {
 		// For each 1-bit of that block...
 		for (i2 = 0; i2 < N; i2++) {
-			if ((a.blk[i] & (1 << i2)) == 0)
+			if ((a.blk[i] & (Blk(1) << i2)) == 0)
 				continue;
 			/*
 			* Add b to this, shifted left i blocks and i2 bits.
@@ -623,7 +622,7 @@ void BigUnsigned::divideWithRemainder(const BigUnsigned &b, BigUnsigned &q) {
 			* the region of work2 we copy is just [i, k).
 			*/
 			if (!borrowIn) {
-				q.blk[i] |= (1 << i2);
+				q.blk[i] |= (Blk(1) << i2);
 				while (k > i) {
 					k--;
 					blk[k] = work2[k];
@@ -752,8 +751,10 @@ void BigUnsigned::operator ++() {
 	}
 	if (carry) {
 		// Matt fixed a bug 2004.12.24: next 2 lines used to say allocateAndCopy(len + 1)
+		// Matt fixed another bug 2006.04.24:
+		// old number only has len blocks, so copy before increasing length
+		allocateAndCopy(len + 1);
 		len++;
-		allocateAndCopy(len);
 		blk[i] = 1;
 	}
 }