You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I see we have floor division and the corresponding modulo operations via the Integer trait. However methods for the subtly different Euclidean division and modulo operations were added to the core Rust primitives in RFC 2169 and it might be good to have them on BigInt for consistency. (If I have missed the implementation, please let me know. I am fairly new to Rust.)
The text was updated successfully, but these errors were encountered:
245: Implement Euclid division and remainder r=cuviper a=jaybosamiya
Now that a common trait for this has been sorted out (rust-num/num-traits#159 implemented and merged in rust-num/num-traits#195), we can now close#146 by implementing the trait for `BigInt`s. This commit does just that.
Co-authored-by: Jay Bosamiya <[email protected]>
Co-authored-by: Josh Stone <[email protected]>
I see we have floor division and the corresponding modulo operations via the Integer trait. However methods for the subtly different Euclidean division and modulo operations were added to the core Rust primitives in RFC 2169 and it might be good to have them on BigInt for consistency. (If I have missed the implementation, please let me know. I am fairly new to Rust.)
The text was updated successfully, but these errors were encountered: