Data.Continuous.Set.Lifted

Documentation

data Set a

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)

Defined in Data.Continuous.Set.Lifted

Methods

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

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

Show a => Show (Set a)

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)

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)

Defined in Data.Continuous.Set.Lifted

Methods

mempty :: Set a

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

mconcat :: [Set a] -> Set a

data Inclusivity

Constructors

Exclusive

Inclusive

Instances

Eq Inclusivity

Defined in Data.Continuous.Set.Internal

Methods

(==) :: Inclusivity -> Inclusivity -> Bool

(/=) :: Inclusivity -> Inclusivity -> Bool

Ord Inclusivity

Defined in Data.Continuous.Set.Internal

Methods

compare :: Inclusivity -> Inclusivity -> Ordering

(<) :: Inclusivity -> Inclusivity -> Bool

(<=) :: Inclusivity -> Inclusivity -> Bool

(>) :: Inclusivity -> Inclusivity -> Bool

(>=) :: Inclusivity -> Inclusivity -> Bool

max :: Inclusivity -> Inclusivity -> Inclusivity

min :: Inclusivity -> Inclusivity -> Inclusivity

Read Inclusivity

Defined in Data.Continuous.Set.Internal

Methods

readsPrec :: Int -> ReadS Inclusivity

readList :: ReadS [Inclusivity]

readPrec :: ReadPrec Inclusivity

readListPrec :: ReadPrec [Inclusivity]

Show Inclusivity

Defined in Data.Continuous.Set.Internal

Methods

showsPrec :: Int -> Inclusivity -> ShowS

show :: Inclusivity -> String

showList :: [Inclusivity] -> ShowS

singleton

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

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

empty :: Set a

universe :: Set a

null :: Set a -> Bool

universal :: Set a -> Bool