[GHC] #7689: Primitive bitwise operations on Int#
GHC
cvs-ghc at haskell.org
Thu Feb 14 12:58:16 CET 2013
#7689: Primitive bitwise operations on Int#
-----------------------------+----------------------------------------------
Reporter: jstolarek | Owner:
Type: feature request | Status: new
Priority: normal | Component: Compiler
Version: 7.7 | Keywords:
Os: Unknown/Multiple | Architecture: Unknown/Multiple
Failure: None/Unknown | Blockedby:
Blocking: | Related:
-----------------------------+----------------------------------------------
During recent work I found a need for primitive bitwise operations that
work on `Int#` type. Currently existing `and#`, `or#`, `not#` and `xor#`
!PrimOps work on `Word#`, which requires writing explicit conversions
using `int2Word#` and `word2Int#`. It would be most helpful to have
equivalent `andI#`, `orI#`, `notI#` and `xorI#` !PrimOps.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/7689>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
More information about the ghc-tickets
mailing list