@@ -125,7 +125,7 @@ impl Ord for BigUint {
125125impl TotalOrd for BigUint {
126126
127127 fn cmp ( & self , other : & BigUint ) -> Ordering {
128- let s_len = self . data . len ( ) , o_len = other. data . len ( ) ;
128+ let ( s_len, o_len ) = ( self . data . len ( ) , other. data . len ( ) ) ;
129129 if s_len < o_len { return Less ; }
130130 if s_len > o_len { return Greater ; }
131131
@@ -255,7 +255,7 @@ impl Mul<BigUint, BigUint> for BigUint {
255255 fn mul ( & self , other : & BigUint ) -> BigUint {
256256 if self . is_zero ( ) || other. is_zero ( ) { return Zero :: zero ( ) ; }
257257
258- let s_len = self . data . len ( ) , o_len = other. data . len ( ) ;
258+ let ( s_len, o_len ) = ( self . data . len ( ) , other. data . len ( ) ) ;
259259 if s_len == 1 { return mul_digit ( other, self . data [ 0 ] ) ; }
260260 if o_len == 1 { return mul_digit ( self , other. data [ 0 ] ) ; }
261261
@@ -447,7 +447,7 @@ impl Integer for BigUint {
447447
448448 fn gcd ( & self , other : & BigUint ) -> BigUint {
449449 // Use Euclid's algorithm
450- let mut m = copy * self , n = copy * other;
450+ let mut ( m , n ) = ( copy * self , copy * other) ;
451451 while !m. is_zero ( ) {
452452 let temp = m;
453453 m = n % temp;
@@ -1002,8 +1002,8 @@ impl Integer for BigInt {
10021002 fn div_mod_floor ( & self , other : & BigInt ) -> ( BigInt , BigInt ) {
10031003 // m.sign == other.sign
10041004 let ( d_ui, m_ui) = self . data . div_rem ( & other. data ) ;
1005- let d = BigInt :: from_biguint ( Plus , d_ui) ,
1006- m = BigInt :: from_biguint ( Plus , m_ui) ;
1005+ let d = BigInt :: from_biguint ( Plus , d_ui) ;
1006+ let m = BigInt :: from_biguint ( Plus , m_ui) ;
10071007 match ( self . sign , other. sign ) {
10081008 ( _, Zero ) => fail ! ( ) ,
10091009 ( Plus , Plus ) | ( Zero , Plus ) => ( d, m) ,
0 commit comments