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. foldl' :: (a -> WindowsChar -> a) -> a -> WindowsString -> a

    os-string System.OsString.Windows

    foldl' is like foldl, but strict in the accumulator.

  2. foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b

    relude Relude.Foldable.Reexport

    Left-associative fold of a structure but with strict application of the operator. This ensures that each step of the fold 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 strict result (e.g. sum). For a general Foldable structure this should be semantically identical to, 

    foldl' f z = foldl' f z . toList

  3. foldl' :: (a -> v -> a) -> a -> InsOrdHashMap k v -> a

    insert-ordered-containers Data.HashMap.Strict.InsOrd

    No documentation available.

  4. foldl' :: (a -> Char -> a) -> a -> YiString -> a

    yi-rope Yi.Rope

    Left fold. Benchmarks show that folding is actually Pretty Damn Slow™: consider whether folding is really the best thing to use in your scenario.

  5. foldl' :: (a -> CI ByteString -> ByteString -> a) -> a -> Headers -> a

    snap-core Snap.Types.Headers

    Strict left fold over all key-value pairs in the headers map. Example: 

    ghci> :set -XOverloadedStrings
ghci> import Data.Monoid
ghci> let hdrs = H.fromList [("Accept", "text/plain"), ("Accept", "text/html")]
ghci> let f (cntr, acc) _ val = (cntr+1, val <> ";" <> acc)
ghci> H.foldl' f (0, "") hdrs
(2,"text/html;text/plain;")

  6. foldl' :: forall (v :: Type -> Type) b a (n :: Nat) . Vector v b => (a -> b -> a) -> a -> Vector v n b -> a

    vector-sized Data.Vector.Generic.Sized

    O(n) Left fold with strict accumulator.

  7. foldl' :: forall b a (n :: Nat) . Prim b => (a -> b -> a) -> a -> Vector n b -> a

    vector-sized Data.Vector.Primitive.Sized

    O(n) Left fold with strict accumulator.

  8. foldl' :: forall a b (n :: Nat) . (a -> b -> a) -> a -> Vector n b -> a

    vector-sized Data.Vector.Sized

    O(n) Left fold with strict accumulator.

  9. foldl' :: forall b a (n :: Nat) . Storable b => (a -> b -> a) -> a -> Vector n b -> a

    vector-sized Data.Vector.Storable.Sized

    O(n) Left fold with strict accumulator.

  10. foldl' :: forall b a (n :: Nat) . Unbox b => (a -> b -> a) -> a -> Vector n b -> a

    vector-sized Data.Vector.Unboxed.Sized

    O(n) Left fold with strict accumulator.

Page 8 of many | Previous | Next