Cabal-2.2.0.1: A framework for packaging Haskell software
Distribution.Types.Condition
data Condition c #
A boolean expression parameterized over the variable type used.
Constructors
Methods
(>>=) :: Condition a -> (a -> Condition b) -> Condition b #
(>>) :: Condition a -> Condition b -> Condition b #
return :: a -> Condition a #
fail :: String -> Condition a #
fmap :: (a -> b) -> Condition a -> Condition b #
(<$) :: a -> Condition b -> Condition a #
pure :: a -> Condition a #
(<*>) :: Condition (a -> b) -> Condition a -> Condition b #
liftA2 :: (a -> b -> c) -> Condition a -> Condition b -> Condition c #
(*>) :: Condition a -> Condition b -> Condition b #
(<*) :: Condition a -> Condition b -> Condition a #
fold :: Monoid m => Condition m -> m #
foldMap :: Monoid m => (a -> m) -> Condition a -> m #
foldr :: (a -> b -> b) -> b -> Condition a -> b #
foldr' :: (a -> b -> b) -> b -> Condition a -> b #
foldl :: (b -> a -> b) -> b -> Condition a -> b #
foldl' :: (b -> a -> b) -> b -> Condition a -> b #
foldr1 :: (a -> a -> a) -> Condition a -> a #
foldl1 :: (a -> a -> a) -> Condition a -> a #
toList :: Condition a -> [a] #
null :: Condition a -> Bool #
length :: Condition a -> Int #
elem :: Eq a => a -> Condition a -> Bool #
maximum :: Ord a => Condition a -> a #
minimum :: Ord a => Condition a -> a #
sum :: Num a => Condition a -> a #
product :: Num a => Condition a -> a #
traverse :: Applicative f => (a -> f b) -> Condition a -> f (Condition b) #
sequenceA :: Applicative f => Condition (f a) -> f (Condition a) #
mapM :: Monad m => (a -> m b) -> Condition a -> m (Condition b) #
sequence :: Monad m => Condition (m a) -> m (Condition a) #
empty :: Condition a #
(<|>) :: Condition a -> Condition a -> Condition a #
some :: Condition a -> Condition [a] #
many :: Condition a -> Condition [a] #
mzero :: Condition a #
mplus :: Condition a -> Condition a -> Condition a #
(==) :: Condition c -> Condition c -> Bool #
(/=) :: Condition c -> Condition c -> Bool #
gfoldl :: (forall d b. Data d => c0 (d -> b) -> d -> c0 b) -> (forall g. g -> c0 g) -> Condition c -> c0 (Condition c) #
gunfold :: (forall b r. Data b => c0 (b -> r) -> c0 r) -> (forall r. r -> c0 r) -> Constr -> c0 (Condition c) #
toConstr :: Condition c -> Constr #
dataTypeOf :: Condition c -> DataType #
dataCast1 :: Typeable t => (forall d. Data d => c0 (t d)) -> Maybe (c0 (Condition c)) #
dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c0 (t d e)) -> Maybe (c0 (Condition c)) #
gmapT :: (forall b. Data b => b -> b) -> Condition c -> Condition c #
gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Condition c -> r #
gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Condition c -> r #
gmapQ :: (forall d. Data d => d -> u) -> Condition c -> [u] #
gmapQi :: Int -> (forall d. Data d => d -> u) -> Condition c -> u #
gmapM :: Monad m => (forall d. Data d => d -> m d) -> Condition c -> m (Condition c) #
gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Condition c -> m (Condition c) #
gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Condition c -> m (Condition c) #
showsPrec :: Int -> Condition c -> ShowS #
show :: Condition c -> String #
showList :: [Condition c] -> ShowS #
Associated Types
type Rep (Condition c) :: * -> * #
from :: Condition c -> Rep (Condition c) x #
to :: Rep (Condition c) x -> Condition c #
(<>) :: Condition a -> Condition a -> Condition a #
sconcat :: NonEmpty (Condition a) -> Condition a #
stimes :: Integral b => b -> Condition a -> Condition a #
mempty :: Condition a #
mappend :: Condition a -> Condition a -> Condition a #
mconcat :: [Condition a] -> Condition a #
put :: Condition c -> Put #
get :: Get (Condition c) #
putList :: [Condition c] -> Put #
rnf :: Condition c -> () #
cNot :: Condition a -> Condition a #
Boolean negation of a Condition value.
Condition
cAnd :: Condition a -> Condition a -> Condition a #
Boolean AND of two Condtion values.
Condtion
cOr :: Eq v => Condition v -> Condition v -> Condition v #
Boolean OR of two Condition values.
simplifyCondition #
Arguments
(partial) variable assignment
Simplify the condition and return its free variables.