| Safe Haskell | Safe-Inferred |
|---|---|
| Language | GHC2021 |
Development.IDE.Graph.Internal.Database
Synopsis
- compute :: Database -> Stack -> Key -> RunMode -> Maybe Result -> IO Result
- newDatabase :: Dynamic -> TheRules -> IO Database
- incDatabase :: Database -> Maybe [Key] -> IO ()
- build :: forall f key value. (Traversable f, RuleResult key ~ value, Typeable key, Show key, Hashable key, Eq key, Typeable value) => Database -> Stack -> f key -> IO (f Key, f value)
- getDirtySet :: Database -> IO [(Key, Int)]
- getKeysAndVisitAge :: Database -> IO [(Key, Int)]
Documentation
incDatabase :: Database -> Maybe [Key] -> IO () Source #
Increment the step and mark dirty. Assumes that the database is not running a build
build :: forall f key value. (Traversable f, RuleResult key ~ value, Typeable key, Show key, Hashable key, Eq key, Typeable value) => Database -> Stack -> f key -> IO (f Key, f value) Source #
Unwrap and build a list of keys in parallel