|
10 | 10 |
|
11 | 11 | //! An interface for numeric types
|
12 | 12 | use cmp::{Eq, Ord};
|
13 |
| -#[cfg(stage0)] |
14 |
| -use ops::{Add, Sub, Mul, Neg}; |
15 |
| -#[cfg(stage0)] |
16 |
| -use Quot = ops::Div; |
17 |
| -#[cfg(stage0)] |
18 |
| -use Rem = ops::Modulo; |
19 |
| -#[cfg(not(stage0))] |
20 | 13 | use ops::{Add, Sub, Mul, Quot, Rem, Neg};
|
21 | 14 | use ops::{Not, BitAnd, BitOr, BitXor, Shl, Shr};
|
22 | 15 | use option::Option;
|
@@ -391,25 +384,8 @@ pub fn pow_with_uint<T:NumCast+One+Zero+Copy+Quot<T,T>+Mul<T,T>>(
|
391 | 384 | total
|
392 | 385 | }
|
393 | 386 |
|
394 |
| -/// Helper function for testing numeric operations |
395 |
| -#[cfg(stage0,test)] |
396 |
| -pub fn test_num<T:Num + NumCast>(ten: T, two: T) { |
397 |
| - assert_eq!(ten.add(&two), cast(12)); |
398 |
| - assert_eq!(ten.sub(&two), cast(8)); |
399 |
| - assert_eq!(ten.mul(&two), cast(20)); |
400 |
| - assert_eq!(ten.div(&two), cast(5)); |
401 |
| - assert_eq!(ten.modulo(&two), cast(0)); |
402 |
| - |
403 |
| - assert_eq!(ten.add(&two), ten + two); |
404 |
| - assert_eq!(ten.sub(&two), ten - two); |
405 |
| - assert_eq!(ten.mul(&two), ten * two); |
406 |
| - assert_eq!(ten.div(&two), ten / two); |
407 |
| - assert_eq!(ten.modulo(&two), ten % two); |
408 |
| -} |
409 |
| -#[cfg(stage1,test)] |
410 |
| -#[cfg(stage2,test)] |
411 |
| -#[cfg(stage3,test)] |
412 |
| -pub fn test_num<T:Num + NumCast>(ten: T, two: T) { |
| 387 | +#[cfg(test)] |
| 388 | +fn test_num<T:Num + NumCast>(ten: T, two: T) { |
413 | 389 | assert_eq!(ten.add(&two), cast(12));
|
414 | 390 | assert_eq!(ten.sub(&two), cast(8));
|
415 | 391 | assert_eq!(ten.mul(&two), cast(20));
|
|
0 commit comments