Cabal-3.3.0.0: A framework for packaging Haskell software
Safe HaskellNone
LanguageHaskell2010

Distribution.Compat.NonEmptySet

Synopsis

Documentation

data NonEmptySet a Source #

Instances

Instances details
Foldable NonEmptySet # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Methods

fold :: Monoid m => NonEmptySet m -> m Source #

foldMap :: Monoid m => (a -> m) -> NonEmptySet a -> m Source #

foldMap' :: Monoid m => (a -> m) -> NonEmptySet a -> m Source #

foldr :: (a -> b -> b) -> b -> NonEmptySet a -> b Source #

foldr' :: (a -> b -> b) -> b -> NonEmptySet a -> b Source #

foldl :: (b -> a -> b) -> b -> NonEmptySet a -> b Source #

foldl' :: (b -> a -> b) -> b -> NonEmptySet a -> b Source #

foldr1 :: (a -> a -> a) -> NonEmptySet a -> a Source #

foldl1 :: (a -> a -> a) -> NonEmptySet a -> a Source #

toList :: NonEmptySet a -> [a] Source #

null :: NonEmptySet a -> Bool Source #

length :: NonEmptySet a -> Int Source #

elem :: Eq a => a -> NonEmptySet a -> Bool Source #

maximum :: Ord a => NonEmptySet a -> a Source #

minimum :: Ord a => NonEmptySet a -> a Source #

sum :: Num a => NonEmptySet a -> a Source #

product :: Num a => NonEmptySet a -> a Source #

Eq a => Eq (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

(Data a, Ord a) => Data (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonEmptySet a -> c (NonEmptySet a) Source #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonEmptySet a) Source #

toConstr :: NonEmptySet a -> Constr Source #

dataTypeOf :: NonEmptySet a -> DataType Source #

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonEmptySet a)) Source #

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonEmptySet a)) Source #

gmapT :: (forall b. Data b => b -> b) -> NonEmptySet a -> NonEmptySet a Source #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonEmptySet a -> r Source #

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonEmptySet a -> r Source #

gmapQ :: (forall d. Data d => d -> u) -> NonEmptySet a -> [u] Source #

gmapQi :: Int -> (forall d. Data d => d -> u) -> NonEmptySet a -> u Source #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonEmptySet a -> m (NonEmptySet a) Source #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmptySet a -> m (NonEmptySet a) Source #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmptySet a -> m (NonEmptySet a) Source #

Ord a => Ord (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

(Read a, Ord a) => Read (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Show a => Show (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Ord a => Semigroup (NonEmptySet a) #

Note: there aren't Monoid instance.

Instance details

Defined in Distribution.Compat.NonEmptySet

Binary a => Binary (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

NFData a => NFData (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Methods

rnf :: NonEmptySet a -> () Source #

Structured a => Structured (NonEmptySet a) # 
Instance details

Defined in Distribution.Compat.NonEmptySet

Construction

Insertion

Deletion

Conversions

Query

member :: Ord a => a -> NonEmptySet a -> Bool Source #

Map

map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b Source #