rl-satton-0.1.2.4: Collection of Reinforcement Learning algorithms

Safe HaskellNone
LanguageHaskell2010

RL.Types

Synopsis

Documentation

type Layer a num = HashMap a num Source #

type Storage s a num = HashMap s (Layer a num) Source #

data M s a num Source #

Base container used in most of RL algorithms. M x0 sto describes the 2-dimentional array (Storage of Layers) where each layer containes fixed number of elements. New layers are filled with the range of [minBound..maxBound] default values x0

Constructors

M 

Fields

Instances

(Show s, Show a, Show num) => Show (M s a num) Source # 

Methods

showsPrec :: Int -> M s a num -> ShowS #

show :: M s a num -> String #

showList :: [M s a num] -> ShowS #

initM :: num -> M s a num Source #

Initialises new container, set default layer value to x

mmod :: (Storage s a num -> Storage s a num) -> M s a num -> M s a num Source #

aq0 :: (Eq a, Enum a, Hashable a, Bounded a) => num -> HashMap a num Source #

get_s :: (Eq a, Enum a, Hashable a, Bounded a, Eq s, Hashable s) => s -> M s a num -> Layer a num Source #

layer_s_max :: (Eq a, Enum a, Hashable a, Bounded a, Ord num) => Layer a num -> (a, num) Source #

get_s_a :: (Eq a, Enum a, Hashable a, Bounded a, Eq s, Hashable s) => s -> a -> M s a num -> num Source #

put_s :: (Eq s, Hashable s, Bounded a, Enum a, Eq a, Hashable a) => s -> HashMap a num -> M s a num -> M s a num Source #

put_s_a :: (Eq s, Hashable s, Bounded a, Enum a, Eq a, Hashable a) => s -> a -> num -> M s a num -> M s a num Source #

modify_s_a :: (Eq s, Hashable s, Bounded a, Enum a, Eq a, Hashable a) => s -> a -> (num -> num) -> M s a num -> M s a num Source #

list :: M s a num -> [(s, a, num)] Source #

foldMap_s :: (Eq a, Bounded a, Enum a, Hashable a, Monoid acc) => ((s, Layer a num) -> acc) -> M s a num -> acc Source #

fold_s :: (Eq a, Bounded a, Enum a, Hashable a, Monoid acc) => (acc -> (s, Layer a num) -> acc) -> acc -> M s a num -> acc Source #