Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. widen :: (Space s, Ring (Element s)) => Element s -> s -> s

    numhask-space NumHask.Space

    widen a space

  2. widenEps :: (Space s, FromRational (Element s), Ring (Element s)) => Element s -> s -> s

    numhask-space NumHask.Space

    widen by a small amount

  3. width :: (Space s, Subtractive (Element s)) => s -> Element s

    numhask-space NumHask.Space

    distance between boundaries

  4. gridP :: FieldSpace (Range a) => (a -> a) -> Range a -> Grid (Range a) -> [Point a]

    numhask-space NumHask.Space.Point

    Create Points for a formulae y = f(x) across an x range 

    >>> gridP (^^2) (Range 0 4) 4
[Point 0.0 0.0,Point 1.0 1.0,Point 2.0 4.0,Point 3.0 9.0,Point 4.0 16.0]

  5. gridSensible :: Pos -> Bool -> Range Double -> Int -> [Double]

    numhask-space NumHask.Space.Range

    a grid for five-digits per limb species 

    >>> gridSensible OuterPos False (Range (-12.0) 23.0) 6
[-15.0,-10.0,-5.0,0.0,5.0,10.0,15.0,20.0,25.0]

  6. gridF :: (Point Double -> b) -> Rect Double -> Grid (Rect Double) -> [(Rect Double, b)]

    numhask-space NumHask.Space.Rect

    Create values c for Rects data for a formulae c = f(x,y) 

    >>> gridF (\(Point x y) -> x * y) (Rect 0 4 0 4) (Point 2 2)
[(Rect 0.0 2.0 0.0 2.0,1.0),(Rect 0.0 2.0 2.0 4.0,3.0),(Rect 2.0 4.0 0.0 2.0,3.0),(Rect 2.0 4.0 2.0 4.0,9.0)]

  7. gridR :: (Field a, FromIntegral a Int, Ord a) => (a -> a) -> Range a -> Int -> [Rect a]

    numhask-space NumHask.Space.Rect

    Create Rects for a formulae y = f(x) across an x range where the y range is Range 0 y 

    >>> gridR (^2) (Range 0 4) 4
[Rect 0.0 1.0 0.0 0.25,Rect 1.0 2.0 0.0 2.25,Rect 2.0 3.0 0.0 6.25,Rect 3.0 4.0 0.0 12.25]

  8. sensibleTimeGrid :: Pos -> Int -> Range UTCTime -> (TimeGrain, [UTCTime])

    numhask-space NumHask.Space.Time

    compute a sensible TimeGrain and list of UTCTimes 

    >>> sensibleTimeGrid InnerPos 2 (Range (UTCTime (fromGregorian 2016 12 31) (toDiffTime 0)) (UTCTime (fromGregorian 2017 12 31) (toDiffTime 0)))
(Months 6,[2016-12-31 00:00:00 UTC,2017-06-30 00:00:00 UTC,2017-12-31 00:00:00 UTC])

    >>> sensibleTimeGrid InnerPos 2 (Range (UTCTime (fromGregorian 2017 1 1) (toDiffTime 0)) (UTCTime (fromGregorian 2017 12 30) (toDiffTime 0)))
(Months 6,[2017-06-30 00:00:00 UTC])

    >>> sensibleTimeGrid UpperPos 2 (Range (UTCTime (fromGregorian 2017 1 1) (toDiffTime 0)) (UTCTime (fromGregorian 2017 12 30) (toDiffTime 0)))
(Months 6,[2017-06-30 00:00:00 UTC,2017-12-31 00:00:00 UTC])

    >>> sensibleTimeGrid LowerPos 2 (Range (UTCTime (fromGregorian 2017 1 1) (toDiffTime 0)) (UTCTime (fromGregorian 2017 12 30) (toDiffTime 0)))
(Months 6,[2016-12-31 00:00:00 UTC,2017-06-30 00:00:00 UTC])

  9. module Data.Monoid.DecidablyEmpty

    No documentation available.

  10. class Monoid a => DecidablyEmpty a

    patch Data.Monoid.DecidablyEmpty

    A DecidablyEmpty is one where it can be computed whether or not an arbitrary value is mempty. By using this class rather than Eq, we avoid unnecessary constraining the contents of Functors. This makes it possible to efficiently combine and/or nest patch maps with Eq-lacking values (e.g. functions) at the leaves.

Page 1320 of many | Previous | Next