IntervalAlgebra.PairedInterval

Documentation

data PairedInterval b a

An Interval a paired with some other data of type b.

Instances

Bifunctor PairedInterval

Defined in IntervalAlgebra.PairedInterval

Methods

bimap :: (a -> b) -> (c -> d) -> PairedInterval a c -> PairedInterval b d

first :: (a -> b) -> PairedInterval a c -> PairedInterval b c

second :: (b -> c) -> PairedInterval a b -> PairedInterval a c

Functor (PairedInterval b)

Defined in IntervalAlgebra.PairedInterval

Methods

fmap :: (a -> b0) -> PairedInterval b a -> PairedInterval b b0

(<$) :: a -> PairedInterval b b0 -> PairedInterval b a

(Ord a, Eq b, Monoid b) => IntervalCombinable (PairedInterval b) a

Defined in IntervalAlgebra.PairedInterval

Methods

(.+.) :: PairedInterval b a -> PairedInterval b a -> Maybe (PairedInterval b a)

(><) :: PairedInterval b a -> PairedInterval b a -> Maybe (PairedInterval b a)

(<+>) :: (Semigroup (f (PairedInterval b a)), Applicative f) => PairedInterval b a -> PairedInterval b a -> f (PairedInterval b a)

Ord a => Intervallic (PairedInterval b) a

Defined in IntervalAlgebra.PairedInterval

Methods

getInterval :: PairedInterval b a -> Interval a

setInterval :: PairedInterval b a -> Interval a -> PairedInterval b a

(Eq a, Eq b) => Eq (PairedInterval b a)

Defined in IntervalAlgebra.PairedInterval

Methods

(==) :: PairedInterval b a -> PairedInterval b a -> Bool

(/=) :: PairedInterval b a -> PairedInterval b a -> Bool

(Eq a, Eq b, Ord a) => Ord (PairedInterval b a)

Defines A total ordering on 'PairedInterval b a' based on the 'Interval a' part.

Defined in IntervalAlgebra.PairedInterval

Methods

compare :: PairedInterval b a -> PairedInterval b a -> Ordering

(<) :: PairedInterval b a -> PairedInterval b a -> Bool

(<=) :: PairedInterval b a -> PairedInterval b a -> Bool

(>) :: PairedInterval b a -> PairedInterval b a -> Bool

(>=) :: PairedInterval b a -> PairedInterval b a -> Bool

max :: PairedInterval b a -> PairedInterval b a -> PairedInterval b a

min :: PairedInterval b a -> PairedInterval b a -> PairedInterval b a

(Show b, Show a, Ord a) => Show (PairedInterval b a)

Defined in IntervalAlgebra.PairedInterval

Methods

showsPrec :: Int -> PairedInterval b a -> ShowS

show :: PairedInterval b a -> String

showList :: [PairedInterval b a] -> ShowS

data Empty

Empty is used to trivially lift an Interval a into a PairedInterval.

Constructors

Empty

Instances

Eq Empty

Defined in IntervalAlgebra.PairedInterval

Methods

(==) :: Empty -> Empty -> Bool

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

Ord Empty

Defined in IntervalAlgebra.PairedInterval

Methods

compare :: Empty -> Empty -> Ordering

(<) :: Empty -> Empty -> Bool

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

(>) :: Empty -> Empty -> Bool

(>=) :: Empty -> Empty -> Bool

max :: Empty -> Empty -> Empty

min :: Empty -> Empty -> Empty

Show Empty

Defined in IntervalAlgebra.PairedInterval

Methods

showsPrec :: Int -> Empty -> ShowS

show :: Empty -> String

showList :: [Empty] -> ShowS

Semigroup Empty

Defined in IntervalAlgebra.PairedInterval

Methods

(<>) :: Empty -> Empty -> Empty

sconcat :: NonEmpty Empty -> Empty

stimes :: Integral b => b -> Empty -> Empty

Monoid Empty

Defined in IntervalAlgebra.PairedInterval

Methods

mempty :: Empty

mappend :: Empty -> Empty -> Empty

mconcat :: [Empty] -> Empty

makePairedInterval :: b -> Interval a -> PairedInterval b a

Make a paired interval.

getPairData :: PairedInterval b a -> b

Gets the data (i.e. non-interval) part of a PairedInterval.

intervals :: (Ord a, Functor f) => f (PairedInterval b a) -> f (Interval a)

Gets the intervals from a list of paired intervals.

equalPairData :: Eq b => ComparativePredicateOf1 (PairedInterval b a)

Tests for equality of the data in a PairedInterval.

toTrivialPair :: Interval a -> PairedInterval Empty a

Lifts an Interval a into a PairedInterval Empty a, where Empty is a trivial type that contains no data.

trivialize :: Functor f => f (Interval a) -> f (PairedInterval Empty a)

Lifts a Functor containing Interval a(s) into a Functor containing PairedInterval Empty a(s).