bv-sized 1.0.6 → 1.0.7
raw patch · 3 files changed
+9/−15 lines, 3 filesdep ~parameterized-utilsnew-uploaderPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: parameterized-utils
API changes (from Hackage documentation)
- Data.BitVector.Sized: abs :: 1 <= w => NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: abs :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: add :: NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: add :: forall (w :: Nat). NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: and :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: and :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: asBitsBE :: NatRepr w -> BV w -> [Bool]
+ Data.BitVector.Sized: asBitsBE :: forall (w :: Nat). NatRepr w -> BV w -> [Bool]
- Data.BitVector.Sized: asBitsLE :: NatRepr w -> BV w -> [Bool]
+ Data.BitVector.Sized: asBitsLE :: forall (w :: Nat). NatRepr w -> BV w -> [Bool]
- Data.BitVector.Sized: asBytesBE :: NatRepr w -> BV w -> Maybe [Word8]
+ Data.BitVector.Sized: asBytesBE :: forall (w :: Nat). NatRepr w -> BV w -> Maybe [Word8]
- Data.BitVector.Sized: asBytesLE :: NatRepr w -> BV w -> Maybe [Word8]
+ Data.BitVector.Sized: asBytesLE :: forall (w :: Nat). NatRepr w -> BV w -> Maybe [Word8]
- Data.BitVector.Sized: asBytestringBE :: NatRepr w -> BV w -> Maybe ByteString
+ Data.BitVector.Sized: asBytestringBE :: forall (w :: Nat). NatRepr w -> BV w -> Maybe ByteString
- Data.BitVector.Sized: asBytestringLE :: NatRepr w -> BV w -> Maybe ByteString
+ Data.BitVector.Sized: asBytestringLE :: forall (w :: Nat). NatRepr w -> BV w -> Maybe ByteString
- Data.BitVector.Sized: asNatural :: BV w -> Natural
+ Data.BitVector.Sized: asNatural :: forall (w :: Nat). BV w -> Natural
- Data.BitVector.Sized: asSigned :: 1 <= w => NatRepr w -> BV w -> Integer
+ Data.BitVector.Sized: asSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> Integer
- Data.BitVector.Sized: asUnsigned :: BV w -> Integer
+ Data.BitVector.Sized: asUnsigned :: forall (w :: Nat). BV w -> Integer
- Data.BitVector.Sized: ashr :: 1 <= w => NatRepr w -> BV w -> Natural -> BV w
+ Data.BitVector.Sized: ashr :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> Natural -> BV w
- Data.BitVector.Sized: bit :: (ix + 1) <= w => NatRepr w -> NatRepr ix -> BV w
+ Data.BitVector.Sized: bit :: forall (ix :: Natural) (w :: Natural). (ix + 1) <= w => NatRepr w -> NatRepr ix -> BV w
- Data.BitVector.Sized: bit' :: NatRepr w -> Natural -> BV w
+ Data.BitVector.Sized: bit' :: forall (w :: Nat). NatRepr w -> Natural -> BV w
- Data.BitVector.Sized: clearBit :: (ix + 1) <= w => NatRepr w -> NatRepr ix -> BV w -> BV w
+ Data.BitVector.Sized: clearBit :: forall (ix :: Natural) (w :: Natural). (ix + 1) <= w => NatRepr w -> NatRepr ix -> BV w -> BV w
- Data.BitVector.Sized: clearBit' :: NatRepr w -> Natural -> BV w -> BV w
+ Data.BitVector.Sized: clearBit' :: forall (w :: Nat). NatRepr w -> Natural -> BV w -> BV w
- Data.BitVector.Sized: clz :: NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: clz :: forall (w :: Nat). NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: complement :: NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: complement :: forall (w :: Nat). NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: complementBit :: (ix + 1) <= w => NatRepr ix -> BV w -> BV w
+ Data.BitVector.Sized: complementBit :: forall (ix :: Natural) (w :: Natural). (ix + 1) <= w => NatRepr ix -> BV w -> BV w
- Data.BitVector.Sized: complementBit' :: NatRepr w -> Natural -> BV w -> BV w
+ Data.BitVector.Sized: complementBit' :: forall (w :: Nat). NatRepr w -> Natural -> BV w -> BV w
- Data.BitVector.Sized: concat :: NatRepr w -> NatRepr w' -> BV w -> BV w' -> BV (w + w')
+ Data.BitVector.Sized: concat :: forall (w :: Nat) (w' :: Nat). NatRepr w -> NatRepr w' -> BV w -> BV w' -> BV (w + w')
- Data.BitVector.Sized: ctz :: NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: ctz :: forall (w :: Nat). NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: data BV (w :: Nat) :: Type
+ Data.BitVector.Sized: data BV (w :: Nat)
- Data.BitVector.Sized: data () => NatRepr (n :: Nat)
+ Data.BitVector.Sized: data NatRepr (n :: Nat)
- Data.BitVector.Sized: enumFromToSigned :: 1 <= w => NatRepr w -> BV w -> BV w -> [BV w]
+ Data.BitVector.Sized: enumFromToSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> [BV w]
- Data.BitVector.Sized: enumFromToUnsigned :: BV w -> BV w -> [BV w]
+ Data.BitVector.Sized: enumFromToUnsigned :: forall (w :: Nat). BV w -> BV w -> [BV w]
- Data.BitVector.Sized: lshr :: NatRepr w -> BV w -> Natural -> BV w
+ Data.BitVector.Sized: lshr :: forall (w :: Nat). NatRepr w -> BV w -> Natural -> BV w
- Data.BitVector.Sized: maxSigned :: 1 <= w => NatRepr w -> BV w
+ Data.BitVector.Sized: maxSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w
- Data.BitVector.Sized: maxUnsigned :: NatRepr w -> BV w
+ Data.BitVector.Sized: maxUnsigned :: forall (w :: Nat). NatRepr w -> BV w
- Data.BitVector.Sized: minSigned :: 1 <= w => NatRepr w -> BV w
+ Data.BitVector.Sized: minSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w
- Data.BitVector.Sized: minUnsigned :: NatRepr w -> BV w
+ Data.BitVector.Sized: minUnsigned :: forall (w :: Nat). NatRepr w -> BV w
- Data.BitVector.Sized: mkBV :: NatRepr w -> Integer -> BV w
+ Data.BitVector.Sized: mkBV :: forall (w :: Nat). NatRepr w -> Integer -> BV w
- Data.BitVector.Sized: mkBVSigned :: 1 <= w => NatRepr w -> Integer -> Maybe (BV w)
+ Data.BitVector.Sized: mkBVSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> Integer -> Maybe (BV w)
- Data.BitVector.Sized: mkBVUnsigned :: NatRepr w -> Integer -> Maybe (BV w)
+ Data.BitVector.Sized: mkBVUnsigned :: forall (w :: Nat). NatRepr w -> Integer -> Maybe (BV w)
- Data.BitVector.Sized: mul :: NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: mul :: forall (w :: Nat). NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: mulWide :: NatRepr w -> NatRepr w' -> BV w -> BV w' -> BV (w + w')
+ Data.BitVector.Sized: mulWide :: forall (w :: Nat) (w' :: Nat). NatRepr w -> NatRepr w' -> BV w -> BV w' -> BV (w + w')
- Data.BitVector.Sized: negate :: NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: negate :: forall (w :: Nat). NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: one :: 1 <= w => NatRepr w -> BV w
+ Data.BitVector.Sized: one :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w
- Data.BitVector.Sized: or :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: or :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: popCount :: BV w -> BV w
+ Data.BitVector.Sized: popCount :: forall (w :: Nat). BV w -> BV w
- Data.BitVector.Sized: ppBin :: NatRepr w -> BV w -> String
+ Data.BitVector.Sized: ppBin :: forall (w :: Nat). NatRepr w -> BV w -> String
- Data.BitVector.Sized: ppDec :: NatRepr w -> BV w -> String
+ Data.BitVector.Sized: ppDec :: forall (w :: Nat). NatRepr w -> BV w -> String
- Data.BitVector.Sized: ppHex :: NatRepr w -> BV w -> String
+ Data.BitVector.Sized: ppHex :: forall (w :: Nat). NatRepr w -> BV w -> String
- Data.BitVector.Sized: ppOct :: NatRepr w -> BV w -> String
+ Data.BitVector.Sized: ppOct :: forall (w :: Nat). NatRepr w -> BV w -> String
- Data.BitVector.Sized: predSigned :: 1 <= w => NatRepr w -> BV w -> Maybe (BV w)
+ Data.BitVector.Sized: predSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> Maybe (BV w)
- Data.BitVector.Sized: predUnsigned :: NatRepr w -> BV w -> Maybe (BV w)
+ Data.BitVector.Sized: predUnsigned :: forall (w :: Nat). NatRepr w -> BV w -> Maybe (BV w)
- Data.BitVector.Sized: rotateL :: NatRepr w -> BV w -> Natural -> BV w
+ Data.BitVector.Sized: rotateL :: forall (w :: Nat). NatRepr w -> BV w -> Natural -> BV w
- Data.BitVector.Sized: rotateR :: NatRepr w -> BV w -> Natural -> BV w
+ Data.BitVector.Sized: rotateR :: forall (w :: Nat). NatRepr w -> BV w -> Natural -> BV w
- Data.BitVector.Sized: sUniformRM :: (StatefulGen g m, 1 <= w) => NatRepr w -> (BV w, BV w) -> g -> m (BV w)
+ Data.BitVector.Sized: sUniformRM :: forall g m (w :: Natural). (StatefulGen g m, 1 <= w) => NatRepr w -> (BV w, BV w) -> g -> m (BV w)
- Data.BitVector.Sized: sdiv :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: sdiv :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: sdivMod :: 1 <= w => NatRepr w -> BV w -> BV w -> (BV w, BV w)
+ Data.BitVector.Sized: sdivMod :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> (BV w, BV w)
- Data.BitVector.Sized: select :: (ix + w') <= w => NatRepr ix -> NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: select :: forall (ix :: Natural) (w' :: Natural) (w :: Natural). (ix + w') <= w => NatRepr ix -> NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: select' :: Natural -> NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: select' :: forall (w' :: Nat) (w :: Nat). Natural -> NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: setBit :: (ix + 1) <= w => NatRepr ix -> BV w -> BV w
+ Data.BitVector.Sized: setBit :: forall (ix :: Natural) (w :: Natural). (ix + 1) <= w => NatRepr ix -> BV w -> BV w
- Data.BitVector.Sized: setBit' :: NatRepr w -> Natural -> BV w -> BV w
+ Data.BitVector.Sized: setBit' :: forall (w :: Nat). NatRepr w -> Natural -> BV w -> BV w
- Data.BitVector.Sized: sext :: (1 <= w, (w + 1) <= w') => NatRepr w -> NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: sext :: forall (w :: Natural) (w' :: Natural). (1 <= w, (w + 1) <= w') => NatRepr w -> NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: shl :: NatRepr w -> BV w -> Natural -> BV w
+ Data.BitVector.Sized: shl :: forall (w :: Nat). NatRepr w -> BV w -> Natural -> BV w
- Data.BitVector.Sized: signBit :: 1 <= w => NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: signBit :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: signedClamp :: 1 <= w => NatRepr w -> Integer -> BV w
+ Data.BitVector.Sized: signedClamp :: forall (w :: Natural). 1 <= w => NatRepr w -> Integer -> BV w
- Data.BitVector.Sized: signum :: 1 <= w => NatRepr w -> BV w -> BV w
+ Data.BitVector.Sized: signum :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w
- Data.BitVector.Sized: sle :: 1 <= w => NatRepr w -> BV w -> BV w -> Bool
+ Data.BitVector.Sized: sle :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Bool
- Data.BitVector.Sized: slt :: 1 <= w => NatRepr w -> BV w -> BV w -> Bool
+ Data.BitVector.Sized: slt :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Bool
- Data.BitVector.Sized: smax :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: smax :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: smin :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: smin :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: smod :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: smod :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: squot :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: squot :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: squotRem :: 1 <= w => NatRepr w -> BV w -> BV w -> (BV w, BV w)
+ Data.BitVector.Sized: squotRem :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> (BV w, BV w)
- Data.BitVector.Sized: srem :: 1 <= w => NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: srem :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: sresize :: 1 <= w => NatRepr w -> NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: sresize :: forall (w :: Natural) (w' :: Nat). 1 <= w => NatRepr w -> NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: sub :: NatRepr w -> BV w -> BV w -> BV w
+ Data.BitVector.Sized: sub :: forall (w :: Nat). NatRepr w -> BV w -> BV w -> BV w
- Data.BitVector.Sized: succSigned :: 1 <= w => NatRepr w -> BV w -> Maybe (BV w)
+ Data.BitVector.Sized: succSigned :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> Maybe (BV w)
- Data.BitVector.Sized: succUnsigned :: NatRepr w -> BV w -> Maybe (BV w)
+ Data.BitVector.Sized: succUnsigned :: forall (w :: Nat). NatRepr w -> BV w -> Maybe (BV w)
- Data.BitVector.Sized: testBit :: (ix + 1) <= w => NatRepr ix -> BV w -> Bool
+ Data.BitVector.Sized: testBit :: forall (ix :: Natural) (w :: Natural). (ix + 1) <= w => NatRepr ix -> BV w -> Bool
- Data.BitVector.Sized: testBit' :: Natural -> BV w -> Bool
+ Data.BitVector.Sized: testBit' :: forall (w :: Nat). Natural -> BV w -> Bool
- Data.BitVector.Sized: trunc :: (w' + 1) <= w => NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: trunc :: forall (w' :: Natural) (w :: Natural). (w' + 1) <= w => NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: trunc' :: NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: trunc' :: forall (w' :: Nat) (w :: Nat). NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: truncBits :: Natural -> BV w -> BV w
+ Data.BitVector.Sized: truncBits :: forall (w :: Nat). Natural -> BV w -> BV w
- Data.BitVector.Sized: uUniformRM :: StatefulGen g m => (BV w, BV w) -> g -> m (BV w)
+ Data.BitVector.Sized: uUniformRM :: forall g m (w :: Nat). StatefulGen g m => (BV w, BV w) -> g -> m (BV w)
- Data.BitVector.Sized: ule :: BV w -> BV w -> Bool
+ Data.BitVector.Sized: ule :: forall (w :: Nat). BV w -> BV w -> Bool
- Data.BitVector.Sized: ult :: BV w -> BV w -> Bool
+ Data.BitVector.Sized: ult :: forall (w :: Nat). BV w -> BV w -> Bool
- Data.BitVector.Sized: umax :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: umax :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: umin :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: umin :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: uniformM :: StatefulGen g m => NatRepr w -> g -> m (BV w)
+ Data.BitVector.Sized: uniformM :: forall g m (w :: Nat). StatefulGen g m => NatRepr w -> g -> m (BV w)
- Data.BitVector.Sized: unsignedClamp :: NatRepr w -> Integer -> BV w
+ Data.BitVector.Sized: unsignedClamp :: forall (w :: Nat). NatRepr w -> Integer -> BV w
- Data.BitVector.Sized: uquot :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: uquot :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: uquotRem :: BV w -> BV w -> (BV w, BV w)
+ Data.BitVector.Sized: uquotRem :: forall (w :: Nat). BV w -> BV w -> (BV w, BV w)
- Data.BitVector.Sized: urem :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: urem :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: width :: NatRepr w -> BV w
+ Data.BitVector.Sized: width :: forall (w :: Nat). NatRepr w -> BV w
- Data.BitVector.Sized: xor :: BV w -> BV w -> BV w
+ Data.BitVector.Sized: xor :: forall (w :: Nat). BV w -> BV w -> BV w
- Data.BitVector.Sized: zero :: NatRepr w -> BV w
+ Data.BitVector.Sized: zero :: forall (w :: Nat). NatRepr w -> BV w
- Data.BitVector.Sized: zext :: (w + 1) <= w' => NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: zext :: forall (w :: Natural) (w' :: Natural). (w + 1) <= w' => NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized: zresize :: NatRepr w' -> BV w -> BV w'
+ Data.BitVector.Sized: zresize :: forall (w' :: Nat) (w :: Nat). NatRepr w' -> BV w -> BV w'
- Data.BitVector.Sized.Overflow: addOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: addOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: mulOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: mulOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: sdivOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: sdivOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: shlOf :: 1 <= w => NatRepr w -> BV w -> Natural -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: shlOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> Natural -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: smodOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: smodOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: squotOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: squotOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: sremOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: sremOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Overflow: subOf :: 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
+ Data.BitVector.Sized.Overflow: subOf :: forall (w :: Natural). 1 <= w => NatRepr w -> BV w -> BV w -> Overflow (BV w)
- Data.BitVector.Sized.Signed: SignedBV :: BV w -> SignedBV w
+ Data.BitVector.Sized.Signed: SignedBV :: BV w -> SignedBV (w :: Nat)
- Data.BitVector.Sized.Signed: [asBV] :: SignedBV w -> BV w
+ Data.BitVector.Sized.Signed: [asBV] :: SignedBV (w :: Nat) -> BV w
- Data.BitVector.Sized.Signed: mkSignedBV :: NatRepr w -> Integer -> SignedBV w
+ Data.BitVector.Sized.Signed: mkSignedBV :: forall (w :: Nat). NatRepr w -> Integer -> SignedBV w
- Data.BitVector.Sized.Signed: newtype SignedBV w
+ Data.BitVector.Sized.Signed: newtype SignedBV (w :: Nat)
- Data.BitVector.Sized.Unsigned: UnsignedBV :: BV w -> UnsignedBV w
+ Data.BitVector.Sized.Unsigned: UnsignedBV :: BV w -> UnsignedBV (w :: Nat)
- Data.BitVector.Sized.Unsigned: [asBV] :: UnsignedBV w -> BV w
+ Data.BitVector.Sized.Unsigned: [asBV] :: UnsignedBV (w :: Nat) -> BV w
- Data.BitVector.Sized.Unsigned: mkUnsignedBV :: NatRepr w -> Integer -> UnsignedBV w
+ Data.BitVector.Sized.Unsigned: mkUnsignedBV :: forall (w :: Nat). NatRepr w -> Integer -> UnsignedBV w
- Data.BitVector.Sized.Unsigned: newtype UnsignedBV w
+ Data.BitVector.Sized.Unsigned: newtype UnsignedBV (w :: Nat)
Files
- README.md +3/−13
- bv-sized.cabal +2/−2
- changelog.md +4/−0
README.md view
@@ -1,14 +1,4 @@-[](https://travis-ci.org/GaloisInc/bv-sized)--bv-sized - A Haskell library for manipulating width-parameterized bitvectors-===--copyright (c) Ben Selfridge, Galois Inc. 2018--This library defines a bitvector datatype that is parameterized by the-vector width.--Other information-===+# bv-sized -* contact: benselfridge@galois.com+This library defines a bitvector datatype that is parameterized by the bit+width.
bv-sized.cabal view
@@ -1,5 +1,5 @@ name: bv-sized-version: 1.0.6+version: 1.0.7 category: Bit Vectors synopsis: a bitvector datatype that is parameterized by the vector width description:@@ -31,7 +31,7 @@ bytestring >= 0.10 && < 0.13, deepseq >= 1.4.0 && < 1.6, panic >= 0.4.0 && < 0.5,- parameterized-utils >= 2.0.2 && < 2.2,+ parameterized-utils >= 2.0.2 && < 2.3, random >= 1.2.0 && < 1.4, th-lift >= 0.8.1 && < 0.9 hs-source-dirs: src
changelog.md view
@@ -1,5 +1,9 @@ # Changelog for [`bv-sized` package](http://hackage.haskell.org/package/bv-sized) +## 1.0.7 -- 2026-01-24++* Support building with `parameterized-utils` 2.2.*+ ## 1.0.6 *March 2025* * Support building with `random-1.3.*`