DeepDarkFantasy-0.2017.4.9: A DSL for creating neural network.
DDF.Map
Contents
class Ord x => Ord x where Source #
Minimal complete definition
diffOrd
Methods
diffOrd :: Proxy (v, x) -> Dict (Ord (Diff v x)) Source #
Instances
diffOrd :: Proxy * (v, Double) -> Dict (Ord (Diff v Double)) Source #
diffOrd :: Proxy * (v, Float) -> Dict (Ord (Diff v Float)) Source #
diffOrd :: Proxy * (v, ()) -> Dict (Ord (Diff v ())) Source #
diffOrd :: Proxy * (v, [a]) -> Dict (Ord (Diff v [a])) Source #
diffOrd :: Proxy * (v, Dual l r) -> Dict (Ord (Diff v (Dual l r))) Source #
class (Prod r, Option r) => Map r where Source #
empty, singleton, lookup, alter, mapMap
empty :: r h (Map k a) Source #
singleton :: r h (k -> a -> Map k a) Source #
lookup :: Ord k => r h (k -> Map k a -> 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 #
empty :: Eval h (Map k a) Source #
singleton :: Eval h (k -> a -> Map k a) Source #
lookup :: Ord k => Eval h (k -> Map k a -> 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 #
empty :: Show h (Map k a) Source #
singleton :: Show h (k -> a -> Map k a) Source #
lookup :: Ord k => Show h (k -> Map k a -> 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 #
empty :: Size h (Map k a) Source #
singleton :: Size h (k -> a -> Map k a) Source #
lookup :: Ord k => Size h (k -> Map k a -> 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 #
empty :: GWDiff r h (Map k a) Source #
singleton :: GWDiff r h (k -> a -> Map k a) Source #
lookup :: Ord k => GWDiff r h (k -> Map k a -> Maybe a) Source #
alter :: Ord k => GWDiff r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #
mapMap :: GWDiff r h ((a -> b) -> Map k a -> Map k b) Source #
empty :: ImpW r h (Map k a) Source #
singleton :: ImpW r h (k -> a -> Map k a) Source #
lookup :: Ord k => ImpW r h (k -> Map k a -> 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 #
empty :: UnHOAS r h (Map k a) Source #
singleton :: UnHOAS r h (k -> a -> Map k a) Source #
lookup :: Ord k => UnHOAS r h (k -> Map k a -> 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 #
empty :: Combine l r h (Map k a) Source #
singleton :: Combine l r h (k -> a -> Map k a) Source #
lookup :: Ord k => Combine l r h (k -> Map k a -> Maybe a) Source #
alter :: Ord k => Combine l r h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #
mapMap :: Combine l r h ((a -> b) -> Map k a -> Map k b) Source #
empty :: WDiff r v h (Map k a) Source #
singleton :: WDiff r v h (k -> a -> Map k a) Source #
lookup :: Ord k => WDiff r v h (k -> Map k a -> Maybe a) Source #
alter :: Ord k => WDiff r v h ((Maybe a -> Maybe a) -> k -> Map k a -> Map k a) Source #
mapMap :: WDiff r v h ((a -> b) -> Map k a -> Map k b) Source #
module DDF.Prod
module DDF.Option
(==) :: Dual l r -> Dual l r -> Bool #
(/=) :: Dual l r -> Dual l r -> Bool #
compare :: Dual l r -> Dual l r -> Ordering #
(<) :: Dual l r -> Dual l r -> Bool #
(<=) :: Dual l r -> Dual l r -> Bool #
(>) :: Dual l r -> Dual l r -> Bool #
(>=) :: Dual l r -> Dual l r -> Bool #
max :: Dual l r -> Dual l r -> Dual l r #
min :: Dual l r -> Dual l r -> Dual l r #