Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
A boolean expression parameterized over the variable type used.
Instances
Foldable Condition Source # | |
Defined in Distribution.Types.Condition fold :: Monoid m => Condition m -> m foldMap :: Monoid m => (a -> m) -> Condition a -> 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] # length :: Condition a -> Int # elem :: Eq a => a -> Condition a -> Bool # maximum :: Ord a => Condition a -> a # minimum :: Ord a => Condition a -> a # | |
Traversable Condition Source # | |
Defined in Distribution.Types.Condition | |
Alternative Condition Source # | |
Applicative Condition Source # | |
Functor Condition Source # | |
Monad Condition Source # | |
MonadPlus Condition Source # | |
Structured c => Structured (Condition c) Source # | |
Defined in Distribution.Types.Condition | |
Data c => Data (Condition c) Source # | |
Defined in Distribution.Types.Condition 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 :: forall r r'. (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) | |
Monoid (Condition a) Source # | |
Semigroup (Condition a) Source # | |
Generic (Condition c) Source # | |
Show c => Show (Condition c) Source # | |
Binary c => Binary (Condition c) Source # | |
NFData c => NFData (Condition c) Source # | |
Defined in Distribution.Types.Condition | |
Eq c => Eq (Condition c) Source # | |
type Rep (Condition c) Source # | |
Defined in Distribution.Types.Condition type Rep (Condition c) = D1 ('MetaData "Condition" "Distribution.Types.Condition" "Cabal-syntax-3.13.0.0-inplace" 'False) ((C1 ('MetaCons "Var" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 c)) :+: C1 ('MetaCons "Lit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Bool))) :+: (C1 ('MetaCons "CNot" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Condition c))) :+: (C1 ('MetaCons "COr" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Condition c)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Condition c))) :+: C1 ('MetaCons "CAnd" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Condition c)) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Condition c)))))) |