diff options
Diffstat (limited to 'libraries/ghc-prim/GHC/Classes.hs')
| -rw-r--r-- | libraries/ghc-prim/GHC/Classes.hs | 3 |
1 files changed, 0 insertions, 3 deletions
diff --git a/libraries/ghc-prim/GHC/Classes.hs b/libraries/ghc-prim/GHC/Classes.hs index 13e9556864..aa1c1b2d8b 100644 --- a/libraries/ghc-prim/GHC/Classes.hs +++ b/libraries/ghc-prim/GHC/Classes.hs @@ -587,7 +587,6 @@ x# `divInt32#` y# = ((x# `plusInt32#` bias#) `quotInt32#` y#) `subInt32#` hard# -- Note [divInt# implementation] -- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ --- -- divInt# (truncated toward zero) is implemented with quotInt# (truncated -- toward negative infinity). They differ when inputs x and y have different signs: -- - x `rem` y has the sign of x and (x `quot` y)*y + (x `rem` y) == x @@ -705,7 +704,6 @@ x# `modInt32#` y# = r# `plusInt32#` k# -- Note [modInt# implementation] -- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ --- -- Similarly to divInt# (see Note [divInt# implementation]), we can derive the -- branchless implementation of modInt# as follows: -- @@ -823,7 +821,6 @@ x# `divModInt32#` y# = case (x# `plusInt32#` bias#) `quotRemInt32#` y# of -- Note [divModInt# implementation] -- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ --- -- divModInt# is written by deriving the following code similarly to divInt# and -- modInt# (see Note [divInt# implementation] and Note [modInt# -- implementation]). |