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