Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. _step :: Lexer (l :: Type -> Type) s t i -> TokenLexer l s t i

    yi-language Yi.Lexer.Alex

    No documentation available.

  2. ghciStepIO :: GHCiSandboxIO m => m a -> IO a

    ghc-internal GHC.Internal.GHCi

    No documentation available.

  3. pattern LUA_GCSETSTEPMUL :: GCCode

    lua Lua

    Sets data as the new value for the step multiplier of the collector (see §2.5) and returns the previous value of the step multiplier.

  4. pattern LUA_GCSTEP :: GCCode

    lua Lua

    Performs an incremental step of garbage collection.

  5. pattern LUA_GCSETSTEPMUL :: GCCode

    lua Lua.Constants

    Sets data as the new value for the step multiplier of the collector (see §2.5) and returns the previous value of the step multiplier.

  6. pattern LUA_GCSTEP :: GCCode

    lua Lua.Constants

    Performs an incremental step of garbage collection.

  7. enumFromStepN :: Num e => Comp -> e -> e -> Sz1 -> Vector D e

    massiv Data.Massiv.Array

    Enumerate from a starting number x exactly n times with a custom step value dx. Unlike senumFromStepN, there is no dependency on neigboring elements therefore enumFromStepN is parallelizable. Related: senumFromN, senumFromStepN, enumFromN, rangeSize, rangeStepSize, range, rangeStepM

    Examples

    >>> import Data.Massiv.Array

>>> enumFromStepN Seq 1 (0.1 :: Double) 5
Array D Seq (Sz1 5)
[ 1.0, 1.1, 1.2, 1.3, 1.4 ]

>>> enumFromStepN Seq (-pi :: Float) (pi/4) 9
Array D Seq (Sz1 9)
[ -3.1415927, -2.3561945, -1.5707964, -0.78539824, 0.0, 0.78539824, 1.5707963, 2.3561947, 3.1415927 ]
    Similar:
    • Prelude.enumFrom Similar to take n [x, x + dx ..], except that enumFromStepN is parallelizable and it only works for Num and not for Enum elements. Floating point value will be slightly different as well.
    • Data.Vector.Generic.enumFromStepN Similar in the outcome, but very different in the way it works.

  8. rangeStep' :: (HasCallStack, Index ix) => Comp -> ix -> ix -> ix -> Array D ix ix

    massiv Data.Massiv.Array

    Same as rangeStepM, but will throw an error whenever step contains zeros.

    Example

    >>> import Data.Massiv.Array

>>> rangeStep' Seq (Ix1 1) 2 6
Array D Seq (Sz1 3)
[ 1, 3, 5 ]

  9. rangeStepInclusive' :: (HasCallStack, Index ix) => Comp -> ix -> ix -> ix -> Array D ix ix

    massiv Data.Massiv.Array

    Just like range, except the finish index is included.

  10. rangeStepInclusiveM :: (MonadThrow m, Index ix) => Comp -> ix -> ix -> ix -> m (Array D ix ix)

    massiv Data.Massiv.Array

    Just like rangeStepM, except the finish index is included.

Page 47 of many | Previous | Next