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. stepsDown :: forall (f :: Type -> Type) x . Steps f x -> These1 f (Steps f) x

   functor-combinators	Control.Applicative.Step

   Pop off the first item in a Steps. Because a Steps f is f These1 f These1 f These1 ... forever, this matches on the first branch. You can think of it as reassociating

   f These1 f These1 f These1 f These1 ...
   

   into

   f These1 ( f These1 f These1 f These1 ...)
   

   It returns:
   • This1 if the first item is the only item in the Steps
   • That1 if the first item in the Steps is empty, but there are more items left. The extra items are all shfited down.
   • These1 if the first item in the Steps exists, and there are also more items left. The extra items are all shifted down.
   Forms an isomorphism with stepsUp (see steppings).

2. stepsUp :: forall (f :: Type -> Type) x . These1 f (Steps f) x -> Steps f x

   functor-combinators	Control.Applicative.Step

   Unshift an item into a Steps. Because a Steps f is f These1 f These1 f These1 f These1 ... forever, this basically conses an additional possibility of f to the beginning of it all. You can think of it as reassociating

   f These1 ( f These1 f These1 f These1 ...)
   

   into

   f These1 f These1 f These1 f These1 ...
   

   If you give:
   • This1, then it returns a singleton Steps with one item at index 0
   • That1, then it shifts every item in the given Steps up one index.
   • These1, then it shifts every item in the given Steps up one index, and adds the given item (the f) at index zero.
   Forms an isomorphism with stepDown (see stepping).

3. stepPos :: Step (f :: k -> Type) (a :: k) -> Natural

   functor-combinators	Data.Functor.Combinator

   No documentation available.

4. stepVal :: Step (f :: k -> Type) (a :: k) -> f a

   functor-combinators	Data.Functor.Combinator

   No documentation available.

5. stepWire :: Monad m => Wire s e m a b -> s -> Either e a -> m (Either e b, Wire s e m a b)

   netwire	Control.Wire.Core

   Perform one step of the given wire.

6. stepSession :: Session (m :: Type -> Type) s -> m (s, Session m s)

   netwire	Control.Wire.Session

   No documentation available.

7. stepThread :: s -> Thread s r -> [Thread s r]

   regex-applicative	Text.Regex.Applicative.Object

   Feed a symbol into a non-result thread. It is an error to call stepThread on a result thread.

8. stepBack :: forall str (m :: Type -> Type) a . (StringLike str, Monad m) => ScraperT str m a -> SerialScraperT str m a

   scalpel-core	Text.HTML.Scalpel.Core

   Move the cursor back one node and execute the given scraper on the new focused node.

9. stepNext :: forall str (m :: Type -> Type) a . (StringLike str, Monad m) => ScraperT str m a -> SerialScraperT str m a

   scalpel-core	Text.HTML.Scalpel.Core

   Move the cursor forward one node and execute the given scraper on the new focused node.

10. stepsPerOctave :: Pattern Double -> ControlPattern

    tidal-core	Sound.Tidal.Params

    No documentation available.

Page 19 of many | Previous | Next