other
} else {
// compare back-to-front, i.e., most significant digit first
- let mut idx = self.data.len()-1;
+ let mut idx = self.data.len();
while idx > 0 {
+ idx = idx-1;
if self.data[idx] < other.data[idx] {
return self;
} else if self.data[idx] > other.data[idx] {
return other;
}
- else {
- idx = idx-1;
- }
}
// the two are equal
return self;
#[cfg(test)]
mod tests {
use std::u64;
- use super::{overflowing_add,overflowing_sub,BigInt};
+ use super::{overflowing_add,overflowing_sub,BigInt,Minimum,vec_min};
+
+ #[test]
+ fn test_min() {
+ let b1 = BigInt::new(1);
+ let b2 = BigInt::new(42);
+ let b3 = BigInt::from_vec(vec![0, 1]);
+
+ assert_eq!(b1.min(&b2), &b1);
+ assert_eq!(b2.min(&b1), &b1);
+ assert_eq!(b3.min(&b2), &b2);
+ assert_eq!(b2.min(&b3), &b2);
+ }
+
+ #[test]
+ fn test_vec_min() {
+ let b1 = BigInt::new(1);
+ let b2 = BigInt::new(42);
+ let b3 = BigInt::from_vec(vec![0, 1]);
+
+ assert_eq!(vec_min(&vec![b2.clone(), b1.clone(), b3.clone()]), Some(&b1));
+ assert_eq!(vec_min(&vec![b2.clone(), b3.clone()]), Some(&b2));
+ assert_eq!(vec_min(&vec![b3.clone()]), Some(&b3));
+ assert_eq!(vec_min::<BigInt>(&vec![]), None);
+ }
#[test]
fn test_overflowing_add() {