Safe Haskell | None |
---|---|
Language | Haskell2010 |
Datatypes
A vector of bits.
- Bit indices are descending
Num
instance performs unsigned arithmetic.
Resize BitVector | |
KnownNat n => Bounded (BitVector n) | |
KnownNat n => Enum (BitVector n) | The functions: |
Eq (BitVector n) | |
KnownNat n => Integral (BitVector n) | |
KnownNat n => Num (BitVector n) | |
Ord (BitVector n) | |
KnownNat n => Real (BitVector n) | |
KnownNat n => Show (BitVector n) | |
KnownNat n => Bits (BitVector n) | |
KnownNat n => FiniteBits (BitVector n) | |
KnownNat n => Default (BitVector n) | |
KnownNat n => Lift (BitVector n) | |
(KnownNat n, KnownNat ((+) n 1), KnownNat ((+) n n)) => SaturatingNum (BitVector n) | |
BitPack (BitVector n) | |
Bundle (BitVector n) | |
(KnownNat ((+) (Max m n) 1), KnownNat ((+) m n)) => ExtendingNum (BitVector m) (BitVector n) | |
Typeable (Nat -> *) BitVector | |
type Unbundled clk (BitVector n) = CSignal clk (BitVector n) | |
type BitSize (BitVector n) = n | |
type AResult (BitVector m) (BitVector n) = BitVector ((+) (Max m n) 1) | |
type MResult (BitVector m) (BitVector n) = BitVector ((+) m n) |
Accessors
Length information
Construction
Initialisation
bLit :: KnownNat n => String -> Q (TExp (BitVector n)) Source
Create a binary literal
>>>
$$(bLit "1001") :: BitVector 4
1001>>>
$$(bLit "1001") :: BitVector 3
001
NB: Will be removed once GHC 7.10 is released which has support for binary literals. Once GHC 7.10 is released you can just write:
>>>
0b1001 :: BitVector 4
1001