Copyright	© 2018-2020 IOHK
License	Apache-2.0
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Set.Strict.NonEmptySet

Contents

Type
Construction
Deconstruction
Insertion
Deletion
Membership
Combination

Description

Provides a strict implementation of a non-empty set.

Synopsis

data NonEmptySet a
fromList :: Ord a => NonEmpty a -> NonEmptySet a
fromSet :: Set a -> Maybe ( NonEmptySet a)
singleton :: Ord a => a -> NonEmptySet a
toList :: NonEmptySet a -> NonEmpty a
toSet :: Ord a => NonEmptySet a -> Set a
insert :: Ord a => a -> NonEmptySet a -> NonEmptySet a
delete :: Ord a => a -> NonEmptySet a -> Maybe ( NonEmptySet a)
member :: Ord a => a -> NonEmptySet a -> Bool
union :: Ord a => NonEmptySet a -> NonEmptySet a -> NonEmptySet a

Type

data NonEmptySet a Source #

A non-empty set of elements of type a .

Instances

Instances details

Foldable NonEmptySet Source #
Instance details Defined in Data.Set.Strict.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) Source #
Instance details Defined in Data.Set.Strict.NonEmptySet Methods (==) :: NonEmptySet a -> NonEmptySet a -> Bool Source # (/=) :: NonEmptySet a -> NonEmptySet a -> Bool Source #
( Read a, Ord a) => Read ( NonEmptySet a) Source #
Instance details Defined in Data.Set.Strict.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) Source #
Instance details Defined in Data.Set.Strict.NonEmptySet Methods showsPrec :: Int -> NonEmptySet a -> ShowS Source # show :: NonEmptySet a -> String Source # showList :: [ NonEmptySet a] -> ShowS Source #
Generic ( NonEmptySet a) Source #
Instance details Defined in Data.Set.Strict.NonEmptySet Associated Types type Rep ( NonEmptySet a) :: Type -> Type Source # Methods from :: NonEmptySet a -> Rep ( NonEmptySet a) x Source # to :: Rep ( NonEmptySet a) x -> NonEmptySet a Source #
NFData a => NFData ( NonEmptySet a) Source #
Instance details Defined in Data.Set.Strict.NonEmptySet Methods rnf :: NonEmptySet a -> () Source #
type Rep ( NonEmptySet a) Source #
Instance details Defined in Data.Set.Strict.NonEmptySet type Rep ( NonEmptySet a) = D1 (' MetaData "NonEmptySet" "Data.Set.Strict.NonEmptySet" "strict-non-empty-containers-2020.12.8-EzSwiBLeHy9D9DK6mxAncD" ' True ) ( C1 (' MetaCons "NonEmptySet" ' PrefixI ' True ) ( S1 (' MetaSel (' Just "elements") ' NoSourceUnpackedness ' NoSourceStrictness ' DecidedLazy ) ( Rec0 ( NonEmptyMap a ()))))

Construction

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

fromSet :: Set a -> Maybe ( NonEmptySet a) Source #

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

Deconstruction

toList :: NonEmptySet a -> NonEmpty a Source #

toSet :: Ord a => NonEmptySet a -> Set a Source #

Insertion

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

Deletion

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

Membership

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

Combination

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