Data.Set.Lifted

Documentation

data Set a

Instances

Foldable Set

Methods

fold :: Monoid m => Set m -> m

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

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

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

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

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

foldr1 :: (a -> a -> a) -> Set a -> a

foldl1 :: (a -> a -> a) -> Set a -> a

toList :: Set a -> [a]

null :: Set a -> Bool

length :: Set a -> Int

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

maximum :: Ord a => Set a -> a

minimum :: Ord a => Set a -> a

sum :: Num a => Set a -> a

product :: Num a => Set a -> a

Eq1 Set

Methods

liftEq :: (a -> b -> Bool) -> Set a -> Set b -> Bool

Show1 Set

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS

Ord a => IsList (Set a)

Associated Types

type Item (Set a) :: *

Methods

fromList :: [Item (Set a)] -> Set a

fromListN :: Int -> [Item (Set a)] -> Set a

toList :: Set a -> [Item (Set a)]

Eq a => Eq (Set a)

Methods

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

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

Ord a => Ord (Set a)

Methods

compare :: Set a -> Set a -> Ordering

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

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

(>) :: Set a -> Set a -> Bool

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

max :: Set a -> Set a -> Set a

min :: Set a -> Set a -> Set a

Show a => Show (Set a)

Methods

showsPrec :: Int -> Set a -> ShowS

show :: Set a -> String

showList :: [Set a] -> ShowS

Ord a => Semigroup (Set a)

Methods

(<>) :: Set a -> Set a -> Set a

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

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

Ord a => Monoid (Set a)

Methods

mempty :: Set a

mappend :: Set a -> Set a -> Set a

mconcat :: [Set a] -> Set a

PrimUnlifted (Set a)

Methods

toArrayArray# :: Set a -> ArrayArray#

fromArrayArray# :: ArrayArray# -> Set a

type Item (Set a)

type Item (Set a) = a

singleton :: a -> Set a

Construct a set with a single element.

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

Test whether or not an element is present in a set.

size :: Set a -> Int

The number of elements in the set.

difference :: Ord a => Set a -> Set a -> Set a

The difference of two sets.

(\\) :: Ord a => Set a -> Set a -> Set a

Infix operator for difference.

List Conversion

toList :: Set a -> [a]

Convert a set to a list. The elements are given in ascending order.

fromList :: Ord a => [a] -> Set a

Convert a list to a set.

Folds

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

Right fold over the elements in the set. This is lazy in the accumulator.

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

Strict left fold over the elements in the set.

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

Strict right fold over the elements in the set.

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

Strict monoidal fold over the elements in the set.