Agda-2.2.4: A dependently typed functional programming language and proof assistant Source code Contents Index

Agda.Utils.Serialise

Synopsis

newtype Printer a = Printer { runPrinter :: a -> ShowS } newtype Parser a = Parser { runParser :: ByteString -> (a, ByteString) } data IFun a b = IFun (a -> b) (b -> a) class BiMonad m where charS :: m Char stringS :: Int -> m String returnS :: a -> m a bindS :: (b -> a) -> m a -> (a -> m b) -> m b bsToString :: ByteString -> String mapS :: BiMonad m => IFun a b -> m a -> m b (>->) :: BiMonad m => m a -> m b -> m (a, b) sequenceS :: BiMonad m => [m a] -> m [a] replicateS :: BiMonad m => Int -> m a -> m [a] class Serialisable a where serialiser :: BiMonad m => m a serialise :: Serialisable a => a -> String deserialise :: Serialisable a => ByteString -> a deserialiseLazy :: Serialisable a => ByteString -> (a, Bool)

Documentation

newtype Printer a Source

Constructors Printer runPrinter :: a -> ShowS Instances BiMonad Printer

newtype Parser a Source

Constructors Parser runParser :: ByteString -> (a, ByteString) Instances BiMonad Parser

data IFun a b Source

Constructors IFun (a -> b) (b -> a)

class BiMonad m where Source

Methods charS :: m Char Source stringS :: Int -> m String Source returnS :: a -> m a Source bindS :: (b -> a) -> m a -> (a -> m b) -> m b Source Instances BiMonad Parser BiMonad Printer

bsToString :: ByteString -> String Source

mapS :: BiMonad m => IFun a b -> m a -> m b Source

(>->) :: BiMonad m => m a -> m b -> m (a, b) Source

sequenceS :: BiMonad m => [m a] -> m [a] Source

replicateS :: BiMonad m => Int -> m a -> m [a] Source

class Serialisable a where Source

Methods serialiser :: BiMonad m => m a Source Instances Serialisable Bool Serialisable Char Serialisable Int Serialisable String Serialisable () Serialisable a => Serialisable ([] a) Serialisable a => Serialisable (Maybe a) (Serialisable a, Serialisable b) => Serialisable (Either a b) (Serialisable a, Serialisable b) => Serialisable ((,) a b) (Ord k, Serialisable k, Serialisable v) => Serialisable (Map k v) (Serialisable a, Serialisable b, Serialisable c) => Serialisable ((,,) a b c) (Serialisable a, Serialisable b, Serialisable c, Serialisable d) => Serialisable ((,,,) a b c d) (Serialisable a, Serialisable b, Serialisable c, Serialisable d, Serialisable e) => Serialisable ((,,,,) a b c d e) (Serialisable a, Serialisable b, Serialisable c, Serialisable d, Serialisable e, Serialisable f) => Serialisable ((,,,,,) a b c d e f)

serialise :: Serialisable a => a -> String Source

deserialise :: Serialisable a => ByteString -> a Source

deserialiseLazy :: Serialisable a => ByteString -> (a, Bool) Source

Force the Bool to force the a. True means ok and false means left-over garbage.

Produced by Haddock version 2.4.2