primitive-containers-0.3.1: containers backed by arrays

Safe HaskellNone
LanguageHaskell2010

Data.Diet.Unbounded.Set.Lifted

Synopsis

Documentation

data Set a Source #

Instances
Eq a => Eq (Set a) Source # 
Instance details

Defined in Data.Diet.Unbounded.Set.Lifted

Methods

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

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

Show a => Show (Set a) Source # 
Instance details

Defined in Data.Diet.Unbounded.Set.Lifted

Methods

showsPrec :: Int -> Set a -> ShowS #

show :: Set a -> String #

showList :: [Set a] -> ShowS #

(Ord a, Enum a) => Semigroup (Set a) Source # 
Instance details

Defined in Data.Diet.Unbounded.Set.Lifted

Methods

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

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

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

(Ord a, Enum a) => Monoid (Set a) Source # 
Instance details

Defined in Data.Diet.Unbounded.Set.Lifted

Methods

mempty :: Set a #

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

mconcat :: [Set a] -> Set a #

singleton Source #

Arguments

:: Ord a 
=> Maybe a

lower inclusive bound, Nothing means -∞

-> Maybe a

upper inclusive bound, Nothing means +∞

-> Set a 

O(1) Create an unbounded diet set with a single element.

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

O(log n) Returns True if the element is a member of the diet set.