Safe Haskell | None |
---|---|
Language | Haskell2010 |
- simplifyVersionRange :: VersionRange -> VersionRange
- topologicalSort :: (Ord key, Show key, MonadThrow m, Typeable key) => (value -> finalValue) -> (value -> Set key) -> Map key value -> m (Vector (key, finalValue))
- data TopologicalSortException key = NoEmptyDeps (Map key (Set key))
- copyDir :: FilePath -> FilePath -> IO ()
- data Target
- = TargetNightly !Day
- | TargetLts !Int !Int
- targetSlug :: Target -> Text
Documentation
simplifyVersionRange :: VersionRange -> VersionRange Source #
There seems to be a bug in Cabal where serializing and deserializing version ranges winds up with different representations. So we have a super-simplifier to deal with that.
:: (Ord key, Show key, MonadThrow m, Typeable key) | |
=> (value -> finalValue) | |
-> (value -> Set key) | deps |
-> Map key value | |
-> m (Vector (key, finalValue)) |
Topologically sort so that items with dependencies occur after those dependencies.
data TopologicalSortException key Source #
NoEmptyDeps (Map key (Set key)) |
targetSlug :: Target -> Text Source #