interpolation-0.1.0.2: piecewise linear and cubic Hermite interpolation

Safe HaskellSafe
LanguageHaskell98

Numeric.Interpolation.NodeList

Synopsis

Documentation

data T x y Source #

Constructors

Interval 
Node (x, y) (T x y) (T x y) 

Instances

Functor (T x) Source # 

Methods

fmap :: (a -> b) -> T x a -> T x b #

(<$) :: a -> T x b -> T x a #

Foldable (T x) Source # 

Methods

fold :: Monoid m => T x m -> m #

foldMap :: Monoid m => (a -> m) -> T x a -> m #

foldr :: (a -> b -> b) -> b -> T x a -> b #

foldr' :: (a -> b -> b) -> b -> T x a -> b #

foldl :: (b -> a -> b) -> b -> T x a -> b #

foldl' :: (b -> a -> b) -> b -> T x a -> b #

foldr1 :: (a -> a -> a) -> T x a -> a #

foldl1 :: (a -> a -> a) -> T x a -> a #

toList :: T x a -> [a] #

null :: T x a -> Bool #

length :: T x a -> Int #

elem :: Eq a => a -> T x a -> Bool #

maximum :: Ord a => T x a -> a #

minimum :: Ord a => T x a -> a #

sum :: Num a => T x a -> a #

product :: Num a => T x a -> a #

Traversable (T x) Source # 

Methods

traverse :: Applicative f => (a -> f b) -> T x a -> f (T x b) #

sequenceA :: Applicative f => T x (f a) -> f (T x a) #

mapM :: Monad m => (a -> m b) -> T x a -> m (T x b) #

sequence :: Monad m => T x (m a) -> m (T x a) #

(Eq y, Eq x) => Eq (T x y) Source # 

Methods

(==) :: T x y -> T x y -> Bool #

(/=) :: T x y -> T x y -> Bool #

(Ord y, Ord x) => Ord (T x y) Source # 

Methods

compare :: T x y -> T x y -> Ordering #

(<) :: T x y -> T x y -> Bool #

(<=) :: T x y -> T x y -> Bool #

(>) :: T x y -> T x y -> Bool #

(>=) :: T x y -> T x y -> Bool #

max :: T x y -> T x y -> T x y #

min :: T x y -> T x y -> T x y #

(Show y, Show x) => Show (T x y) Source # 

Methods

showsPrec :: Int -> T x y -> ShowS #

show :: T x y -> String #

showList :: [T x y] -> ShowS #

fromList :: [(x, y)] -> T x y Source #

list must be sorted with respect to first element

toList :: T x y -> [(x, y)] Source #

singleton :: x -> y -> T x y Source #

lookup :: Ord x => T x y -> x -> (Maybe (x, y), Maybe (x, y)) Source #