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.

Exact lookup

1. stepThread :: (MonadDejaFu n, HasCallStack) => Bool -> Bool -> Scheduler g -> MemType -> ThreadId -> Action n -> Context n g -> n (What n g, ThreadAction, Threads n -> n ())

   dejafu	Test.DejaFu.Conc.Internal

   Run a single thread one step, by dispatching on the type of Action. Each case looks very similar. This is deliberate, so that the essential differences between actions are more apparent, and not hidden by accidental differences in how things are expressed. Note: the returned snapshot action will definitely not do the right thing with relaxed memory.

2. stepThrow :: (MonadDejaFu n, Exception e) => (Maybe MaskingState -> ThreadAction) -> ThreadId -> e -> Context n g -> n (What n g, ThreadAction, Threads n -> n ())

   dejafu	Test.DejaFu.Conc.Internal

   Handle an exception being thrown from an AAtom, AThrow, or AThrowTo.

3. stepTrans :: MonadDejaFu n => STMAction n -> IdSource -> n (STMAction n, n (), n (), IdSource, [TVarId], [TVarId], TAction)

   dejafu	Test.DejaFu.Conc.Internal.STM

   Run a transaction for one step.

4. step_size :: SimulatedAnnealingParams -> Double

   hmatrix-gsl	Numeric.GSL.SimulatedAnnealing

   The maximum step size in the random walk

5. stepMachine :: forall (m :: Type -> Type) (k :: Type -> Type) o (k' :: Type -> Type) o' . Monad m => MachineT m k o -> (Step k o (MachineT m k o) -> MachineT m k' o') -> MachineT m k' o'

   machines	Data.Machine.Type

   Transform a Machine by looking at a single step of that machine.

6. stepper :: MonadMoment m => a -> Event a -> m (Behavior a)

   reactive-banana	Reactive.Banana.Combinators

   Construct a time-varying function from an initial value and a stream of new values. The result will be a step function. Semantically,

   stepper x0 ex = \time1 -> \time2 ->
   last (x0 : [x | (timex,x) <- ex, time1 <= timex, timex < time2])
   

   Here is an illustration of the result Behavior at a particular time: Note: The smaller-than-sign in the comparison timex < time2 means that at time time2 == timex, the value of the Behavior will still be the previous value. In the illustration, this is indicated by the dots at the end of each step. This allows for recursive definitions. See the discussion below for more on recursion.

7. stepper :: a -> Event a -> Moment (Behavior a)

   reactive-banana	Reactive.Banana.Model

   No documentation available.

8. stepper :: MonadMoment m => a -> Event a -> m (Behavior a)

   reactive-banana-bunch	Reactive.Banana.Bunch.Combinators

   No documentation available.

9. stepcounter :: LaTeXC l => String -> l

   HaTeX	Text.LaTeX.Base.Commands

   Increases by 1 the value of given counter

10. stepQueryUI :: (MonadClient m, MonadClientUI m) => m (Maybe ReqUI)

    LambdaHack	Game.LambdaHack.Client.UI

    Let the human player issue commands until any command takes time.

Page 17 of many | Previous | Next