Hoogle Search

Within LTS Haskell 24.21 (ghc-9.10.3)

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

  1. ofoldl' :: MonoFoldable mono => (a -> Element mono -> a) -> a -> mono -> a

    classy-prelude-yesod ClassyPrelude.Yesod

    Strict left-associative fold of a monomorphic container.

  2. unfoldL' :: (s -> (b, a -> s)) -> s -> L' a b

    folds Data.Fold.L'

    Construct a strict Moore machine from a state valuation and transition function

  3. ifoldl' :: forall (u :: Type -> Type) a (v :: Type -> Type) b r . (Vector u a, Vector v b) => (r -> Int -> (a, b) -> r) -> r -> Vector u v (a, b) -> r

    hybrid-vectors Data.Vector.Hybrid

    O(n) Left fold with strict accumulator (function applied to each element and its index)

  4. bifoldl' :: Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a

    verset Verset

    As bifoldl, but strict in the result of the reduction functions at each step. This ensures that each step of the bifold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite structure to a single, monolithic result (e.g., bilength).

Page 27 of many | Previous | Next