@@ -86,12 +86,9 @@ pub mod BigDigit {
86
86
use super :: DoubleBigDigit ;
87
87
88
88
// `DoubleBigDigit` size dependent
89
- #[ allow( non_uppercase_statics) ]
90
89
pub static bits: uint = 32 ;
91
90
92
- #[ allow( non_uppercase_statics) ]
93
91
pub static base: DoubleBigDigit = 1 << bits;
94
- #[ allow( non_uppercase_statics) ]
95
92
static lo_mask: DoubleBigDigit = ( -1 as DoubleBigDigit ) >> bits;
96
93
97
94
#[ inline]
@@ -1844,7 +1841,7 @@ mod biguint_tests {
1844
1841
BigInt :: from_biguint ( Plus , BigUint :: new ( vec ! ( 1 , 2 , 3 ) ) ) ) ;
1845
1842
}
1846
1843
1847
- static SUM_TRIPLES : & ' static [ ( & ' static [ BigDigit ] ,
1844
+ static sum_triples : & ' static [ ( & ' static [ BigDigit ] ,
1848
1845
& ' static [ BigDigit ] ,
1849
1846
& ' static [ BigDigit ] ) ] = & [
1850
1847
( & [ ] , & [ ] , & [ ] ) ,
@@ -1860,7 +1857,7 @@ mod biguint_tests {
1860
1857
1861
1858
#[ test]
1862
1859
fn test_add ( ) {
1863
- for elm in SUM_TRIPLES . iter ( ) {
1860
+ for elm in sum_triples . iter ( ) {
1864
1861
let ( a_vec, b_vec, c_vec) = * elm;
1865
1862
let a = BigUint :: from_slice ( a_vec) ;
1866
1863
let b = BigUint :: from_slice ( b_vec) ;
@@ -1873,7 +1870,7 @@ mod biguint_tests {
1873
1870
1874
1871
#[ test]
1875
1872
fn test_sub ( ) {
1876
- for elm in SUM_TRIPLES . iter ( ) {
1873
+ for elm in sum_triples . iter ( ) {
1877
1874
let ( a_vec, b_vec, c_vec) = * elm;
1878
1875
let a = BigUint :: from_slice ( a_vec) ;
1879
1876
let b = BigUint :: from_slice ( b_vec) ;
@@ -1891,7 +1888,7 @@ mod biguint_tests {
1891
1888
a - b;
1892
1889
}
1893
1890
1894
- static MUL_TRIPLES : & ' static [ ( & ' static [ BigDigit ] ,
1891
+ static mul_triples : & ' static [ ( & ' static [ BigDigit ] ,
1895
1892
& ' static [ BigDigit ] ,
1896
1893
& ' static [ BigDigit ] ) ] = & [
1897
1894
( & [ ] , & [ ] , & [ ] ) ,
@@ -1917,7 +1914,7 @@ mod biguint_tests {
1917
1914
( & [ 0 , 0 , 1 ] , & [ 0 , 0 , 0 , 1 ] , & [ 0 , 0 , 0 , 0 , 0 , 1 ] )
1918
1915
] ;
1919
1916
1920
- static DIV_REM_QUADRUPLES : & ' static [ ( & ' static [ BigDigit ] ,
1917
+ static div_rem_quadruples : & ' static [ ( & ' static [ BigDigit ] ,
1921
1918
& ' static [ BigDigit ] ,
1922
1919
& ' static [ BigDigit ] ,
1923
1920
& ' static [ BigDigit ] ) ]
@@ -1931,7 +1928,7 @@ mod biguint_tests {
1931
1928
1932
1929
#[ test]
1933
1930
fn test_mul ( ) {
1934
- for elm in MUL_TRIPLES . iter ( ) {
1931
+ for elm in mul_triples . iter ( ) {
1935
1932
let ( a_vec, b_vec, c_vec) = * elm;
1936
1933
let a = BigUint :: from_slice ( a_vec) ;
1937
1934
let b = BigUint :: from_slice ( b_vec) ;
@@ -1941,7 +1938,7 @@ mod biguint_tests {
1941
1938
assert ! ( b * a == c) ;
1942
1939
}
1943
1940
1944
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
1941
+ for elm in div_rem_quadruples . iter ( ) {
1945
1942
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
1946
1943
let a = BigUint :: from_slice ( a_vec) ;
1947
1944
let b = BigUint :: from_slice ( b_vec) ;
@@ -1955,7 +1952,7 @@ mod biguint_tests {
1955
1952
1956
1953
#[ test]
1957
1954
fn test_div_rem ( ) {
1958
- for elm in MUL_TRIPLES . iter ( ) {
1955
+ for elm in mul_triples . iter ( ) {
1959
1956
let ( a_vec, b_vec, c_vec) = * elm;
1960
1957
let a = BigUint :: from_slice ( a_vec) ;
1961
1958
let b = BigUint :: from_slice ( b_vec) ;
@@ -1969,7 +1966,7 @@ mod biguint_tests {
1969
1966
}
1970
1967
}
1971
1968
1972
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
1969
+ for elm in div_rem_quadruples . iter ( ) {
1973
1970
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
1974
1971
let a = BigUint :: from_slice ( a_vec) ;
1975
1972
let b = BigUint :: from_slice ( b_vec) ;
@@ -1982,7 +1979,7 @@ mod biguint_tests {
1982
1979
1983
1980
#[ test]
1984
1981
fn test_checked_add ( ) {
1985
- for elm in SUM_TRIPLES . iter ( ) {
1982
+ for elm in sum_triples . iter ( ) {
1986
1983
let ( a_vec, b_vec, c_vec) = * elm;
1987
1984
let a = BigUint :: from_slice ( a_vec) ;
1988
1985
let b = BigUint :: from_slice ( b_vec) ;
@@ -1995,7 +1992,7 @@ mod biguint_tests {
1995
1992
1996
1993
#[ test]
1997
1994
fn test_checked_sub ( ) {
1998
- for elm in SUM_TRIPLES . iter ( ) {
1995
+ for elm in sum_triples . iter ( ) {
1999
1996
let ( a_vec, b_vec, c_vec) = * elm;
2000
1997
let a = BigUint :: from_slice ( a_vec) ;
2001
1998
let b = BigUint :: from_slice ( b_vec) ;
@@ -2015,7 +2012,7 @@ mod biguint_tests {
2015
2012
2016
2013
#[ test]
2017
2014
fn test_checked_mul ( ) {
2018
- for elm in MUL_TRIPLES . iter ( ) {
2015
+ for elm in mul_triples . iter ( ) {
2019
2016
let ( a_vec, b_vec, c_vec) = * elm;
2020
2017
let a = BigUint :: from_slice ( a_vec) ;
2021
2018
let b = BigUint :: from_slice ( b_vec) ;
@@ -2025,7 +2022,7 @@ mod biguint_tests {
2025
2022
assert ! ( b. checked_mul( & a) . unwrap( ) == c) ;
2026
2023
}
2027
2024
2028
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
2025
+ for elm in div_rem_quadruples . iter ( ) {
2029
2026
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
2030
2027
let a = BigUint :: from_slice ( a_vec) ;
2031
2028
let b = BigUint :: from_slice ( b_vec) ;
@@ -2039,7 +2036,7 @@ mod biguint_tests {
2039
2036
2040
2037
#[ test]
2041
2038
fn test_checked_div ( ) {
2042
- for elm in MUL_TRIPLES . iter ( ) {
2039
+ for elm in mul_triples . iter ( ) {
2043
2040
let ( a_vec, b_vec, c_vec) = * elm;
2044
2041
let a = BigUint :: from_slice ( a_vec) ;
2045
2042
let b = BigUint :: from_slice ( b_vec) ;
@@ -2443,7 +2440,7 @@ mod bigint_tests {
2443
2440
assert_eq ! ( negative. to_biguint( ) , None ) ;
2444
2441
}
2445
2442
2446
- static SUM_TRIPLES : & ' static [ ( & ' static [ BigDigit ] ,
2443
+ static sum_triples : & ' static [ ( & ' static [ BigDigit ] ,
2447
2444
& ' static [ BigDigit ] ,
2448
2445
& ' static [ BigDigit ] ) ] = & [
2449
2446
( & [ ] , & [ ] , & [ ] ) ,
@@ -2459,7 +2456,7 @@ mod bigint_tests {
2459
2456
2460
2457
#[ test]
2461
2458
fn test_add ( ) {
2462
- for elm in SUM_TRIPLES . iter ( ) {
2459
+ for elm in sum_triples . iter ( ) {
2463
2460
let ( a_vec, b_vec, c_vec) = * elm;
2464
2461
let a = BigInt :: from_slice ( Plus , a_vec) ;
2465
2462
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2478,7 +2475,7 @@ mod bigint_tests {
2478
2475
2479
2476
#[ test]
2480
2477
fn test_sub ( ) {
2481
- for elm in SUM_TRIPLES . iter ( ) {
2478
+ for elm in sum_triples . iter ( ) {
2482
2479
let ( a_vec, b_vec, c_vec) = * elm;
2483
2480
let a = BigInt :: from_slice ( Plus , a_vec) ;
2484
2481
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2495,7 +2492,7 @@ mod bigint_tests {
2495
2492
}
2496
2493
}
2497
2494
2498
- static MUL_TRIPLES : & ' static [ ( & ' static [ BigDigit ] ,
2495
+ static mul_triples : & ' static [ ( & ' static [ BigDigit ] ,
2499
2496
& ' static [ BigDigit ] ,
2500
2497
& ' static [ BigDigit ] ) ] = & [
2501
2498
( & [ ] , & [ ] , & [ ] ) ,
@@ -2521,7 +2518,7 @@ mod bigint_tests {
2521
2518
( & [ 0 , 0 , 1 ] , & [ 0 , 0 , 0 , 1 ] , & [ 0 , 0 , 0 , 0 , 0 , 1 ] )
2522
2519
] ;
2523
2520
2524
- static DIV_REM_QUADRUPLES : & ' static [ ( & ' static [ BigDigit ] ,
2521
+ static div_rem_quadruples : & ' static [ ( & ' static [ BigDigit ] ,
2525
2522
& ' static [ BigDigit ] ,
2526
2523
& ' static [ BigDigit ] ,
2527
2524
& ' static [ BigDigit ] ) ]
@@ -2535,7 +2532,7 @@ mod bigint_tests {
2535
2532
2536
2533
#[ test]
2537
2534
fn test_mul ( ) {
2538
- for elm in MUL_TRIPLES . iter ( ) {
2535
+ for elm in mul_triples . iter ( ) {
2539
2536
let ( a_vec, b_vec, c_vec) = * elm;
2540
2537
let a = BigInt :: from_slice ( Plus , a_vec) ;
2541
2538
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2548,7 +2545,7 @@ mod bigint_tests {
2548
2545
assert ! ( ( -b) * a == -c) ;
2549
2546
}
2550
2547
2551
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
2548
+ for elm in div_rem_quadruples . iter ( ) {
2552
2549
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
2553
2550
let a = BigInt :: from_slice ( Plus , a_vec) ;
2554
2551
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2587,7 +2584,7 @@ mod bigint_tests {
2587
2584
}
2588
2585
}
2589
2586
2590
- for elm in MUL_TRIPLES . iter ( ) {
2587
+ for elm in mul_triples . iter ( ) {
2591
2588
let ( a_vec, b_vec, c_vec) = * elm;
2592
2589
let a = BigInt :: from_slice ( Plus , a_vec) ;
2593
2590
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2597,7 +2594,7 @@ mod bigint_tests {
2597
2594
if !b. is_zero ( ) { check ( & c, & b, & a, & Zero :: zero ( ) ) ; }
2598
2595
}
2599
2596
2600
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
2597
+ for elm in div_rem_quadruples . iter ( ) {
2601
2598
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
2602
2599
let a = BigInt :: from_slice ( Plus , a_vec) ;
2603
2600
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2630,7 +2627,7 @@ mod bigint_tests {
2630
2627
check_sub ( & a. neg ( ) , b, & q. neg ( ) , & r. neg ( ) ) ;
2631
2628
check_sub ( & a. neg ( ) , & b. neg ( ) , q, & r. neg ( ) ) ;
2632
2629
}
2633
- for elm in MUL_TRIPLES . iter ( ) {
2630
+ for elm in mul_triples . iter ( ) {
2634
2631
let ( a_vec, b_vec, c_vec) = * elm;
2635
2632
let a = BigInt :: from_slice ( Plus , a_vec) ;
2636
2633
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2640,7 +2637,7 @@ mod bigint_tests {
2640
2637
if !b. is_zero ( ) { check ( & c, & b, & a, & Zero :: zero ( ) ) ; }
2641
2638
}
2642
2639
2643
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
2640
+ for elm in div_rem_quadruples . iter ( ) {
2644
2641
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
2645
2642
let a = BigInt :: from_slice ( Plus , a_vec) ;
2646
2643
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2655,7 +2652,7 @@ mod bigint_tests {
2655
2652
2656
2653
#[ test]
2657
2654
fn test_checked_add ( ) {
2658
- for elm in SUM_TRIPLES . iter ( ) {
2655
+ for elm in sum_triples . iter ( ) {
2659
2656
let ( a_vec, b_vec, c_vec) = * elm;
2660
2657
let a = BigInt :: from_slice ( Plus , a_vec) ;
2661
2658
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2674,7 +2671,7 @@ mod bigint_tests {
2674
2671
2675
2672
#[ test]
2676
2673
fn test_checked_sub ( ) {
2677
- for elm in SUM_TRIPLES . iter ( ) {
2674
+ for elm in sum_triples . iter ( ) {
2678
2675
let ( a_vec, b_vec, c_vec) = * elm;
2679
2676
let a = BigInt :: from_slice ( Plus , a_vec) ;
2680
2677
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2693,7 +2690,7 @@ mod bigint_tests {
2693
2690
2694
2691
#[ test]
2695
2692
fn test_checked_mul ( ) {
2696
- for elm in MUL_TRIPLES . iter ( ) {
2693
+ for elm in mul_triples . iter ( ) {
2697
2694
let ( a_vec, b_vec, c_vec) = * elm;
2698
2695
let a = BigInt :: from_slice ( Plus , a_vec) ;
2699
2696
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2706,7 +2703,7 @@ mod bigint_tests {
2706
2703
assert ! ( ( -b) . checked_mul( & a) . unwrap( ) == -c) ;
2707
2704
}
2708
2705
2709
- for elm in DIV_REM_QUADRUPLES . iter ( ) {
2706
+ for elm in div_rem_quadruples . iter ( ) {
2710
2707
let ( a_vec, b_vec, c_vec, d_vec) = * elm;
2711
2708
let a = BigInt :: from_slice ( Plus , a_vec) ;
2712
2709
let b = BigInt :: from_slice ( Plus , b_vec) ;
@@ -2719,7 +2716,7 @@ mod bigint_tests {
2719
2716
}
2720
2717
#[ test]
2721
2718
fn test_checked_div ( ) {
2722
- for elm in MUL_TRIPLES . iter ( ) {
2719
+ for elm in mul_triples . iter ( ) {
2723
2720
let ( a_vec, b_vec, c_vec) = * elm;
2724
2721
let a = BigInt :: from_slice ( Plus , a_vec) ;
2725
2722
let b = BigInt :: from_slice ( Plus , b_vec) ;
0 commit comments