Data.Set.Unboxed

Documentation

data Set a

A set of elements.

Instances

(Prim a, Ord a) => IsList (Set a)

The functions that convert a list to a Set are asymptotically better that using foldMap singleton, with a cost of O(n*log n) rather than O(n^2). If the input list is sorted, even if duplicate elements are present, the algorithm further improves to O(n). The fastest option available is calling fromListN on a presorted list and passing the correct size size of the resulting Set. However, even if an incorrect size is given to this function, it will still correctly convert the list into a Set.

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)]

(Prim a, Eq a) => Eq (Set a)

Methods

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

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

(Prim a, 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

(Prim a, Show a) => Show (Set a)

Methods

showsPrec :: Int -> Set a -> ShowS

show :: Set a -> String

showList :: [Set a] -> ShowS

(Prim a, 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

(Prim 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 :: Prim a => a -> Set a

Construct a set with a single element.

member :: (Prim a, Ord a) => a -> Set a -> Bool

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

size :: Prim a => Set a -> Int

The number of elements in the set.

difference :: (Ord a, Prim a) => Set a -> Set a -> Set a

The difference of two sets.

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

Infix operator for difference.

List Conversion

toList :: Prim a => Set a -> [a]

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

fromList :: (Ord a, Prim a) => [a] -> Set a

Convert a list to a set.

Folds

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

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

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

Strict left fold over the elements in the set.

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

Strict right fold over the elements in the set.

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

Strict monoidal fold over the elements in the set.