Data.Binary.SignedInt

newtype SignedInt b

Instances

• Newtype (SignedInt b) _
• Eq (SignedInt b)
• (Pos b) => Ord (SignedInt b)
• (Pos b) => Show (SignedInt b)
• (Pos b) => Binary (SignedInt b)
• (Pos b) => Bounded (SignedInt b)
• (Pos b) => Semiring (SignedInt b)
• (Pos b) => Ring (SignedInt b)
• (Pos b, Gt b D2) => BaseN (SignedInt b)

magnitude :: forall b. SignedInt b -> b

flipSign :: forall b. SignedInt b -> SignedInt b

complement :: forall b. SignedInt b -> SignedInt b

fromInt :: forall b. Pos b => GtEq b D32 => b -> Int -> SignedInt b

Converts Int value to SignedInt b for b >= 31

fromUnsigned :: forall b a. Pos a => Pos b => Lt a b => UnsignedInt a -> SignedInt b

tryFromUnsigned :: forall b. Pos b => UnsignedInt b -> Maybe (SignedInt b)

unsafeToUnsigned :: forall b. Pos b => SignedInt b -> UnsignedInt b

toInt :: forall b. Pos b => LtEq b D32 => SignedInt b -> Int

asBits :: forall b a. Pos a => Pos b => Lt a b => SignedInt a -> SignedInt b

asBits' :: forall b a. Pos a => Pos b => Lt a b => b -> SignedInt a -> SignedInt b

tryAsBits :: forall b a. Pos a => Pos b => Gt a b => SignedInt a -> Maybe (SignedInt b)

tryAsBits' :: forall b a. Pos a => Pos b => Gt a b => b -> SignedInt a -> Maybe (SignedInt b)

isNegative :: forall a. Binary a => a -> Boolean

toString2c :: forall b. Pos b => Gt b D2 => Radix -> SignedInt b -> String

two's complement