xeos
/
num-traits
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

comment corrected 

referenced a,b, which aren't defined
changed to n,m
This commit is contained in:
Emerentius 2015-09-07 16:50:58 +02:00
parent e892054813
commit 82a6ab2f30
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
src/integer.rs
View File

@ -230,7 +230,7 @@ macro_rules! impl_integer_for_isize {
// trivially be calculated in that case by bitshifting // trivially be calculated in that case by bitshifting
// The result is always positive in two's complement, unless // The result is always positive in two's complement, unless
// a and b are the minimum value, then it's negative // n and m are the minimum value, then it's negative
// no other way to represent that number // no other way to represent that number
if m == <$T>::min_value() || n == <$T>::min_value() { return 1 << shift } if m == <$T>::min_value() || n == <$T>::min_value() { return 1 << shift }
@ -238,7 +238,7 @@ macro_rules! impl_integer_for_isize {
m = m.abs(); m = m.abs();
n = n.abs(); n = n.abs();
// divide a and b by 2 until odd // divide n and m by 2 until odd
// m inside loop // m inside loop
n >>= n.trailing_zeros(); n >>= n.trailing_zeros();
@ -427,7 +427,7 @@ macro_rules! impl_integer_for_usize {
// find common factors of 2 // find common factors of 2
let shift = (m | n).trailing_zeros(); let shift = (m | n).trailing_zeros();
// divide a and b by 2 until odd // divide n and m by 2 until odd
// m inside loop // m inside loop
n >>= n.trailing_zeros(); n >>= n.trailing_zeros();