Hoogle Search

Within LTS Haskell 24.18 (ghc-9.10.3)

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

  1. StepAfter :: MarkInterpolation

    hvega Graphics.Vega.VegaLite

    Piecewise (stepped) constant interpolation function after each point in a sequence.

  2. StepBefore :: MarkInterpolation

    hvega Graphics.Vega.VegaLite

    Piecewise (stepped) constant interpolation function before each point in a sequence.

  3. Steps :: [Double] -> BinProperty

    hvega Graphics.Vega.VegaLite

    Pick the step size from this list.

  4. Stepwise :: MarkInterpolation

    hvega Graphics.Vega.VegaLite

    Piecewise (stepped) constant interpolation function centred on each point in a sequence.

  5. data StepField

    cron System.Cron.Types

    No documentation available.

  6. StepField' :: StepField -> CronField

    cron System.Cron.Types

    Matches a stepped expression, e.g. (*/2).

  7. data StepResult

    direct-sqlite Database.SQLite3

    No documentation available.

  8. data StepResult

    direct-sqlite Database.SQLite3.Direct

    No documentation available.

  9. newtype Steps (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.Step

    A non-empty map of Natural to f a. Basically, contains multiple f as, each at a given Natural index.

    Steps f a ~ Map Natural (f a)
    Steps f   ~ Map Natural :.: f       -- functor composition
    
    It is the fixed point of applications of TheseT. You can think of this as an infinite sparse array of f as. Intuitively, in an infinite f `TheseT` f `TheseT` f `TheseT` f ..., each of those infinite positions may have an f in them. However, because of the at-least-one nature of TheseT, we know we have at least one f at one position somewhere. A Steps f a has potentially many fs, each stored at a different Natural position, with the guaruntee that at least one f exists. Can be useful for using with the Monoidal instance of TheseT. interpreting it requires at least an Alt instance in the target context, since we have to handle potentially more than one f. This type is essentailly the same as NEMapF (Sum Natural) (except with a different Semigroup instance).

  10. Steps :: NEMap Natural (f a) -> Steps (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.Step

    No documentation available.

Page 33 of many | Previous | Next