Hoogle Search

Within LTS Haskell 23.21 (ghc-9.8.4)

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

  1. step :: ReadPrec a -> ReadPrec a

    base Text.ParserCombinators.ReadPrec

    Increases the precedence context by one.

  2. step :: AttributeValue -> Attribute

    blaze-html Text.Blaze.Html5.Attributes

    Combinator for the step attribute. Example: 

    div ! step "bar" $ "Hello."
    Result: 
    <div step="bar">Hello.</div>

  3. step :: AttributeValue -> Attribute

    blaze-html Text.Blaze.XHtml5.Attributes

    Combinator for the step attribute. Example: 

    div ! step "bar" $ "Hello."
    Result: 
    <div step="bar">Hello.</div>

  4. step :: (Ord e, Container c e) => c e -> c e

    hmatrix Numeric.LinearAlgebra.Data

    A more efficient implementation of cmap (\x -> if x>0 then 1 else 0) 

    >>> step $ linspace 5 (-1,1::Double)
5 |> [0.0,0.0,0.0,1.0,1.0]

  5. step :: Statement -> IO StepResult

    persistent-sqlite Database.Sqlite

    Execute a database statement. It's recommended to use stepConn instead, because it gives better error messages.

  6. step :: forall l s t i f . Functor f => (TokenLexer l s t i -> f (TokenLexer l s t i)) -> Lexer l s t i -> f (Lexer l s t i)

    yi-language Yi.Lexer.Alex

    No documentation available.

  7. step :: [(a, FilePattern)] -> Step a

    filepattern System.FilePattern

    Efficient matching of a set of FilePatterns against a set of FilePaths. First call step passing in all the FilePatterns, with a tag for each one. Next call the methods of Step, providing the components of the FilePaths in turn. Useful for efficient bulk searching, particularly directory scanning, where you can avoid descending into directories which cannot match.

  8. step :: Monad m => Cell m a b -> a -> m (b, Cell m a b)

    essence-of-live-coding LiveCoding.Cell

    Execute a cell for one step.

  9. step :: Monad m => (a -> m (b, e)) -> ClSFExcept cl a b m e

    rhine FRP.Rhine.ClSF.Except

    Advances a single tick with the given Kleisli arrow, and then throws an exception.

  10. step :: Monad m => (a -> m (b, e)) -> AutomatonExcept a b m e

    automaton Data.Automaton.Trans.Except

    Advances a single tick with the given Kleisli arrow, and then throws an exception.

Page 1 of many | Next