Copyright | (c) Dominik Schrempf 2020 |
---|---|
License | GPL-3.0-or-later |
Maintainer | dominik.schrempf@gmail.com |
Stability | unstable |
Portability | portable |
Safe Haskell | None |
Language | Haskell2010 |
Creation date: Mon Jun 8 11:03:12 2020.
Synopsis
- slope :: (Real a, Real b) => a -> a -> b -> b -> Double
- strictlyOrdered :: (Ord a, Vector v a, Vector v Bool) => v a -> Bool
- smooth :: (Vector v Bool, Vector v Double, Vector v Int) => v Int -> v Double -> v Double
- unsafeSmooth :: (Vector v Bool, Vector v Double, Vector v Int) => v Int -> v Double -> v Double
- reverse3 :: ([a], [b], [c]) -> ([a], [b], [c])
Documentation
slope :: (Real a, Real b) => a -> a -> b -> b -> Double Source #
Calculate the slope between to points.
strictlyOrdered :: (Ord a, Vector v a, Vector v Bool) => v a -> Bool Source #
Check if vector is ordered strictly (<).
smooth :: (Vector v Bool, Vector v Double, Vector v Int) => v Int -> v Double -> v Double Source #
Fill in missing values of an indexed vector.
smooth [-2, 2, 4, 5] [0, 4, 10, 88] = [0, 1, 2, 3, 4, 7, 10, 88]