Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Development.Guardian.Graph
Documentation
buildRawDomainGraph :: (Graph gr, Vertex gr ~ DomainName) => Domains -> gr Source #
detectCycle :: (ToGraph t, Ord (ToVertex t), ToVertex t ~ DomainName) => t -> Validation DomainGraphError () Source #
buildPackageDic :: Domains -> PackageDic Source #
matches :: PackageDic -> Dependency -> PackageName -> Bool Source #
newtype LOverlayed e a Source #
Constructors
LOverlayed | |
Fields
|
Instances
data ActualGraphs a b Source #
Constructors
AGs | |
Fields
|
Instances
buildActualGraphs :: PackageDic -> PackageGraph -> ActualGraphs ActualGraph (Map PackageName (Set Dependency)) Source #
validatePackageGraph :: DomainInfo -> PackageGraph -> Validation (NonEmpty PackageViolation) CheckResult Source #
type ExemptDomDeps = ActualGraph Source #
findRedundantExtraDeps :: PackageDic -> PackageGraph -> Map PackageName (Vector Dependency) Source #
coversAllPackages :: PackageDic -> PackageGraph -> Validation PackageViolation () Source #
satisfiesDomainGraph :: DomainGraph -> ActualGraph -> Validation (DNonEmpty PackageViolation) () Source #