Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
step :: Monad m => (a -> m (b, e)) -> MSFExcept m a b edunai Control.Monad.Trans.MSF.Except Advances a single tick with the given Kleisli arrow, and then throws an exception.
step :: Monad m => m i -> (i -> m t) -> (a -> b) -> a -> m (t, b)perf Perf.Types A single step measurement.
step :: TupleParserState -> Char -> TupleParserStatepurescript-bridge Language.PureScript.Bridge.Tuple No documentation available.
step :: (Ord e, Container c e) => c e -> c eqchas QC 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]
step :: Statement -> IO StepResultsqueather Squeather Evaluate a prepared statement. Returns Row if the Statement has returned a row of data. In that case, use column or columns to get individual columns or all columns, respectively. Returns Done if there is no data to retrieve. In that case, step should not be called again without first calling reset.
step :: Statement -> IO StepResultsqueather Squeather.Internal Evaluate a prepared statement. Returns Row if the Statement has returned a row of data. In that case, use column or columns to get individual columns or all columns, respectively. Returns Done if there is no data to retrieve. In that case, step should not be called again without first calling reset.
-
step-function Data.Function.Step Step function. step k v1 v2 = \ x -> if x < k then v1 else v2.
>>> putSF $ step 1 2 3 \x -> if | x < 1 -> 2 | otherwise -> 3
-
step-function Data.Function.Step.Discrete.Closed Step function. step k v1 v2 = \ x -> if x < k then v1 else v2.
>>> putSF $ step 1 2 3 \x -> if | x <= 1 -> 2 | otherwise -> 3
-
step-function Data.Function.Step.Discrete.Open Step function. step k v1 v2 = \ x -> if x < k then v1 else v2.
>>> putSF $ step 1 2 3 \x -> if | x < 1 -> 2 | otherwise -> 3
-
stylish-haskell Language.Haskell.Stylish.Step.Data No documentation available.