On Tuesday 29 January 2013, 03:27:41, Artyom Kazak wrote:
Hi!
I’ve always thought that `quotRem` is faster than `quot` + `rem`, since
both `quot` and `rem` are just wrappers that compute both the quotient
and the remainder and then just throw one out. However, today I looked
into the
Shachaf Ben-Kiki shac...@gmail.com писал(а) в своём письме Tue, 29 Jan
2013 09:09:37 +0300:
That code is from base 4.5. Here's base 4.6:
quotRem x@(I32# x#) y@(I32# y#)
| y == 0 = divZeroError
-- Note [Order of tests]
| y == (-1) x ==
Hi!
I’ve always thought that `quotRem` is faster than `quot` + `rem`, since
both `quot` and `rem` are just wrappers that compute both the quotient
and the remainder and then just throw one out. However, today I looked
into the implementation of `quotRem` for `Int32` and found out that it’s
On Mon, Jan 28, 2013 at 4:27 PM, Artyom Kazak artyom.ka...@gmail.com wrote:
Hi!
I’ve always thought that `quotRem` is faster than `quot` + `rem`, since both
`quot` and `rem` are just wrappers that compute both the quotient and the
remainder and then just throw one out. However, today I looked