Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Continuous.Set.Lifted

Synopsis

Documentation

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 details

(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 #
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 #
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 #
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 #

Constructors

Exclusive
Inclusive

Instances details

Read Inclusivity Source #
Instance details Defined in Data.Continuous.Set.Internal Methods readsPrec :: Int -> ReadS Inclusivity # readList :: ReadS [Inclusivity] # readPrec :: ReadPrec Inclusivity # readListPrec :: ReadPrec [Inclusivity] #
Show Inclusivity Source #
Instance details Defined in Data.Continuous.Set.Internal Methods showsPrec :: Int -> Inclusivity -> ShowS # show :: Inclusivity -> String # showList :: [Inclusivity] -> ShowS #
Eq Inclusivity Source #
Instance details Defined in Data.Continuous.Set.Internal Methods (==) :: Inclusivity -> Inclusivity -> Bool # (/=) :: Inclusivity -> Inclusivity -> Bool #
Ord Inclusivity Source #
Instance details 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 #

Arguments

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

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