@@ -16,9 +16,6 @@ A `BigUint` is represented as an array of `BigDigit`s.
16
16
A `BigInt` is a combination of `BigUint` and `Sign`.
17
17
*/
18
18
19
- #[ allow( missing_doc) ] ;
20
- #[ allow( non_uppercase_statics) ] ;
21
-
22
19
use std:: cmp:: { Eq , Ord , TotalEq , TotalOrd , Ordering , Less , Equal , Greater } ;
23
20
use std:: num;
24
21
use std:: num:: { Zero , One , ToStrRadix , FromStrRadix , Orderable } ;
@@ -48,7 +45,7 @@ pub type BigDigit = u32;
48
45
pub static ZERO_BIG_DIGIT : BigDigit = 0 ;
49
46
50
47
pub mod BigDigit {
51
- use bigint :: BigDigit ;
48
+ use super :: BigDigit ;
52
49
53
50
#[ cfg( target_word_size = "32" ) ]
54
51
pub static bits: uint = 16 ;
@@ -1433,8 +1430,8 @@ impl BigInt {
1433
1430
1434
1431
#[cfg(test)]
1435
1432
mod biguint_tests {
1436
- use super::* ;
1437
- use super::RandBigInt;
1433
+ use super::{BigDigit, BigUint, ToBigUint} ;
1434
+ use super::{Plus, BigInt, RandBigInt, ToBigInt} ;
1438
1435
1439
1436
use std::cmp::{Less, Equal, Greater};
1440
1437
use std::i64;
@@ -2090,8 +2087,8 @@ mod biguint_tests {
2090
2087
2091
2088
#[ cfg( test) ]
2092
2089
mod bigint_tests {
2093
- use super :: * ;
2094
- use super :: RandBigInt ;
2090
+ use super :: { BigDigit , BigUint , ToBigUint } ;
2091
+ use super :: { Sign , Minus , Zero , Plus , BigInt , RandBigInt , ToBigInt } ;
2095
2092
2096
2093
use std:: cmp:: { Less , Equal , Greater } ;
2097
2094
use std:: i64;
@@ -2591,7 +2588,7 @@ mod bigint_tests {
2591
2588
2592
2589
#[ cfg( test) ]
2593
2590
mod bench {
2594
- use super :: * ;
2591
+ use super :: { BigInt , BigUint } ;
2595
2592
use std:: iter;
2596
2593
use std:: mem:: replace;
2597
2594
use std:: num:: { FromPrimitive , Zero , One } ;
0 commit comments