Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

  1. Call :: forall (ref :: Type -> Type) a1 ans (a :: Type -> Type) . ref a1 -> a1 -> Shift ans ref a ans

    data-effects Data.Effect.Shift

    No documentation available.

  2. call :: forall ref a ans f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, Shift ans ref :> es) => ref a -> a -> f ans

    data-effects Data.Effect.Shift

    No documentation available.

  3. call'_ :: forall ref a ans f (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (Free c ff, f ~ Eff ff es, In (Shift ans ref) es) => ref a -> a -> f ans

    data-effects Data.Effect.Shift

    No documentation available.

  4. callCC_ :: forall (ref :: Type -> Type) a b (es :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) (c :: (Type -> Type) -> Constraint) . (CC ref :> es, Monad (Eff ff es), Free c ff) => ((a -> Eff ff es b) -> Eff ff es a) -> Eff ff es a

    data-effects-core Control.Effect

    No documentation available.

  5. interpretAll :: forall (es :: [Effect]) (es' :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) a (c :: (Type -> Type) -> Constraint) . Free c ff => (Union es ~~> Eff ff es') -> Eff ff es a -> Eff ff es' a

    data-effects-core Control.Effect.Interpret

    No documentation available.

  6. iterAllEff :: forall (es :: [Effect]) f (ff :: (Type -> Type) -> Type -> Type) a (c :: (Type -> Type) -> Constraint) . (Free c ff, c f) => (Union es ~~> f) -> Eff ff es a -> f a

    data-effects-core Control.Effect.Interpret

    No documentation available.

  7. transAll :: forall (es :: [Effect]) (es' :: [Effect]) (ff :: (Type -> Type) -> Type -> Type) a (c :: (Type -> Type) -> Constraint) . Free c ff => (Union es (Eff ff es') ~> Union es' (Eff ff es')) -> Eff ff es a -> Eff ff es' a

    data-effects-core Control.Effect.Transform

    No documentation available.

  8. data LocalLabel

    data-effects-core Data.Effect

    No documentation available.

  9. mergeAll :: Ord a => [[a]] -> [a]

    data-ordlist Data.List.Ordered

    The mergeAll function merges a (potentially) infinite number of ordered lists, under the assumption that the heads of the inner lists are sorted. An element is duplicated in the result as many times as the total number of occurrences in all inner lists. The mergeAll function is closely related to foldr merge []. The former does not assume that the outer list is finite, whereas the latter does not assume that the heads of the inner lists are sorted. When both sets of assumptions are met, these two functions are equivalent. This implementation of mergeAll uses a tree of comparisons, and is based on input from Dave Bayer, Heinrich Apfelmus, Omar Antolin Camarena, and Will Ness. See CHANGES for details.

  10. mergeAllBy :: (a -> a -> Ordering) -> [[a]] -> [a]

    data-ordlist Data.List.Ordered

    The mergeAllBy function is the non-overloaded variant of the mergeAll function.

Page 710 of many | Previous | Next