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
DivMod() sets z to the quotient x div y and m to the modulus x mod y
and returns the pair (z, m) for y != 0.
If y == 0, both z and m are set to 0 (OBS: differs from the big.Int).
Closes#103.
DivMod() sets z to the quotient x div y and m to the modulus x mod y
and returns the pair (z, m) for y != 0.
If y == 0, both z and m are set to 0 (OBS: differs from the big.Int).
Closes#103.
DivMod() sets z to the quotient x div y and m to the modulus x mod y
and returns the pair (z, m) for y != 0.
If y == 0, both z and m are set to 0 (OBS: differs from the big.Int).
Closes#103.
We have started using https://github.com/holiman/uint256 at https://github.com/stellar/go and we are missing the
DivMod()
method.This has required invoking
Div()
andMod()
separately, which isn't great for performance.The text was updated successfully, but these errors were encountered: