Safe Haskell	None
Language	Haskell2010

Data.Set.Unboxed

Contents

List Conversion
Folds
Traversals

Synopsis

data Set a
empty :: Set a
singleton :: Prim a => a -> Set a
doubleton :: (Prim a, Ord a) => a -> a -> Set a
tripleton :: (Prim a, Ord a) => a -> a -> a -> Set a
null :: Set a -> Bool
member :: (Prim a, Ord a) => a -> Set a -> Bool
size :: Prim a => Set a -> Int
difference :: (Ord a, Prim a) => Set a -> Set a -> Set a
(\\) :: (Ord a, Prim a) => Set a -> Set a -> Set a
intersection :: (Ord a, Prim a) => Set a -> Set a -> Set a
subset :: (Ord a, Prim a) => Set a -> Set a -> Bool
enumFromTo :: (Enum a, Ord a, Num a, Prim a) => a -> a -> Set a
toList :: Prim a => Set a -> [a]
fromList :: (Ord a, Prim a) => [a] -> Set a
toArray :: Set a -> PrimArray a
foldr :: Prim a => (a -> b -> b) -> b -> Set a -> b
foldMap :: (Monoid m, Prim a) => (a -> m) -> Set a -> m
foldl' :: Prim a => (b -> a -> b) -> b -> Set a -> b
foldr' :: Prim a => (a -> b -> b) -> b -> Set a -> b
foldMap' :: (Monoid m, Prim a) => (a -> m) -> Set a -> m
traverse_ :: (Applicative m, Prim a) => (a -> m b) -> Set a -> m ()
itraverse_ :: (Applicative m, Prim a) => (Int -> a -> m b) -> Set a -> m ()
mapMonotonic :: (Prim a, Prim b) => (a -> b) -> Set a -> Set b

Documentation

data Set a Source #

A set of elements.

Instances

(Prim a, Ord a) => IsList (Set a) Source #	The functions that convert a list to a `Set` are asymptotically better that using `foldMap singleton`, with a cost of O(nlog 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`.
Instance details Defined in Data.Set.Unboxed.Internal Associated Types type Item (Set a) :: Type # 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) Source #
Instance details Defined in Data.Set.Unboxed.Internal Methods (==) :: Set a -> Set a -> Bool # (/=) :: Set a -> Set a -> Bool #
(Prim a, Ord a) => Ord (Set a) Source #
Instance details Defined in Data.Set.Unboxed.Internal 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) Source #
Instance details Defined in Data.Set.Unboxed.Internal Methods showsPrec :: Int -> Set a -> ShowS # show :: Set a -> String # showList :: [Set a] -> ShowS #
(Prim a, Ord a) => Semigroup (Set a) Source #
Instance details Defined in Data.Set.Unboxed.Internal 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) Source #
Instance details Defined in Data.Set.Unboxed.Internal Methods mempty :: Set a # mappend :: Set a -> Set a -> Set a # mconcat :: [Set a] -> Set a #
(Hashable a, Prim a) => Hashable (Set a) Source #
Instance details Defined in Data.Set.Unboxed.Internal Methods hashWithSalt :: Int -> Set a -> Int # hash :: Set a -> Int #
PrimUnlifted (Set a) Source #
Instance details Defined in Data.Set.Unboxed.Internal Methods toArrayArray# :: Set a -> ArrayArray# # fromArrayArray# :: ArrayArray# -> Set a #
type Item (Set a) Source #
Instance details Defined in Data.Set.Unboxed.Internal type Item (Set a) = a