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.

Exact lookup

1. stepNoCB :: Statement -> IO StepResult

   direct-sqlite	Database.SQLite3

   https://www.sqlite.org/c3ref/step.html Faster step for statements that don't callback to Haskell functions (e.g. by using custom SQL functions).

2. stepNoCB :: Statement -> IO (Either Error StepResult)

   direct-sqlite	Database.SQLite3.Direct

   https://www.sqlite.org/c3ref/step.html Faster step for statements that don't callback to Haskell functions (e.g. by using custom SQL functions).

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

   functor-combinators	Control.Applicative.Step

   No documentation available.

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

   functor-combinators	Control.Applicative.Step

   No documentation available.

5. steppings :: forall (f :: Type -> Type) p a . Profunctor p => p (These1 f (Steps f) a) (These1 f (Steps f) a) -> p (Steps f a) (Steps f a)

   functor-combinators	Control.Applicative.Step

   "Uncons and cons" an f branch before a Steps. This is basically a witness that stepsDown and stepsUp form an isomorphism.

6. 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).

7. 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).

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

   functor-combinators	Data.Functor.Combinator

   No documentation available.

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

   functor-combinators	Data.Functor.Combinator

   No documentation available.

10. 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.

Page 18 of many | Previous | Next