primitive-containers-0.3.1: containers backed by arrays

Safe HaskellNone
LanguageHaskell2010

Data.Continuous.Set.Lifted

Synopsis

Documentation

data Set a Source #

A diet set. Currently, the data constructor for this type is exported. Please do not use it. It will be moved to an internal module at some point.

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

Defined in Data.Continuous.Set.Lifted

Methods

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

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

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

Defined in Data.Continuous.Set.Lifted

Methods

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

show :: Set a -> String #

showList :: [Set a] -> ShowS #

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

Defined in Data.Continuous.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.Continuous.Set.Lifted

Methods

mempty :: Set a #

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

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

singleton Source #

Arguments

:: Ord a 
=> Maybe (Inclusivity, a)

lower bound

-> Maybe (Inclusivity, a)

upper bound

-> Set a 

O(1) Create a continuous interval set with a single interval.

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

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

null :: Set a -> Bool Source #