Safe Haskell	None
Language	Haskell2010

Nix.Graph.Internal

Synopsis

data Derivation = Derivation {
- derivationPath :: FilePath
- derivationInputDrvs :: [FilePath]
- derivationBuilt :: Bool
}
readDerivation :: (MonadIO m, MonadFail m) => TSem -> FilePath -> m Derivation
buildAdjacencyMap :: MonadIO m => Eq k => Hashable k => (k -> IO (Set k)) -> [k] -> m [(k, Set k)]
filterUnbuilt :: (MonadIO m, MonadFail m) => [FilePath] -> m (Set FilePath)
data Config = Config {
- exclude :: Exclude
- maxFiles :: Natural
}
data Exclude
- = ExcludeNothing
- | ExcludeBuilt
- | ExcludeCached
build :: MonadIO m => Config -> [FilePath] -> m (AdjacencyMap FilePath)

Documentation

data Derivation Source #

Constructors

Derivation
Fields derivationPath :: FilePath derivationInputDrvs :: [FilePath] derivationBuilt :: Bool

Instances

Instances details

Eq Derivation Source #
Instance details Defined in Nix.Graph.Internal Methods (==) :: Derivation -> Derivation -> Bool # (/=) :: Derivation -> Derivation -> Bool #
Ord Derivation Source #
Instance details Defined in Nix.Graph.Internal Methods compare :: Derivation -> Derivation -> Ordering # (<) :: Derivation -> Derivation -> Bool # (<=) :: Derivation -> Derivation -> Bool # (>) :: Derivation -> Derivation -> Bool # (>=) :: Derivation -> Derivation -> Bool # max :: Derivation -> Derivation -> Derivation # min :: Derivation -> Derivation -> Derivation #
Generic Derivation Source #
Instance details Defined in Nix.Graph.Internal Associated Types type Rep Derivation :: Type -> Type # Methods from :: Derivation -> Rep Derivation x # to :: Rep Derivation x -> Derivation #
Hashable Derivation Source #
Instance details Defined in Nix.Graph.Internal Methods hashWithSalt :: Int -> Derivation -> Int # hash :: Derivation -> Int #
type Rep Derivation Source #
Instance details Defined in Nix.Graph.Internal type Rep Derivation = D1 ('MetaData "Derivation" "Nix.Graph.Internal" "nix-graph-1.0.0.0-7rxHZl2ZpuxI9mrsd5phgY" 'False) (C1 ('MetaCons "Derivation" 'PrefixI 'True) (S1 ('MetaSel ('Just "derivationPath") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 FilePath) :: (S1 ('MetaSel ('Just "derivationInputDrvs") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [FilePath]) :: S1 ('MetaSel ('Just "derivationBuilt") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))))

readDerivation :: (MonadIO m, MonadFail m) => TSem -> FilePath -> m Derivation Source #

buildAdjacencyMap :: MonadIO m => Eq k => Hashable k => (k -> IO (Set k)) -> [k] -> m [(k, Set k)] Source #

filterUnbuilt :: (MonadIO m, MonadFail m) => [FilePath] -> m (Set FilePath) Source #

data Config Source #

Constructors

Config
Fields exclude :: Exclude maxFiles :: Natural

data Exclude Source #

Constructors

ExcludeNothing
ExcludeBuilt
ExcludeCached

Instances

Instances details

Eq Exclude Source #
Instance details Defined in Nix.Graph.Internal Methods (==) :: Exclude -> Exclude -> Bool # (/=) :: Exclude -> Exclude -> Bool #

build Source #

Arguments

:: MonadIO m
=> Config	Configure how the graph is built
-> [FilePath]	Derivations to build graph from
-> m (AdjacencyMap FilePath)

Build graph of dependencies