Safe Haskell | None |
---|---|
Language | Haskell2010 |
Incremental ETA - fast recalculation cumulative time required for finishing dependent tasks
Documentation
IncDepEta | |
|
Instances
(DynGraph gr, Show a, Show b) => Show (IncDepEta gr a b k w) # | |
Generic (IncDepEta gr a b k3 w) # | |
type Rep (IncDepEta gr a b k3 w) # | |
Defined in Napkin.Utils.Eta.IncDepEta type Rep (IncDepEta gr a b k3 w) = D1 ('MetaData "IncDepEta" "Napkin.Utils.Eta.IncDepEta" "napkin-0.5.9-9RVzJKhltBGIJ4XYUA68gX" 'False) (C1 ('MetaCons "IncDepEta" 'PrefixI 'True) ((S1 ('MetaSel ('Just "_incrementalEta_depG") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (gr a b)) :*: S1 ('MetaSel ('Just "_incrementalEta_roots") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [Node])) :*: (S1 ('MetaSel ('Just "_incrementalEta_maxChildWeight") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashMap Node w)) :*: S1 ('MetaSel ('Just "_incrementalEta_nodeIdx") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (HashMap k3 Node))))) |
etaNow :: forall gr a b k w. IncDepEtaC gr a b k w => IncDepEta gr a b k w -> w #
markNodeDone :: forall gr a b k w. IncDepEtaC gr a b k w => IncDepEta gr a b k w -> k -> IncDepEta gr a b k w #
mkIncDepEta :: forall gr a b k w. IncDepEtaC gr a b k w => gr a b -> (a -> w) -> (a -> k) -> Either Text (IncDepEta gr a b k w) #
type EtaType = IncDepEta Gr TableName () TableName NominalDiffTime #