diff options
| author | Sylvain Henry <sylvain@haskus.fr> | 2019-08-21 15:59:53 +0200 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2019-08-22 09:25:47 -0400 |
| commit | a33bad2db8baccdf1d8f7c40bac7039c949c8190 (patch) | |
| tree | d76bbd613853738a8ccb4b2fd74c272004d7abe8 | |
| parent | d505524857e4a4901c8972afd17eb4ea346d1234 (diff) | |
| download | haskell-a33bad2db8baccdf1d8f7c40bac7039c949c8190.tar.gz | |
Doc: add Haddocks for quotRemWord2 primop
| -rw-r--r-- | compiler/prelude/primops.txt.pp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/compiler/prelude/primops.txt.pp b/compiler/prelude/primops.txt.pp index 1e87a00902..47a78e2c8d 100644 --- a/compiler/prelude/primops.txt.pp +++ b/compiler/prelude/primops.txt.pp @@ -590,10 +590,10 @@ primop WordQuotRemOp "quotRemWord#" GenPrimOp Word# -> Word# -> (# Word#, Word# #) with can_fail = True --- Takes high word of dividend, then low word of dividend, then divisor. --- Requires that high word is not divisible by divisor. primop WordQuotRem2Op "quotRemWord2#" GenPrimOp Word# -> Word# -> Word# -> (# Word#, Word# #) + { Takes high word of dividend, then low word of dividend, then divisor. + Requires that high word < divisor.} with can_fail = True primop AndOp "and#" Dyadic Word# -> Word# -> Word# |