Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Find the number of occurences of the bit 0
in the prefix of the supplied bitstring of the given length
>>>
import HaskellWorks.Data.Bits.BitRead
>>>
:set -XTypeApplications
>>>
rank0 (unsafeBitRead @Word8 "11111111") 4
0>>>
rank0 (unsafeBitRead @Word8 "00111111") 4
2>>>
rank0 (unsafeBitRead @Word8 "10011111") 4
2>>>
rank0 (unsafeBitRead @Word8 "10011001") 4
2>>>
rank0 (unsafeBitRead @Word8 "10011001") 6
3
Instances
Rank0 Word8 Source # | |
Rank0 Word16 Source # | |
Rank0 Word32 Source # | |
Rank0 Word64 Source # | |
Rank0 [Bool] Source # | |
Rank0 [Word8] Source # | |
Rank0 [Word16] Source # | |
Rank0 [Word32] Source # | |
Rank0 [Word64] Source # | |
Rank0 (Vector Bit) Source # | |
Rank0 (Vector Bit) Source # | |
Rank0 a => Rank0 (BitShown a) Source # | |
Rank0 (Vector Word8) Source # | |
Rank0 (Vector Word16) Source # | |
Rank0 (Vector Word32) Source # | |
Rank0 (Vector Word64) Source # | |
Rank0 (Vector Word8) Source # | |
Rank0 (Vector Word16) Source # | |
Rank0 (Vector Word32) Source # | |
Rank0 (Vector Word64) Source # | |