Module

Data.Binary

Package: purescript-binary
Repository: Unisay/purescript-binary

#Binary Source

class Binary a  where

Members

lsb :: a -> Bit
Least significant bit
msb :: a -> Bit
most significant bit
and :: a -> a -> a
xor :: a -> a -> a
or :: a -> a -> a
not :: a -> a
leftShift :: Bit -> a -> Tuple Bit a
rightShift :: Bit -> a -> Tuple Bit a
toBits :: a -> Bits
tryFromBits :: Bits -> Maybe a

Instances

Binary Bit
Binary Bits

#isOdd Source

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

#isEven Source

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

#isZero Source

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

#unsafeFromBits Source

unsafeFromBits :: forall a. Binary a => Bits -> a

#unsafeRightShift Source

unsafeRightShift :: forall a. Binary a => a -> a

#unsafeLeftShift Source

unsafeLeftShift :: forall a. Binary a => a -> a

#Elastic Source

class (Binary a) <= Elastic a  where

Members

fromBits :: Bits -> a

Instances

Elastic Bits

#addLeadingZeros Source

addLeadingZeros :: forall a. Elastic a => Int -> a -> a

#addLeadingBit Source

addLeadingBit :: forall a. Elastic a => Bit -> Int -> a -> a

#stripLeadingZeros Source

stripLeadingZeros :: forall a. Elastic a => a -> a

#stripLeadingBit Source

stripLeadingBit :: forall a. Elastic a => Bit -> a -> a

#tryFromBinStringElastic Source

tryFromBinStringElastic :: forall a. Elastic a => String -> Maybe a

Re-exports from Data.Binary.Bit

#Bit Source

newtype Bit

Constructors

Bit Boolean

Instances

#intToBit Source

intToBit :: Int -> Bit

#charToBit Source

charToBit :: Char -> Maybe Bit

#bitToInt Source

bitToInt :: Bit -> Int

#bitToChar Source

bitToChar :: Bit -> Char

#_1 Source

_1 :: Bit

#_0 Source

_0 :: Bit

Re-exports from Data.Binary.Bits

#Bits Source

newtype Bits

Constructors

Bits (Array Bit)

Instances

#zeroes Source

zeroes :: Int -> Bits

#zero Source

zero :: Bits

#unsafeBitsToInt Source

unsafeBitsToInt :: Bits -> Int

#uncons Source

uncons :: Bits -> { head :: Bit, tail :: Bits }

#toString Source

toString :: Bits -> String

#take Source

take :: Int -> Bits -> Bits

#tail Source

tail :: Bits -> Bits

#subtractBits Source

subtractBits :: Bits -> Bits -> Bits

#setMsb Source

setMsb :: Bit -> Bits -> Bits

#setLsb Source

setLsb :: Bit -> Bits -> Bits

#ones Source

ones :: Int -> Bits

#one Source

one :: Bits

#length Source

length :: Bits -> Int

#last Source

last :: Bits -> Bit

#intToBits Source

intToBits :: Int -> Bits

#init Source

init :: Bits -> Bits

#head Source

head :: Bits -> Bit

#extendOverflow Source

extendOverflow :: Overflow Bits -> Bits

#drop Source

drop :: Int -> Bits -> Bits

#align Source

align :: Bits -> Bits -> Tuple Bits Bits

align length by adding zeroes from the left

#addBits' Source

addBits' :: Bit -> Bits -> Bits -> Bits

#addBits Source

addBits :: Bit -> Bits -> Bits -> Overflow Bits

#addBit Source

addBit :: Bit -> Bit -> Bit -> Overflow Bit

Re-exports from Data.Binary.Overflow

#Overflow Source

data Overflow a

Constructors

Overflow a
NoOverflow a

Instances

(Eq a) => Eq (Overflow a)
(Show a) => Show (Overflow a)
Functor Overflow

#overflowBit Source

overflowBit :: forall a. Overflow a -> Bit

#makeOverflow Source

makeOverflow :: forall a. Bit -> a -> Overflow a

#discardOverflow Source

discardOverflow :: forall a. Overflow a -> a

Modules: Data.Binary; Data.Binary.BaseN; Data.Binary.Bit; Data.Binary.Bits; Data.Binary.Overflow; Data.Binary.SignedInt; Data.Binary.UnsignedInt; Debug