Safe Haskell | None |
---|---|
Language | Haskell2010 |
A simple implementation of incremental build rules, which can be used to avoid unnecessary
recomputation on incrementally-changing input. See Rule
for more details.
Synopsis
Documentation
newtype InvalidationKey Source #
A simple helper type that can be used to implement explicit cache invalidation. Internally,
each InvalidationKey
is a counter; initialInvalidationKey
starts the counter at 0 and
invalidate
increments it by 1. Two InvalidationKey
s are equal iff they have the same internal
count, so depending on an InvalidationKey
provides a mechanism to force portions of the build
process to be reexecuted by calling invalidate
before running the build.
Instances
Eq InvalidationKey Source # | |
Defined in Hasura.Incremental (==) :: InvalidationKey -> InvalidationKey -> Bool # (/=) :: InvalidationKey -> InvalidationKey -> Bool # | |
Show InvalidationKey Source # | |
Defined in Hasura.Incremental showsPrec :: Int -> InvalidationKey -> ShowS # show :: InvalidationKey -> String # showList :: [InvalidationKey] -> ShowS # | |
Cacheable InvalidationKey Source # | |
Defined in Hasura.Incremental unchanged :: Accesses -> InvalidationKey -> InvalidationKey -> Bool Source # |