{-# LANGUAGE CPP, DeriveDataTypeable, Rank2Types, TemplateHaskell #-}
{-# OPTIONS_GHC -Wall #-}
module Debian.Debianize.DebInfo
(
#if __HADDOCK__
DebInfo(..)
#else
DebInfo
#endif
, Atom(File, Install, InstallCabalExec, InstallCabalExecTo, InstallData, InstallDir, InstallTo, Link)
, Site(Site, domain, server, serverAdmin)
, Server(Server, headerMessage, hostname, installFile, port, retry, serverFlags)
, InstallFile(InstallFile, destDir, destName, execName, sourceDir)
, TestsStatus(..)
, flags
, warning
, sourceFormat
, watch
, rulesHead
, rulesSettings
, rulesIncludes
, rulesFragments
, copyright
, control
, intermediateFiles
, compat
, changelog
, installInit
, logrotateStanza
, postInst
, postRm
, preInst
, preRm
, atomSet
, noDocumentationLibrary
, noProfilingLibrary
, omitProfVersionDeps
, omitLTDeps
, buildDir
, sourcePackageName
, overrideDebianNameBase
, revision
, debVersion
, maintainerOption
, uploadersOption
, utilsPackageNameBase
, xDescriptionText
, comments
, missingDependencies
, extraLibMap
, execMap
, apacheSite
, sourceArchitectures
, binaryArchitectures
, sourcePriority
, binaryPriorities
, sourceSection
, binarySections
, executable
, serverInfo
, website
, backups
, extraDevDeps
, official
, testsStatus
, allowDebianSelfBuildDeps
, binaryDebDescription
, link
, install
, installTo
, installData
, file
, installCabalExec
, installCabalExecTo
, installDir
, makeDebInfo
) where
import Control.Lens
import Control.Monad.State (StateT)
import Data.Generics (Data, Typeable)
import Data.Map as Map (Map)
import Data.Set as Set (insert, Set)
import Data.Text (Text)
import Debian.Changes (ChangeLog)
import Debian.Debianize.BasicInfo (Flags)
import Debian.Debianize.Prelude (listElemLens, maybeLens)
import Debian.Debianize.BinaryDebDescription (BinaryDebDescription, Canonical(canonical), newBinaryDebDescription, package)
import Debian.Debianize.CopyrightDescription (CopyrightDescription)
import qualified Debian.Debianize.SourceDebDescription as S (newSourceDebDescription, SourceDebDescription, binaryPackages)
import Debian.Debianize.VersionSplits (DebBase)
import Debian.Orphans ()
import Debian.Policy (PackageArchitectures, PackagePriority, Section, SourceFormat(..))
import Debian.Relation (BinPkgName, Relations, SrcPkgName)
import Debian.Version (DebianVersion)
import Prelude hiding (init, init, log, log)
import Text.Parsec.Rfc2822 (NameAddr)
data DebInfo
= DebInfo
{ DebInfo -> Flags
_flags :: Flags
, DebInfo -> Set Text
_warning :: Set Text
, DebInfo -> SourceFormat
_sourceFormat :: SourceFormat
, DebInfo -> Maybe Text
_watch :: Maybe Text
, DebInfo -> Maybe Text
_rulesHead :: Maybe Text
, DebInfo -> [Text]
_rulesSettings :: [Text]
, DebInfo -> [Text]
_rulesIncludes :: [Text]
, DebInfo -> Set Text
_rulesFragments :: Set Text
, DebInfo -> Maybe CopyrightDescription
_copyright :: Maybe CopyrightDescription
, DebInfo -> SourceDebDescription
_control :: S.SourceDebDescription
, DebInfo -> Set (FilePath, Text)
_intermediateFiles :: Set (FilePath, Text)
, DebInfo -> Maybe Int
_compat :: Maybe Int
, DebInfo -> Maybe ChangeLog
_changelog :: Maybe ChangeLog
, DebInfo -> Map BinPkgName Text
_installInit :: Map BinPkgName Text
, DebInfo -> Map BinPkgName (Set Text)
_logrotateStanza :: Map BinPkgName (Set Text)
, DebInfo -> Map BinPkgName Text
_postInst :: Map BinPkgName Text
, DebInfo -> Map BinPkgName Text
_postRm :: Map BinPkgName Text
, DebInfo -> Map BinPkgName Text
_preInst :: Map BinPkgName Text
, DebInfo -> Map BinPkgName Text
_preRm :: Map BinPkgName Text
, DebInfo -> Set Atom
_atomSet :: Set Atom
, DebInfo -> Bool
_noDocumentationLibrary :: Bool
, DebInfo -> Bool
_noProfilingLibrary :: Bool
, DebInfo -> Bool
_omitProfVersionDeps :: Bool
, DebInfo -> Bool
_omitLTDeps :: Bool
, DebInfo -> Maybe FilePath
_buildDir :: Maybe FilePath
, DebInfo -> Maybe SrcPkgName
_sourcePackageName :: Maybe SrcPkgName
, DebInfo -> Maybe DebBase
_overrideDebianNameBase :: Maybe DebBase
, DebInfo -> Maybe FilePath
_revision :: Maybe String
, DebInfo -> Maybe DebianVersion
_debVersion :: Maybe DebianVersion
, DebInfo -> Maybe NameAddr
_maintainerOption :: Maybe NameAddr
, DebInfo -> [NameAddr]
_uploadersOption :: [NameAddr]
, DebInfo -> Maybe FilePath
_utilsPackageNameBase :: Maybe String
, DebInfo -> Maybe Text
_xDescriptionText :: Maybe Text
, :: Maybe [[Text]]
, DebInfo -> Set BinPkgName
_missingDependencies :: Set BinPkgName
, :: Map String Relations
, DebInfo -> Map FilePath Relations
_execMap :: Map String Relations
, DebInfo -> Map BinPkgName (FilePath, FilePath, Text)
_apacheSite :: Map BinPkgName (String, FilePath, Text)
, DebInfo -> Maybe PackageArchitectures
_sourceArchitectures :: Maybe PackageArchitectures
, DebInfo -> Map BinPkgName PackageArchitectures
_binaryArchitectures :: Map BinPkgName PackageArchitectures
, DebInfo -> Maybe PackagePriority
_sourcePriority :: Maybe PackagePriority
, DebInfo -> Map BinPkgName PackagePriority
_binaryPriorities :: Map BinPkgName PackagePriority
, DebInfo -> Maybe Section
_sourceSection :: Maybe Section
, DebInfo -> Map BinPkgName Section
_binarySections :: Map BinPkgName Section
, DebInfo -> Map BinPkgName InstallFile
_executable :: Map BinPkgName InstallFile
, DebInfo -> Map BinPkgName Server
_serverInfo :: Map BinPkgName Server
, DebInfo -> Map BinPkgName Site
_website :: Map BinPkgName Site
, DebInfo -> Map BinPkgName FilePath
_backups :: Map BinPkgName String
, :: Relations
, DebInfo -> Bool
_official :: Bool
, DebInfo -> TestsStatus
_testsStatus :: TestsStatus
, DebInfo -> Bool
_allowDebianSelfBuildDeps :: Bool
} deriving (Int -> DebInfo -> ShowS
[DebInfo] -> ShowS
DebInfo -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [DebInfo] -> ShowS
$cshowList :: [DebInfo] -> ShowS
show :: DebInfo -> FilePath
$cshow :: DebInfo -> FilePath
showsPrec :: Int -> DebInfo -> ShowS
$cshowsPrec :: Int -> DebInfo -> ShowS
Show, Typeable DebInfo
DebInfo -> DataType
DebInfo -> Constr
(forall b. Data b => b -> b) -> DebInfo -> DebInfo
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DebInfo -> u
forall u. (forall d. Data d => d -> u) -> DebInfo -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DebInfo
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DebInfo -> c DebInfo
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DebInfo)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DebInfo)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DebInfo -> m DebInfo
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DebInfo -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DebInfo -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DebInfo -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DebInfo -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> DebInfo -> r
gmapT :: (forall b. Data b => b -> b) -> DebInfo -> DebInfo
$cgmapT :: (forall b. Data b => b -> b) -> DebInfo -> DebInfo
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DebInfo)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DebInfo)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DebInfo)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DebInfo)
dataTypeOf :: DebInfo -> DataType
$cdataTypeOf :: DebInfo -> DataType
toConstr :: DebInfo -> Constr
$ctoConstr :: DebInfo -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DebInfo
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DebInfo
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DebInfo -> c DebInfo
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DebInfo -> c DebInfo
Data, Typeable)
data Atom
= Link BinPkgName FilePath FilePath
| Install BinPkgName FilePath FilePath
| InstallTo BinPkgName FilePath FilePath
| InstallData BinPkgName FilePath FilePath
| File BinPkgName FilePath Text
| InstallCabalExec BinPkgName String FilePath
| InstallCabalExecTo BinPkgName String FilePath
| InstallDir BinPkgName FilePath
deriving (Int -> Atom -> ShowS
[Atom] -> ShowS
Atom -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [Atom] -> ShowS
$cshowList :: [Atom] -> ShowS
show :: Atom -> FilePath
$cshow :: Atom -> FilePath
showsPrec :: Int -> Atom -> ShowS
$cshowsPrec :: Int -> Atom -> ShowS
Show, Atom -> Atom -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Atom -> Atom -> Bool
$c/= :: Atom -> Atom -> Bool
== :: Atom -> Atom -> Bool
$c== :: Atom -> Atom -> Bool
Eq, Eq Atom
Atom -> Atom -> Bool
Atom -> Atom -> Ordering
Atom -> Atom -> Atom
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Atom -> Atom -> Atom
$cmin :: Atom -> Atom -> Atom
max :: Atom -> Atom -> Atom
$cmax :: Atom -> Atom -> Atom
>= :: Atom -> Atom -> Bool
$c>= :: Atom -> Atom -> Bool
> :: Atom -> Atom -> Bool
$c> :: Atom -> Atom -> Bool
<= :: Atom -> Atom -> Bool
$c<= :: Atom -> Atom -> Bool
< :: Atom -> Atom -> Bool
$c< :: Atom -> Atom -> Bool
compare :: Atom -> Atom -> Ordering
$ccompare :: Atom -> Atom -> Ordering
Ord, Typeable Atom
Atom -> DataType
Atom -> Constr
(forall b. Data b => b -> b) -> Atom -> Atom
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Atom -> u
forall u. (forall d. Data d => d -> u) -> Atom -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Atom
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Atom -> c Atom
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Atom)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Atom)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Atom -> m Atom
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Atom -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Atom -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Atom -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Atom -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Atom -> r
gmapT :: (forall b. Data b => b -> b) -> Atom -> Atom
$cgmapT :: (forall b. Data b => b -> b) -> Atom -> Atom
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Atom)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Atom)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Atom)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Atom)
dataTypeOf :: Atom -> DataType
$cdataTypeOf :: Atom -> DataType
toConstr :: Atom -> Constr
$ctoConstr :: Atom -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Atom
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Atom
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Atom -> c Atom
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Atom -> c Atom
Data, Typeable)
data InstallFile
= InstallFile
{ InstallFile -> FilePath
execName :: String
, InstallFile -> Maybe FilePath
sourceDir :: Maybe FilePath
, InstallFile -> Maybe FilePath
destDir :: Maybe FilePath
, InstallFile -> FilePath
destName :: String
} deriving (ReadPrec [InstallFile]
ReadPrec InstallFile
Int -> ReadS InstallFile
ReadS [InstallFile]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [InstallFile]
$creadListPrec :: ReadPrec [InstallFile]
readPrec :: ReadPrec InstallFile
$creadPrec :: ReadPrec InstallFile
readList :: ReadS [InstallFile]
$creadList :: ReadS [InstallFile]
readsPrec :: Int -> ReadS InstallFile
$creadsPrec :: Int -> ReadS InstallFile
Read, Int -> InstallFile -> ShowS
[InstallFile] -> ShowS
InstallFile -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [InstallFile] -> ShowS
$cshowList :: [InstallFile] -> ShowS
show :: InstallFile -> FilePath
$cshow :: InstallFile -> FilePath
showsPrec :: Int -> InstallFile -> ShowS
$cshowsPrec :: Int -> InstallFile -> ShowS
Show, InstallFile -> InstallFile -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: InstallFile -> InstallFile -> Bool
$c/= :: InstallFile -> InstallFile -> Bool
== :: InstallFile -> InstallFile -> Bool
$c== :: InstallFile -> InstallFile -> Bool
Eq, Eq InstallFile
InstallFile -> InstallFile -> Bool
InstallFile -> InstallFile -> Ordering
InstallFile -> InstallFile -> InstallFile
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: InstallFile -> InstallFile -> InstallFile
$cmin :: InstallFile -> InstallFile -> InstallFile
max :: InstallFile -> InstallFile -> InstallFile
$cmax :: InstallFile -> InstallFile -> InstallFile
>= :: InstallFile -> InstallFile -> Bool
$c>= :: InstallFile -> InstallFile -> Bool
> :: InstallFile -> InstallFile -> Bool
$c> :: InstallFile -> InstallFile -> Bool
<= :: InstallFile -> InstallFile -> Bool
$c<= :: InstallFile -> InstallFile -> Bool
< :: InstallFile -> InstallFile -> Bool
$c< :: InstallFile -> InstallFile -> Bool
compare :: InstallFile -> InstallFile -> Ordering
$ccompare :: InstallFile -> InstallFile -> Ordering
Ord, Typeable InstallFile
InstallFile -> DataType
InstallFile -> Constr
(forall b. Data b => b -> b) -> InstallFile -> InstallFile
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> InstallFile -> u
forall u. (forall d. Data d => d -> u) -> InstallFile -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c InstallFile
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> InstallFile -> c InstallFile
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c InstallFile)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c InstallFile)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> InstallFile -> m InstallFile
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> InstallFile -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> InstallFile -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> InstallFile -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> InstallFile -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> InstallFile -> r
gmapT :: (forall b. Data b => b -> b) -> InstallFile -> InstallFile
$cgmapT :: (forall b. Data b => b -> b) -> InstallFile -> InstallFile
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c InstallFile)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c InstallFile)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c InstallFile)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c InstallFile)
dataTypeOf :: InstallFile -> DataType
$cdataTypeOf :: InstallFile -> DataType
toConstr :: InstallFile -> Constr
$ctoConstr :: InstallFile -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c InstallFile
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c InstallFile
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> InstallFile -> c InstallFile
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> InstallFile -> c InstallFile
Data, Typeable)
data Site
= Site
{ Site -> FilePath
domain :: String
, Site -> FilePath
serverAdmin :: String
, Site -> Server
server :: Server
} deriving (ReadPrec [Site]
ReadPrec Site
Int -> ReadS Site
ReadS [Site]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Site]
$creadListPrec :: ReadPrec [Site]
readPrec :: ReadPrec Site
$creadPrec :: ReadPrec Site
readList :: ReadS [Site]
$creadList :: ReadS [Site]
readsPrec :: Int -> ReadS Site
$creadsPrec :: Int -> ReadS Site
Read, Int -> Site -> ShowS
[Site] -> ShowS
Site -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [Site] -> ShowS
$cshowList :: [Site] -> ShowS
show :: Site -> FilePath
$cshow :: Site -> FilePath
showsPrec :: Int -> Site -> ShowS
$cshowsPrec :: Int -> Site -> ShowS
Show, Site -> Site -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Site -> Site -> Bool
$c/= :: Site -> Site -> Bool
== :: Site -> Site -> Bool
$c== :: Site -> Site -> Bool
Eq, Eq Site
Site -> Site -> Bool
Site -> Site -> Ordering
Site -> Site -> Site
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Site -> Site -> Site
$cmin :: Site -> Site -> Site
max :: Site -> Site -> Site
$cmax :: Site -> Site -> Site
>= :: Site -> Site -> Bool
$c>= :: Site -> Site -> Bool
> :: Site -> Site -> Bool
$c> :: Site -> Site -> Bool
<= :: Site -> Site -> Bool
$c<= :: Site -> Site -> Bool
< :: Site -> Site -> Bool
$c< :: Site -> Site -> Bool
compare :: Site -> Site -> Ordering
$ccompare :: Site -> Site -> Ordering
Ord, Typeable Site
Site -> DataType
Site -> Constr
(forall b. Data b => b -> b) -> Site -> Site
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Site -> u
forall u. (forall d. Data d => d -> u) -> Site -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Site -> m Site
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Site -> m Site
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Site
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Site -> c Site
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Site)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Site)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Site -> m Site
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Site -> m Site
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Site -> m Site
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Site -> m Site
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Site -> m Site
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Site -> m Site
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Site -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Site -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Site -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Site -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Site -> r
gmapT :: (forall b. Data b => b -> b) -> Site -> Site
$cgmapT :: (forall b. Data b => b -> b) -> Site -> Site
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Site)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Site)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Site)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Site)
dataTypeOf :: Site -> DataType
$cdataTypeOf :: Site -> DataType
toConstr :: Site -> Constr
$ctoConstr :: Site -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Site
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Site
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Site -> c Site
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Site -> c Site
Data, Typeable)
data Server
= Server
{ Server -> FilePath
hostname :: String
, Server -> Int
port :: Int
, :: String
, Server -> FilePath
retry :: String
, Server -> [FilePath]
serverFlags :: [String]
, Server -> InstallFile
installFile :: InstallFile
} deriving (ReadPrec [Server]
ReadPrec Server
Int -> ReadS Server
ReadS [Server]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Server]
$creadListPrec :: ReadPrec [Server]
readPrec :: ReadPrec Server
$creadPrec :: ReadPrec Server
readList :: ReadS [Server]
$creadList :: ReadS [Server]
readsPrec :: Int -> ReadS Server
$creadsPrec :: Int -> ReadS Server
Read, Int -> Server -> ShowS
[Server] -> ShowS
Server -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [Server] -> ShowS
$cshowList :: [Server] -> ShowS
show :: Server -> FilePath
$cshow :: Server -> FilePath
showsPrec :: Int -> Server -> ShowS
$cshowsPrec :: Int -> Server -> ShowS
Show, Server -> Server -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Server -> Server -> Bool
$c/= :: Server -> Server -> Bool
== :: Server -> Server -> Bool
$c== :: Server -> Server -> Bool
Eq, Eq Server
Server -> Server -> Bool
Server -> Server -> Ordering
Server -> Server -> Server
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
min :: Server -> Server -> Server
$cmin :: Server -> Server -> Server
max :: Server -> Server -> Server
$cmax :: Server -> Server -> Server
>= :: Server -> Server -> Bool
$c>= :: Server -> Server -> Bool
> :: Server -> Server -> Bool
$c> :: Server -> Server -> Bool
<= :: Server -> Server -> Bool
$c<= :: Server -> Server -> Bool
< :: Server -> Server -> Bool
$c< :: Server -> Server -> Bool
compare :: Server -> Server -> Ordering
$ccompare :: Server -> Server -> Ordering
Ord, Typeable Server
Server -> DataType
Server -> Constr
(forall b. Data b => b -> b) -> Server -> Server
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Server -> u
forall u. (forall d. Data d => d -> u) -> Server -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Server -> m Server
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Server -> m Server
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Server
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Server -> c Server
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Server)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Server)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Server -> m Server
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Server -> m Server
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Server -> m Server
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Server -> m Server
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Server -> m Server
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Server -> m Server
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Server -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Server -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Server -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Server -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Server -> r
gmapT :: (forall b. Data b => b -> b) -> Server -> Server
$cgmapT :: (forall b. Data b => b -> b) -> Server -> Server
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Server)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Server)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Server)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Server)
dataTypeOf :: Server -> DataType
$cdataTypeOf :: Server -> DataType
toConstr :: Server -> Constr
$ctoConstr :: Server -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Server
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Server
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Server -> c Server
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Server -> c Server
Data, Typeable)
data TestsStatus = TestsDisable | TestsBuild | TestsRun deriving (TestsStatus -> TestsStatus -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: TestsStatus -> TestsStatus -> Bool
$c/= :: TestsStatus -> TestsStatus -> Bool
== :: TestsStatus -> TestsStatus -> Bool
$c== :: TestsStatus -> TestsStatus -> Bool
Eq, Int -> TestsStatus -> ShowS
[TestsStatus] -> ShowS
TestsStatus -> FilePath
forall a.
(Int -> a -> ShowS) -> (a -> FilePath) -> ([a] -> ShowS) -> Show a
showList :: [TestsStatus] -> ShowS
$cshowList :: [TestsStatus] -> ShowS
show :: TestsStatus -> FilePath
$cshow :: TestsStatus -> FilePath
showsPrec :: Int -> TestsStatus -> ShowS
$cshowsPrec :: Int -> TestsStatus -> ShowS
Show, Typeable TestsStatus
TestsStatus -> DataType
TestsStatus -> Constr
(forall b. Data b => b -> b) -> TestsStatus -> TestsStatus
forall a.
Typeable a
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> TestsStatus -> u
forall u. (forall d. Data d => d -> u) -> TestsStatus -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TestsStatus
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TestsStatus -> c TestsStatus
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TestsStatus)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c TestsStatus)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TestsStatus -> m TestsStatus
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TestsStatus -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TestsStatus -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> TestsStatus -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> TestsStatus -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TestsStatus -> r
gmapT :: (forall b. Data b => b -> b) -> TestsStatus -> TestsStatus
$cgmapT :: (forall b. Data b => b -> b) -> TestsStatus -> TestsStatus
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c TestsStatus)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c TestsStatus)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TestsStatus)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TestsStatus)
dataTypeOf :: TestsStatus -> DataType
$cdataTypeOf :: TestsStatus -> DataType
toConstr :: TestsStatus -> Constr
$ctoConstr :: TestsStatus -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TestsStatus
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TestsStatus
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TestsStatus -> c TestsStatus
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TestsStatus -> c TestsStatus
Data, Typeable)
makeDebInfo :: Flags -> DebInfo
makeDebInfo :: Flags -> DebInfo
makeDebInfo Flags
fs =
DebInfo
{ _flags :: Flags
_flags = Flags
fs
, _warning :: Set Text
_warning = forall a. Monoid a => a
mempty
, _sourceFormat :: SourceFormat
_sourceFormat = SourceFormat
Quilt3
, _watch :: Maybe Text
_watch = forall a. Maybe a
Nothing
, _rulesHead :: Maybe Text
_rulesHead = forall a. Maybe a
Nothing
, _rulesSettings :: [Text]
_rulesSettings = forall a. Monoid a => a
mempty
, _rulesIncludes :: [Text]
_rulesIncludes = forall a. Monoid a => a
mempty
, _rulesFragments :: Set Text
_rulesFragments = forall a. Monoid a => a
mempty
, _copyright :: Maybe CopyrightDescription
_copyright = forall a. Maybe a
Nothing
, _control :: SourceDebDescription
_control = SourceDebDescription
S.newSourceDebDescription
, _intermediateFiles :: Set (FilePath, Text)
_intermediateFiles = forall a. Monoid a => a
mempty
, _compat :: Maybe Int
_compat = forall a. Maybe a
Nothing
, _changelog :: Maybe ChangeLog
_changelog = forall a. Maybe a
Nothing
, _installInit :: Map BinPkgName Text
_installInit = forall a. Monoid a => a
mempty
, _logrotateStanza :: Map BinPkgName (Set Text)
_logrotateStanza = forall a. Monoid a => a
mempty
, _postInst :: Map BinPkgName Text
_postInst = forall a. Monoid a => a
mempty
, _postRm :: Map BinPkgName Text
_postRm = forall a. Monoid a => a
mempty
, _preInst :: Map BinPkgName Text
_preInst = forall a. Monoid a => a
mempty
, _preRm :: Map BinPkgName Text
_preRm = forall a. Monoid a => a
mempty
, _atomSet :: Set Atom
_atomSet = forall a. Monoid a => a
mempty
, _noDocumentationLibrary :: Bool
_noDocumentationLibrary = Bool
False
, _noProfilingLibrary :: Bool
_noProfilingLibrary = Bool
False
, _omitProfVersionDeps :: Bool
_omitProfVersionDeps = Bool
False
, _omitLTDeps :: Bool
_omitLTDeps = Bool
False
, _buildDir :: Maybe FilePath
_buildDir = forall a. Maybe a
Nothing
, _sourcePackageName :: Maybe SrcPkgName
_sourcePackageName = forall a. Maybe a
Nothing
, _overrideDebianNameBase :: Maybe DebBase
_overrideDebianNameBase = forall a. Maybe a
Nothing
, _revision :: Maybe FilePath
_revision = forall a. Maybe a
Nothing
, _debVersion :: Maybe DebianVersion
_debVersion = forall a. Maybe a
Nothing
, _maintainerOption :: Maybe NameAddr
_maintainerOption = forall a. Maybe a
Nothing
, _uploadersOption :: [NameAddr]
_uploadersOption = []
, _utilsPackageNameBase :: Maybe FilePath
_utilsPackageNameBase = forall a. Maybe a
Nothing
, _xDescriptionText :: Maybe Text
_xDescriptionText = forall a. Maybe a
Nothing
, _comments :: Maybe [[Text]]
_comments = forall a. Maybe a
Nothing
, _missingDependencies :: Set BinPkgName
_missingDependencies = forall a. Monoid a => a
mempty
, _extraLibMap :: Map FilePath Relations
_extraLibMap = forall a. Monoid a => a
mempty
, _execMap :: Map FilePath Relations
_execMap = forall a. Monoid a => a
mempty
, _apacheSite :: Map BinPkgName (FilePath, FilePath, Text)
_apacheSite = forall a. Monoid a => a
mempty
, _sourceArchitectures :: Maybe PackageArchitectures
_sourceArchitectures = forall a. Maybe a
Nothing
, _binaryArchitectures :: Map BinPkgName PackageArchitectures
_binaryArchitectures = forall a. Monoid a => a
mempty
, _sourcePriority :: Maybe PackagePriority
_sourcePriority = forall a. Maybe a
Nothing
, _binaryPriorities :: Map BinPkgName PackagePriority
_binaryPriorities = forall a. Monoid a => a
mempty
, _sourceSection :: Maybe Section
_sourceSection = forall a. Maybe a
Nothing
, _binarySections :: Map BinPkgName Section
_binarySections = forall a. Monoid a => a
mempty
, _executable :: Map BinPkgName InstallFile
_executable = forall a. Monoid a => a
mempty
, _serverInfo :: Map BinPkgName Server
_serverInfo = forall a. Monoid a => a
mempty
, _website :: Map BinPkgName Site
_website = forall a. Monoid a => a
mempty
, _backups :: Map BinPkgName FilePath
_backups = forall a. Monoid a => a
mempty
, _extraDevDeps :: Relations
_extraDevDeps = forall a. Monoid a => a
mempty
, _official :: Bool
_official = Bool
False
, _testsStatus :: TestsStatus
_testsStatus = TestsStatus
TestsRun
, _allowDebianSelfBuildDeps :: Bool
_allowDebianSelfBuildDeps = Bool
False
}
instance Canonical DebInfo where
canonical :: DebInfo -> DebInfo
canonical DebInfo
x = DebInfo
x {_control :: SourceDebDescription
_control = forall a. Canonical a => a -> a
canonical (DebInfo -> SourceDebDescription
_control DebInfo
x)}
$
link :: Monad m => BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
link :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
link BinPkgName
b FilePath
src FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
Link BinPkgName
b FilePath
src FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
install :: Monad m => BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
install :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
install BinPkgName
b FilePath
src FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
Install BinPkgName
b FilePath
src FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
installTo :: Monad m => BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installTo :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installTo BinPkgName
b FilePath
src FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
InstallTo BinPkgName
b FilePath
src FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
installData :: Monad m => BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installData :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installData BinPkgName
b FilePath
src FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
InstallData BinPkgName
b FilePath
src FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
file :: Monad m => BinPkgName -> FilePath -> Text -> StateT DebInfo m ()
file :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> Text -> StateT DebInfo m ()
file BinPkgName
b FilePath
dest Text
content = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> Text -> Atom
File BinPkgName
b FilePath
dest Text
content) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
installCabalExec :: Monad m => BinPkgName -> String -> FilePath -> StateT DebInfo m ()
installCabalExec :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installCabalExec BinPkgName
b FilePath
name FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
InstallCabalExec BinPkgName
b FilePath
name FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
installCabalExecTo :: Monad m => BinPkgName -> String -> FilePath -> StateT DebInfo m ()
installCabalExecTo :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> FilePath -> StateT DebInfo m ()
installCabalExecTo BinPkgName
b FilePath
name FilePath
dest = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> FilePath -> Atom
InstallCabalExecTo BinPkgName
b FilePath
name FilePath
dest) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
installDir :: Monad m => BinPkgName -> FilePath -> StateT DebInfo m ()
installDir :: forall (m :: * -> *).
Monad m =>
BinPkgName -> FilePath -> StateT DebInfo m ()
installDir BinPkgName
b FilePath
dir = Lens' DebInfo (Set Atom)
atomSet forall s (m :: * -> *) a b.
MonadState s m =>
ASetter s s a b -> (a -> b) -> m ()
%= (forall a. Ord a => a -> Set a -> Set a
Set.insert forall a b. (a -> b) -> a -> b
$ BinPkgName -> FilePath -> Atom
InstallDir BinPkgName
b FilePath
dir) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> forall (m :: * -> *) a. Monad m => a -> m a
return ()
binaryDebDescription :: BinPkgName -> Lens' DebInfo BinaryDebDescription
binaryDebDescription :: BinPkgName -> Lens' DebInfo BinaryDebDescription
binaryDebDescription BinPkgName
b =
Lens' DebInfo SourceDebDescription
control forall b c a. (b -> c) -> (a -> b) -> a -> c
. Lens' SourceDebDescription [BinaryDebDescription]
S.binaryPackages forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a. (a -> Bool) -> Lens' [a] (Maybe a)
listElemLens ((forall a. Eq a => a -> a -> Bool
== BinPkgName
b) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall s (m :: * -> *) a. MonadReader s m => Getting a s a -> m a
view Lens' BinaryDebDescription BinPkgName
package) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall a b. a -> Lens' a b -> Lens' (Maybe a) b
maybeLens (BinPkgName -> BinaryDebDescription
newBinaryDebDescription BinPkgName
b) (forall s a b t. (s -> a) -> (b -> t) -> Iso s t a b
iso forall a. a -> a
id forall a. a -> a
id)