Distribution.Compat.NonEmptySet

Documentation

data NonEmptySet a

Since: 3.4.0.0

Instances

Foldable NonEmptySet

Defined in Distribution.Compat.NonEmptySet

Methods

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

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

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

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

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

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

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

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

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

toList :: NonEmptySet a -> [a]

null :: NonEmptySet a -> Bool

length :: NonEmptySet a -> Int

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

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

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

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

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

Eq a => Eq (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

(==) :: NonEmptySet a -> NonEmptySet a -> Bool

(/=) :: NonEmptySet a -> NonEmptySet a -> Bool

(Data a, Ord a) => Data (NonEmptySet a)

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)

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

toConstr :: NonEmptySet a -> Constr

dataTypeOf :: NonEmptySet a -> DataType

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

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

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

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

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

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

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

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

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

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

Ord a => Ord (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

compare :: NonEmptySet a -> NonEmptySet a -> Ordering

(<) :: NonEmptySet a -> NonEmptySet a -> Bool

(<=) :: NonEmptySet a -> NonEmptySet a -> Bool

(>) :: NonEmptySet a -> NonEmptySet a -> Bool

(>=) :: NonEmptySet a -> NonEmptySet a -> Bool

max :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a

min :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a

(Read a, Ord a) => Read (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

readsPrec :: Int -> ReadS (NonEmptySet a)

readList :: ReadS [NonEmptySet a]

readPrec :: ReadPrec (NonEmptySet a)

readListPrec :: ReadPrec [NonEmptySet a]

Show a => Show (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

showsPrec :: Int -> NonEmptySet a -> ShowS

show :: NonEmptySet a -> String

showList :: [NonEmptySet a] -> ShowS

Ord a => Semigroup (NonEmptySet a)

Note: there aren't Monoid instance.

Defined in Distribution.Compat.NonEmptySet

Methods

(<>) :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a

sconcat :: NonEmpty (NonEmptySet a) -> NonEmptySet a

stimes :: Integral b => b -> NonEmptySet a -> NonEmptySet a

Binary a => Binary (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

put :: NonEmptySet a -> Put

get :: Get (NonEmptySet a)

putList :: [NonEmptySet a] -> Put

NFData a => NFData (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

rnf :: NonEmptySet a -> ()

Structured a => Structured (NonEmptySet a)

Defined in Distribution.Compat.NonEmptySet

Methods

structure :: Proxy (NonEmptySet a) -> Structure

structureHash' :: Tagged (NonEmptySet a) MD5

Construction

singleton :: a -> NonEmptySet a

Insertion

insert :: Ord a => a -> NonEmptySet a -> NonEmptySet a

Deletion

delete :: Ord a => a -> NonEmptySet a -> Maybe (NonEmptySet a)

Conversions

toNonEmpty :: NonEmptySet a -> NonEmpty a

fromNonEmpty :: Ord a => NonEmpty a -> NonEmptySet a

toList :: NonEmptySet a -> [a]

toSet :: NonEmptySet a -> Set a

Query

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

Map

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