DeepDarkFantasy-0.2017.8.10: A DSL for creating neural network.

Safe HaskellSafe
LanguageHaskell2010

DDF.Map

Documentation

class Ord x => Ord x where Source #

Minimal complete definition

diffOrd

Methods

diffOrd :: Proxy (v, x) -> Dict (Ord (DiffType v x)) Source #

class (Prod r, Option r) => Map r where Source #

Minimal complete definition

empty, singleton, lookup, alter, mapMap, unionWith

Methods

empty :: r h (Map k a) Source #

singleton :: r h (k -> a -> Map k a) Source #

lookup :: Ord k => r h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: r h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => r h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => r h (k -> a -> Map k a -> Map k a) Source #

Instances

Map Eval Source # 

Methods

empty :: Eval h (Map k a) Source #

singleton :: Eval h (k -> a -> Map k a) Source #

lookup :: Ord k => Eval h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => Eval h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: Eval h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => Eval h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => Eval h (k -> a -> Map k a -> Map k a) Source #

Map Show Source # 

Methods

empty :: Show h (Map k a) Source #

singleton :: Show h (k -> a -> Map k a) Source #

lookup :: Ord k => Show h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => Show h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: Show h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => Show h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => Show h (k -> a -> Map k a -> Map k a) Source #

Map Size Source # 

Methods

empty :: Size h (Map k a) Source #

singleton :: Size h (k -> a -> Map k a) Source #

lookup :: Ord k => Size h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => Size h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: Size h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => Size h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => Size h (k -> a -> Map k a -> Map k a) Source #

SubL c Map => Map (Term c) Source # 

Methods

empty :: Term c h (Map k a) Source #

singleton :: Term c h (k -> a -> Map k a) Source #

lookup :: Ord k => Term c h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => Term c h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: Term c h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => Term c h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => Term c h (k -> a -> Map k a -> Map k a) Source #

Map r => Map (UnHOAS r) Source # 

Methods

empty :: UnHOAS r h (Map k a) Source #

singleton :: UnHOAS r h (k -> a -> Map k a) Source #

lookup :: Ord k => UnHOAS r h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => UnHOAS r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: UnHOAS r h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => UnHOAS r h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => UnHOAS r h (k -> a -> Map k a -> Map k a) Source #

Map r => Map (UnLiftEnv r) Source # 

Methods

empty :: UnLiftEnv r h (Map k a) Source #

singleton :: UnLiftEnv r h (k -> a -> Map k a) Source #

lookup :: Ord k => UnLiftEnv r h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => UnLiftEnv r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: UnLiftEnv r h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => UnLiftEnv r h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => UnLiftEnv r h (k -> a -> Map k a -> Map k a) Source #

Map r => Map (ImpW r) Source # 

Methods

empty :: ImpW r h (Map k a) Source #

singleton :: ImpW r h (k -> a -> Map k a) Source #

lookup :: Ord k => ImpW r h (Map k a -> k -> Maybe a) Source #

alter :: Ord k => ImpW r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #

mapMap :: ImpW r h ((a -> b) -> Map k a -> Map k b) Source #

unionWith :: Ord k => ImpW r h ((a -> a -> a) -> Map k a -> Map k a -> Map k a) Source #

insert :: Ord k => ImpW r h (k -> a -> Map k a -> Map k a) Source #

type SubLC c Map Source # 
type SubLC c Map = (SubL c Prod, SubL c Option)

lookup2 :: (Ord a1, Map r) => r h (Map a1 a) -> r h a1 -> r h (Maybe a) Source #

unionWith1 :: (Ord k, Map r) => r h (a -> a -> a) -> r h (Map k a -> Map k a -> Map k a) Source #

mapMap1 :: Map r => r h (a -> b) -> r h (Map k a -> Map k b) Source #

mapMap2 :: Map r => r h (a -> b) -> r h (Map k a) -> r h (Map k b) Source #

insert2 :: (Ord a1, Map r) => r h a1 -> r h a -> r h (Map a1 a -> Map a1 a) Source #

alter2 :: (Ord a, Map r) => r h (Maybe a1 -> Maybe a1) -> r h a -> r h (Map a a1 -> Map a a1) Source #

singleton2 :: Map r => r h a1 -> r h a -> r h (Map a1 a) Source #

module DDF.Prod

module DDF.Option