HaskellCI.Project

Handling of cabal.project file

Documentation

data Project b a

Constructors

Project

Fields

• prjPackages :: [a]
• prjOptPackages :: [b]
• prjConstraints :: [String]
• prjAllowNewer :: [String]
• prjReorderGoals :: Bool
• prjMaxBackjumps :: Maybe Int
• prjOptimization :: Optimization
• prjSourceRepos :: [SourceRepo]
• prjOrigFields :: [PrettyField ()]

Instances

Bitraversable Project

Defined in HaskellCI.Project

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Project a b -> f (Project c d)

Bifoldable Project

Defined in HaskellCI.Project

Methods

bifold :: Monoid m => Project m m -> m

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Project a b -> m

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Project a b -> c

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Project a b -> c

Bifunctor Project

Defined in HaskellCI.Project

Methods

bimap :: (a -> b) -> (c -> d) -> Project a c -> Project b d

first :: (a -> b) -> Project a c -> Project b c

second :: (b -> c) -> Project a b -> Project a c

Functor (Project b)

Defined in HaskellCI.Project

Methods

fmap :: (a -> b0) -> Project b a -> Project b b0

(<$) :: a -> Project b b0 -> Project b a

Foldable (Project b)

Defined in HaskellCI.Project

Methods

fold :: Monoid m => Project b m -> m

foldMap :: Monoid m => (a -> m) -> Project b a -> m

foldr :: (a -> b0 -> b0) -> b0 -> Project b a -> b0

foldr' :: (a -> b0 -> b0) -> b0 -> Project b a -> b0

foldl :: (b0 -> a -> b0) -> b0 -> Project b a -> b0

foldl' :: (b0 -> a -> b0) -> b0 -> Project b a -> b0

foldr1 :: (a -> a -> a) -> Project b a -> a

foldl1 :: (a -> a -> a) -> Project b a -> a

toList :: Project b a -> [a]

null :: Project b a -> Bool

length :: Project b a -> Int

elem :: Eq a => a -> Project b a -> Bool

maximum :: Ord a => Project b a -> a

minimum :: Ord a => Project b a -> a

sum :: Num a => Project b a -> a

product :: Num a => Project b a -> a

Traversable (Project b)

Defined in HaskellCI.Project

Methods

traverse :: Applicative f => (a -> f b0) -> Project b a -> f (Project b b0)

sequenceA :: Applicative f => Project b (f a) -> f (Project b a)

mapM :: Monad m => (a -> m b0) -> Project b a -> m (Project b b0)

sequence :: Monad m => Project b (m a) -> m (Project b a)

Generic (Project b a)

Defined in HaskellCI.Project

Associated Types

type Rep (Project b a) :: Type -> Type

Methods

from :: Project b a -> Rep (Project b a) x

to :: Rep (Project b a) x -> Project b a

type Rep (Project b a)

Defined in HaskellCI.Project

type Rep (Project b a) = D1 (MetaData "Project" "HaskellCI.Project" "haskell-ci-0.4-KU2AI42Kg2sJoA7jGQLg3o-haskell-ci-internal" False) (C1 (MetaCons "Project" PrefixI True) (((S1 (MetaSel (Just "prjPackages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [a]) :*: S1 (MetaSel (Just "prjOptPackages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [b])) :*: (S1 (MetaSel (Just "prjConstraints") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [String]) :*: S1 (MetaSel (Just "prjAllowNewer") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [String]))) :*: ((S1 (MetaSel (Just "prjReorderGoals") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Bool) :*: S1 (MetaSel (Just "prjMaxBackjumps") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Maybe Int))) :*: (S1 (MetaSel (Just "prjOptimization") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Optimization) :*: (S1 (MetaSel (Just "prjSourceRepos") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [SourceRepo]) :*: S1 (MetaSel (Just "prjOrigFields") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [PrettyField ()]))))))

emptyProject :: Project b a

parseProjectFile :: FilePath -> ByteString -> Either String (Project String String)

Parse project file. Extracts only few fields.

>>> fmap prjPackages $ parseProjectFile "cabal.project" "packages: foo bar/*.cabal"
Right ["foo","bar/*.cabal"]