rl-satton-0.1.2.4: Collection of Reinforcement Learning algorithms

RL.Imports

Contents

Synopsis

# Break

newtype Break r m a Source #

For the most common use cases you will:

• build Break commands using lift or break
• combine Break commands using do notation
• consume Break commands using loop

The meaning of the type parameters:

• r: the argument type of break and the return type of the loop
• m: the base Monad that you are running in a loop
• a: the return type of a Break command (not the same as the return value of the loop)

Constructors

 Break FieldsunBreak :: ExceptT r m a

Instances

 MonadState s m => MonadState s (Break r m) Source # Methodsget :: Break r m s #put :: s -> Break r m () #state :: (s -> (a, s)) -> Break r m a # MonadWriter w m => MonadWriter w (Break r m) Source # Methodswriter :: (a, w) -> Break r m a #tell :: w -> Break r m () #listen :: Break r m a -> Break r m (a, w) #pass :: Break r m (a, w -> w) -> Break r m a # Source # Methodslift :: Monad m => m a -> Break r m a # Monad m => Monad (Break r m) Source # Methods(>>=) :: Break r m a -> (a -> Break r m b) -> Break r m b #(>>) :: Break r m a -> Break r m b -> Break r m b #return :: a -> Break r m a #fail :: String -> Break r m a # Functor m => Functor (Break r m) Source # Methodsfmap :: (a -> b) -> Break r m a -> Break r m b #(<\$) :: a -> Break r m b -> Break r m a # Monad m => Applicative (Break r m) Source # Methodspure :: a -> Break r m a #(<*>) :: Break r m (a -> b) -> Break r m a -> Break r m b #(*>) :: Break r m a -> Break r m b -> Break r m b #(<*) :: Break r m a -> Break r m b -> Break r m a # MonadIO m => MonadIO (Break r m) Source # MethodsliftIO :: IO a -> Break r m a # MonadCont m => MonadCont (Break r m) Source # MethodscallCC :: ((a -> Break r m b) -> Break r m a) -> Break r m a #

loop :: Monad m => Break r m () -> m r Source #

(loop m) runs the action 'm' repeatedly until you break from the loop

break :: Monad m => r -> Break r m a Source #

break from a loop

The argument you supply to break is the return value of the loop

# Re-exports

lift :: MonadTrans t => forall m a. Monad m => m a -> t m a #

module Data.Bits

module Data.Ratio

module Data.Tuple

module Data.List

module Data.Maybe

module Data.Set

module Data.Text

module Prelude

trace1 :: Show a => a -> a Source #

traceM :: (Monad m, Show a) => a -> m () Source #

trace' :: Show a => a -> b -> b Source #

loopM :: Monad m => a -> (a -> Bool) -> (a -> m a) -> m a Source #

iter :: Monad m => r -> (r -> Break r m r) -> m r Source #

# Orphan instances

 MonadRnd g m => MonadRnd g (Break r m) Source # Methodsroll :: (g -> (a, g)) -> Break r m a Source #getGen :: Break r m g Source #putGen :: g -> Break r m () Source #