X-Git-Url: https://git.ralfj.de/rust-101.git/blobdiff_plain/8fcdbed310c53f621fba0401399659ed1a1ec446..5f6e02d64e3789115ea4327a045b8ad3c39b1808:/src/part08.rs?ds=sidebyside
diff --git a/src/part08.rs b/src/part08.rs
index 7a9c093..7b471b9 100644
--- a/src/part08.rs
+++ b/src/part08.rs
@@ -20,17 +20,19 @@ fn overflowing_add(a: u64, b: u64, carry: bool) -> (u64, bool) {
//@ function (see [the documentation](http://doc.rust-lang.org/stable/std/primitive.u64.html#method.wrapping_add),
//@ there are similar functions for other arithmetic operations). There are also similar functions
//@ `checked_add` etc. to enforce the overflow check.
- let sum = u64::wrapping_add(a, b);
+ let sum = a.wrapping_add(b);
// If an overflow happened, then the sum will be smaller than *both* summands. Without an overflow, of course, it will be
// at least as large as both of them. So, let's just pick one and check.
if sum >= a {
// The addition did not overflow.
// **Exercise 08.1**: Write the code to handle adding the carry in this case.
- unimplemented!()
+ let sum_total = sum.wrapping_add(if carry { 1 } else { 0 });/*@@*/
+ let had_overflow = sum_total < sum; /*@@*/
+ (sum_total, had_overflow) /*@@*/
} else {
// Otherwise, the addition *did* overflow. It is impossible for the addition of the carry
// to overflow again, as we are just adding 0 or 1.
- (sum + if carry { 1 } else { 0 }, true) /*@*/
+ (sum + if carry { 1 } else { 0 }, true) /*@*/
}
}
@@ -82,7 +84,10 @@ impl ops::Add for BigInt {
carry = new_carry; /*@*/
}
// **Exercise 08.2**: Handle the final `carry`, and return the sum.
- unimplemented!()
+ if carry { /*@@*/
+ result_vec.push(1); /*@@*/
+ } /*@@*/
+ BigInt { data: result_vec } /*@@*/
}
}