Include DivMod() method
#103
Assignees
Comments
chfast
added a commit
that referenced
this issue
Mar 22, 2022
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.
Merged
chfast
added a commit
that referenced
this issue
Mar 25, 2022
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.
chfast
added a commit
that referenced
this issue
Mar 25, 2022
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.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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: