Safe Haskell	None
Language	Haskell2010

Crypto.Math.Bits

Synopsis

data FBits (n :: Nat ) = FBits {
- unFBits :: Natural
}
data FBitsK = FBitsK ( forall n. ( KnownNat n, SizeValid n) => FBits n)
type SizeValid n = ( KnownNat n, 1 <= n)
splitHalf :: forall m n. ( SizeValid n, (n * 2) ~ m) => FBits m -> ( FBits n, FBits n)
append :: forall m n r. ( SizeValid m, SizeValid n, SizeValid r, (m + n) ~ r) => FBits n -> FBits m -> FBits r
dropBitsOnRight :: forall a b diff. ( KnownNat diff, b <= a, SizeValid a, SizeValid b, (a - b) ~ diff) => FBits a -> FBits b
dropBitsOnLeft :: forall a b. ( KnownNat b, b <= a, SizeValid a, SizeValid b) => FBits a -> FBits b

Documentation

data FBits (n :: Nat ) Source #

Finite Bits

Sadly Bits is taken by Bits operation

Constructors

FBits
Fields unFBits :: Natural

Instances

Instances details

GetDerivationMaterial ' Hard Key Source #
Instance details Defined in Crypto.ECC.Ed25519BIP32 Methods getDerivationMaterial :: Proxy ' Hard -> Key -> [ Word8 ] Source #
GetDerivationMaterial ' Soft PointCompressed Source #
Instance details Defined in Crypto.ECC.Ed25519BIP32 Methods getDerivationMaterial :: Proxy ' Soft -> PointCompressed -> [ Word8 ] Source #
GetDerivationMaterial ' Soft Key Source #
Instance details Defined in Crypto.ECC.Ed25519BIP32 Methods getDerivationMaterial :: Proxy ' Soft -> Key -> [ Word8 ] Source #
SizeValid n => Bounded ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods minBound :: FBits n Source # maxBound :: FBits n Source #
SizeValid n => Enum ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods succ :: FBits n -> FBits n Source # pred :: FBits n -> FBits n Source # toEnum :: Int -> FBits n Source # fromEnum :: FBits n -> Int Source # enumFrom :: FBits n -> [ FBits n] Source # enumFromThen :: FBits n -> FBits n -> [ FBits n] Source # enumFromTo :: FBits n -> FBits n -> [ FBits n] Source # enumFromThenTo :: FBits n -> FBits n -> FBits n -> [ FBits n] Source #
Eq ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods (==) :: FBits n -> FBits n -> Bool Source # (/=) :: FBits n -> FBits n -> Bool Source #
SizeValid n => Num ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods (+) :: FBits n -> FBits n -> FBits n Source # (-) :: FBits n -> FBits n -> FBits n Source # (*) :: FBits n -> FBits n -> FBits n Source # negate :: FBits n -> FBits n Source # abs :: FBits n -> FBits n Source # signum :: FBits n -> FBits n Source # fromInteger :: Integer -> FBits n Source #
Ord ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods compare :: FBits n -> FBits n -> Ordering Source # (<) :: FBits n -> FBits n -> Bool Source # (<=) :: FBits n -> FBits n -> Bool Source # (>) :: FBits n -> FBits n -> Bool Source # (>=) :: FBits n -> FBits n -> Bool Source # max :: FBits n -> FBits n -> FBits n Source # min :: FBits n -> FBits n -> FBits n Source #
Show ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods showsPrec :: Int -> FBits n -> ShowS Source # show :: FBits n -> String Source # showList :: [ FBits n] -> ShowS Source #
SizeValid n => Bits ( FBits n) Source #
Instance details Defined in Crypto.Math.Bits Methods (.&.) :: FBits n -> FBits n -> FBits n Source # (.\|.) :: FBits n -> FBits n -> FBits n Source # xor :: FBits n -> FBits n -> FBits n Source # complement :: FBits n -> FBits n Source # shift :: FBits n -> Int -> FBits n Source # rotate :: FBits n -> Int -> FBits n Source # zeroBits :: FBits n Source # bit :: Int -> FBits n Source # setBit :: FBits n -> Int -> FBits n Source # clearBit :: FBits n -> Int -> FBits n Source # complementBit :: FBits n -> Int -> FBits n Source # testBit :: FBits n -> Int -> Bool Source # bitSizeMaybe :: FBits n -> Maybe Int Source # bitSize :: FBits n -> Int Source # isSigned :: FBits n -> Bool Source # shiftL :: FBits n -> Int -> FBits n Source # unsafeShiftL :: FBits n -> Int -> FBits n Source # shiftR :: FBits n -> Int -> FBits n Source # unsafeShiftR :: FBits n -> Int -> FBits n Source # rotateL :: FBits n -> Int -> FBits n Source # rotateR :: FBits n -> Int -> FBits n Source # popCount :: FBits n -> Int Source #

data FBitsK Source #

Constructors

FBitsK ( forall n. ( KnownNat n, SizeValid n) => FBits n)

type SizeValid n = ( KnownNat n, 1 <= n) Source #

splitHalf :: forall m n. ( SizeValid n, (n * 2) ~ m) => FBits m -> ( FBits n, FBits n) Source #

append :: forall m n r. ( SizeValid m, SizeValid n, SizeValid r, (m + n) ~ r) => FBits n -> FBits m -> FBits r Source #

Append 2 FBits together where the left member is shifted to make room for the right element.

e.g. append (0x1 :: FBits 1) (0x70 :: FBits 7) = 0xf0 :: FBits 8

dropBitsOnRight :: forall a b diff. ( KnownNat diff, b <= a, SizeValid a, SizeValid b, (a - b) ~ diff) => FBits a -> FBits b Source #

dropBitsOnLeft :: forall a b. ( KnownNat b, b <= a, SizeValid a, SizeValid b) => FBits a -> FBits b Source #