Copyright	(c) Fumiaki Kinoshita 2019
License	BSD3
Stability	Experimental
Safe Haskell	None
Language	Haskell2010

Codec.Winery.Internal

Description

Maintainer : Fumiaki Kinoshita fumiexcel@gmail.com

Internal functions and datatypes

Synopsis

unsignedVarInt :: (Bits a, Integral a) => a -> Builder
varInt :: (Bits a, Integral a) => a -> Builder
newtype Decoder a = Decoder {
- unDecoder :: ByteString -> Int -> DecoderResult a
}
data DecoderResult a = DecoderResult !Int a
evalDecoder :: Decoder a -> ByteString -> a
newtype State s a = State {
- runState :: s -> (a, s)
}
evalState :: State s a -> s -> a
decodeVarInt :: (Num a, Bits a) => Decoder a
decodeVarIntFinite :: forall a. (Num a, FiniteBits a) => Decoder a
getWord8 :: Decoder Word8
getWord16 :: Decoder Word16
getWord32 :: Decoder Word32
getWord64 :: Decoder Word64
getBytes :: Int -> Decoder ByteString
data DecodeException
- = InsufficientInput
- | IntegerOverflow
- | InvalidTag
indexDefault :: a -> [a] -> Int -> a
unsafeIndexV :: Unbox a => String -> Vector a -> Int -> a
lookupWithIndexV :: Eq k => k -> Vector (k, v) -> Maybe (Int, v)
newtype Strategy e r a = Strategy {
- unStrategy :: r -> Either e a
}
throwStrategy :: e -> Strategy e r a
newtype TransFusion f g a = TransFusion {
- unTransFusion :: forall h. Applicative h => (forall x. f x -> h (g x)) -> h a
}

Documentation

unsignedVarInt :: (Bits a, Integral a) => a -> Builder Source #

varInt :: (Bits a, Integral a) => a -> Builder Source #

newtype Decoder a Source #

The Decoder monad

Constructors

Decoder
Fields unDecoder :: ByteString -> Int -> DecoderResult a

Instances

Monad Decoder Source #
Instance details Defined in Codec.Winery.Internal Methods (>>=) :: Decoder a -> (a -> Decoder b) -> Decoder b # (>>) :: Decoder a -> Decoder b -> Decoder b # return :: a -> Decoder a # fail :: String -> Decoder a #
Functor Decoder Source #
Instance details Defined in Codec.Winery.Internal Methods fmap :: (a -> b) -> Decoder a -> Decoder b # (<$) :: a -> Decoder b -> Decoder a #
Applicative Decoder Source #
Instance details Defined in Codec.Winery.Internal Methods pure :: a -> Decoder a # (<>) :: Decoder (a -> b) -> Decoder a -> Decoder b # liftA2 :: (a -> b -> c) -> Decoder a -> Decoder b -> Decoder c # (>) :: Decoder a -> Decoder b -> Decoder b # (<*) :: Decoder a -> Decoder b -> Decoder a #

data DecoderResult a Source #

Constructors

DecoderResult !Int a

Instances

Functor DecoderResult Source #
Instance details Defined in Codec.Winery.Internal Methods fmap :: (a -> b) -> DecoderResult a -> DecoderResult b # (<$) :: a -> DecoderResult b -> DecoderResult a #

evalDecoder :: Decoder a -> ByteString -> a Source #

Run a Decoder

newtype State s a Source #

A state monad. The reason being not State from transformers is to allow coercion for newtype deriving and DerivingVia.

Constructors

State
Fields runState :: s -> (a, s)

Instances

Monad (State s) Source #
Instance details Defined in Codec.Winery.Internal Methods (>>=) :: State s a -> (a -> State s b) -> State s b # (>>) :: State s a -> State s b -> State s b # return :: a -> State s a # fail :: String -> State s a #
Functor (State s) Source #
Instance details Defined in Codec.Winery.Internal Methods fmap :: (a -> b) -> State s a -> State s b # (<$) :: a -> State s b -> State s a #
MonadFix (State s) Source #
Instance details Defined in Codec.Winery.Internal Methods mfix :: (a -> State s a) -> State s a #
Applicative (State s) Source #
Instance details Defined in Codec.Winery.Internal Methods pure :: a -> State s a # (<>) :: State s (a -> b) -> State s a -> State s b # liftA2 :: (a -> b -> c) -> State s a -> State s b -> State s c # (>) :: State s a -> State s b -> State s b # (<*) :: State s a -> State s b -> State s a #

evalState :: State s a -> s -> a Source #

decodeVarInt :: (Num a, Bits a) => Decoder a Source #

decodeVarIntFinite :: forall a. (Num a, FiniteBits a) => Decoder a Source #

getWord8 :: Decoder Word8 Source #

getWord16 :: Decoder Word16 Source #

getWord32 :: Decoder Word32 Source #

getWord64 :: Decoder Word64 Source #

getBytes :: Int -> Decoder ByteString Source #

data DecodeException Source #

Exceptions thrown by a Decoder

Constructors

InsufficientInput
IntegerOverflow
InvalidTag

Instances

Eq DecodeException Source #
Instance details Defined in Codec.Winery.Internal Methods (==) :: DecodeException -> DecodeException -> Bool # (/=) :: DecodeException -> DecodeException -> Bool #
Read DecodeException Source #
Instance details Defined in Codec.Winery.Internal Methods readsPrec :: Int -> ReadS DecodeException # readList :: ReadS [DecodeException] # readPrec :: ReadPrec DecodeException # readListPrec :: ReadPrec [DecodeException] #
Show DecodeException Source #
Instance details Defined in Codec.Winery.Internal Methods showsPrec :: Int -> DecodeException -> ShowS # show :: DecodeException -> String # showList :: [DecodeException] -> ShowS #
Exception DecodeException Source #
Instance details Defined in Codec.Winery.Internal Methods toException :: DecodeException -> SomeException # fromException :: SomeException -> Maybe DecodeException # displayException :: DecodeException -> String #

indexDefault :: a -> [a] -> Int -> a Source #

unsafeIndexV :: Unbox a => String -> Vector a -> Int -> a Source #

lookupWithIndexV :: Eq k => k -> Vector (k, v) -> Maybe (Int, v) Source #

newtype Strategy e r a Source #

A monad with Reader [r] and Either WineryException combined, used internally to build an extractor. r is used to share environment such as extractors for fixpoints.

Constructors

Strategy
Fields unStrategy :: r -> Either e a

Instances

Monad (Strategy e r) Source #
Instance details Defined in Codec.Winery.Internal Methods (>>=) :: Strategy e r a -> (a -> Strategy e r b) -> Strategy e r b # (>>) :: Strategy e r a -> Strategy e r b -> Strategy e r b # return :: a -> Strategy e r a # fail :: String -> Strategy e r a #
Functor (Strategy e r) Source #
Instance details Defined in Codec.Winery.Internal Methods fmap :: (a -> b) -> Strategy e r a -> Strategy e r b # (<$) :: a -> Strategy e r b -> Strategy e r a #
MonadFix (Strategy e r) Source #
Instance details Defined in Codec.Winery.Internal Methods mfix :: (a -> Strategy e r a) -> Strategy e r a #
Applicative (Strategy e r) Source #
Instance details Defined in Codec.Winery.Internal Methods pure :: a -> Strategy e r a # (<>) :: Strategy e r (a -> b) -> Strategy e r a -> Strategy e r b # liftA2 :: (a -> b -> c) -> Strategy e r a -> Strategy e r b -> Strategy e r c # (>) :: Strategy e r a -> Strategy e r b -> Strategy e r b # (<*) :: Strategy e r a -> Strategy e r b -> Strategy e r a #
IsString e => Alternative (Strategy e r) Source #
Instance details Defined in Codec.Winery.Internal Methods empty :: Strategy e r a # (<\|>) :: Strategy e r a -> Strategy e r a -> Strategy e r a # some :: Strategy e r a -> Strategy e r [a] # many :: Strategy e r a -> Strategy e r [a] #

throwStrategy :: e -> Strategy e r a Source #

newtype TransFusion f g a Source #

A Bazaar (chain of indexed store comonad)-like structure which instead works for natural transformations.

Constructors

TransFusion
Fields unTransFusion :: forall h. Applicative h => (forall x. f x -> h (g x)) -> h a

Instances

Functor (TransFusion f g) Source #
Instance details Defined in Codec.Winery.Internal Methods fmap :: (a -> b) -> TransFusion f g a -> TransFusion f g b # (<$) :: a -> TransFusion f g b -> TransFusion f g a #
Applicative (TransFusion f g) Source #
Instance details Defined in Codec.Winery.Internal Methods pure :: a -> TransFusion f g a # (<>) :: TransFusion f g (a -> b) -> TransFusion f g a -> TransFusion f g b # liftA2 :: (a -> b -> c) -> TransFusion f g a -> TransFusion f g b -> TransFusion f g c # (>) :: TransFusion f g a -> TransFusion f g b -> TransFusion f g b # (<*) :: TransFusion f g a -> TransFusion f g b -> TransFusion f g a #