Documentation

Methods

bounds :: Ix i => UArray i (Interval a) -> (i, i) #

numElements :: Ix i => UArray i (Interval a) -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Interval a)] -> UArray i (Interval a)

unsafeAt :: Ix i => UArray i (Interval a) -> Int -> Interval a

unsafeReplace :: Ix i => UArray i (Interval a) -> [(Int, Interval a)] -> UArray i (Interval a)

unsafeAccum :: Ix i => (Interval a -> e' -> Interval a) -> UArray i (Interval a) -> [(Int, e')] -> UArray i (Interval a)

unsafeAccumArray :: Ix i => (Interval a -> e' -> Interval a) -> Interval a -> (i, i) -> [(Int, e')] -> UArray i (Interval a)

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Interval a) -> m (Vector (Interval a)) #

basicUnsafeThaw :: PrimMonad m => Vector (Interval a) -> m (Mutable Vector (PrimState m) (Interval a)) #

basicLength :: Vector (Interval a) -> Int #

basicUnsafeSlice :: Int -> Int -> Vector (Interval a) -> Vector (Interval a) #

basicUnsafeIndexM :: Monad m => Vector (Interval a) -> Int -> m (Interval a) #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Interval a) -> Vector (Interval a) -> m () #

elemseq :: Vector (Interval a) -> Interval a -> b -> b #

Methods

basicLength :: MVector s (Interval a) -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s (Interval a) -> MVector s (Interval a) #

basicOverlaps :: MVector s (Interval a) -> MVector s (Interval a) -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Interval a)) #

basicInitialize :: PrimMonad m => MVector (PrimState m) (Interval a) -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Interval a -> m (MVector (PrimState m) (Interval a)) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Interval a) -> Int -> m (Interval a) #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Interval a) -> Int -> Interval a -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) (Interval a) -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) (Interval a) -> Interval a -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Interval a) -> MVector (PrimState m) (Interval a) -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Interval a) -> MVector (PrimState m) (Interval a) -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Interval a) -> Int -> m (MVector (PrimState m) (Interval a)) #

Methods

pi :: Interval a #

exp :: Interval a -> Interval a #

log :: Interval a -> Interval a #

sqrt :: Interval a -> Interval a #

(**) :: Interval a -> Interval a -> Interval a #

logBase :: Interval a -> Interval a -> Interval a #

sin :: Interval a -> Interval a #

cos :: Interval a -> Interval a #

tan :: Interval a -> Interval a #

asin :: Interval a -> Interval a #

acos :: Interval a -> Interval a #

atan :: Interval a -> Interval a #

sinh :: Interval a -> Interval a #

cosh :: Interval a -> Interval a #

tanh :: Interval a -> Interval a #

asinh :: Interval a -> Interval a #

acosh :: Interval a -> Interval a #

atanh :: Interval a -> Interval a #

log1p :: Interval a -> Interval a #

expm1 :: Interval a -> Interval a #

log1pexp :: Interval a -> Interval a #

log1mexp :: Interval a -> Interval a #

Methods

(/) :: Interval a -> Interval a -> Interval a #

recip :: Interval a -> Interval a #

fromRational :: Rational -> Interval a #

Methods

(+) :: Interval a -> Interval a -> Interval a #

(-) :: Interval a -> Interval a -> Interval a #

(*) :: Interval a -> Interval a -> Interval a #

negate :: Interval a -> Interval a #

abs :: Interval a -> Interval a #

signum :: Interval a -> Interval a #

fromInteger :: Integer -> Interval a #

Methods

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

show :: Interval a -> String #

showList :: [Interval a] -> ShowS #

Methods

from :: Interval a -> Rep (Interval a) x #

to :: Rep (Interval a) x -> Interval a #

Methods

rnf :: Interval a -> () #

Methods

withEndPoints :: (Rounded TowardNegInf (EndPoint (Interval a)) -> Rounded TowardInf (EndPoint (Interval a)) -> Interval a) -> Interval a -> Interval a Source #

singleton :: EndPoint (Interval a) -> Interval a Source #

makeInterval :: Rounded TowardNegInf (EndPoint (Interval a)) -> Rounded TowardInf (EndPoint (Interval a)) -> Interval a Source #

width :: Interval a -> Rounded TowardInf (EndPoint (Interval a)) Source #

hull :: Interval a -> Interval a -> Interval a Source #

intersection :: Interval a -> Interval a -> Interval a Source #

maybeIntersection :: Interval a -> Interval a -> Maybe (Interval a) Source #

equalAsSet :: Interval a -> Interval a -> Bool Source #

subset :: Interval a -> Interval a -> Bool Source #

weaklyLess :: Interval a -> Interval a -> Bool Source #

precedes :: Interval a -> Interval a -> Bool Source #

interior :: Interval a -> Interval a -> Bool Source #

strictLess :: Interval a -> Interval a -> Bool Source #

strictPrecedes :: Interval a -> Interval a -> Bool Source #

disjoint :: Interval a -> Interval a -> Bool Source #

Methods

getBounds :: Ix i => STUArray s i (Interval a) -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i (Interval a) -> ST s Int

newArray :: Ix i => (i, i) -> Interval a -> ST s (STUArray s i (Interval a)) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i (Interval a)) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i (Interval a))

unsafeRead :: Ix i => STUArray s i (Interval a) -> Int -> ST s (Interval a)

unsafeWrite :: Ix i => STUArray s i (Interval a) -> Int -> Interval a -> ST s ()