Safe Haskell	None
Language	Haskell2010

Distribution.Compat.NonEmptySet

Contents

Construction
Insertion
Deletion
Conversions
Query
Map

Synopsis

data NonEmptySet a
singleton :: a -> NonEmptySet a
insert :: Ord a => a -> NonEmptySet a -> NonEmptySet a
delete :: Ord a => a -> NonEmptySet a -> Maybe (NonEmptySet a)
toNonEmpty :: NonEmptySet a -> NonEmpty a
fromNonEmpty :: Ord a => NonEmpty a -> NonEmptySet a
toList :: NonEmptySet a -> [a]
toSet :: NonEmptySet a -> Set a
member :: Ord a => a -> NonEmptySet a -> Bool
map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b

Documentation

data NonEmptySet a Source #

Since: Cabal-3.4.0.0

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 Methods (==) :: NonEmptySet a -> NonEmptySet a -> Bool # (/=) :: NonEmptySet a -> NonEmptySet a -> Bool #
(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 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) #
Instance details Defined in Distribution.Compat.NonEmptySet Methods readsPrec :: Int -> ReadS (NonEmptySet a) Source # readList :: ReadS [NonEmptySet a] Source # readPrec :: ReadPrec (NonEmptySet a) Source # readListPrec :: ReadPrec [NonEmptySet a] Source #
Show a => Show (NonEmptySet a) #
Instance details Defined in Distribution.Compat.NonEmptySet Methods showsPrec :: Int -> NonEmptySet a -> ShowS Source # show :: NonEmptySet a -> String Source # showList :: [NonEmptySet a] -> ShowS Source #
Ord a => Semigroup (NonEmptySet a) #	Note: there aren't `Monoid` instance.
Instance details Defined in Distribution.Compat.NonEmptySet Methods (<>) :: NonEmptySet a -> NonEmptySet a -> NonEmptySet a Source # sconcat :: NonEmpty (NonEmptySet a) -> NonEmptySet a Source # stimes :: Integral b => b -> NonEmptySet a -> NonEmptySet a Source #
Binary a => Binary (NonEmptySet a) #
Instance details Defined in Distribution.Compat.NonEmptySet Methods put :: NonEmptySet a -> Put Source # get :: Get (NonEmptySet a) Source # putList :: [NonEmptySet a] -> Put Source #
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 Methods structure :: Proxy (NonEmptySet a) -> Structure Source # structureHash' :: Tagged (NonEmptySet a) MD5

Construction

singleton :: a -> NonEmptySet a Source #

Insertion

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

Deletion

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

Conversions

toNonEmpty :: NonEmptySet a -> NonEmpty a Source #

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

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

toSet :: NonEmptySet a -> Set a Source #

Query

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

Map

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