Safe Haskell | None |
---|---|
Language | Haskell2010 |
- type Layer a num = HashMap a num
- type Storage s a num = HashMap s (Layer a num)
- data M s a num = M {}
- initM :: num -> M s a num
- mmod :: (Storage s a num -> Storage s a num) -> M s a num -> M s a num
- aq0 :: (Eq a, Enum a, Hashable a, Bounded a) => num -> HashMap a num
- get_s :: (Eq a, Enum a, Hashable a, Bounded a, Eq s, Hashable s) => s -> M s a num -> Layer a num
- layer_s_max :: (Eq a, Enum a, Hashable a, Bounded a, Ord num) => Layer a num -> (a, num)
- get_s_a :: (Eq a, Enum a, Hashable a, Bounded a, Eq s, Hashable s) => s -> a -> M s a num -> num
- 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
- 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
- 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
- list :: M s a num -> [(s, a, num)]
- foldMap_s :: (Eq a, Bounded a, Enum a, Hashable a, Monoid acc) => ((s, Layer a num) -> acc) -> M s a num -> acc
- fold_s :: (Eq a, Bounded a, Enum a, Hashable a, Monoid acc) => (acc -> (s, Layer a num) -> acc) -> acc -> M s a num -> acc
Documentation
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
get_s :: (Eq a, Enum a, Hashable a, Bounded a, Eq s, Hashable s) => s -> M s a num -> Layer 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 #