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. foldlChar :: HasChars a => (b -> Char -> b) -> b -> a -> b

   doclayout	Text.DocLayout

   No documentation available.

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

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

   No documentation available.

3. foldlWithKey' :: (a -> k -> 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. foldlIntoBuffer :: (Buffer % 1 -> a -> Buffer) -> Buffer % 1 -> [a] -> Buffer

   text-builder-linear	Data.Text.Builder.Linear.Buffer

   This is just a normal foldl', but with a linear arrow and unlifted accumulator.

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

8. foldl1 :: forall (v :: Type -> Type) a (n :: Natural) . Vector v a => (a -> a -> a) -> Vector v (1 + n) a -> a

   vector-sized	Data.Vector.Generic.Sized

   O(n) Left fold on non-empty vectors.

9. foldl1' :: forall (v :: Type -> Type) a (n :: Natural) . Vector v a => (a -> a -> a) -> Vector v (1 + n) a -> a

   vector-sized	Data.Vector.Generic.Sized

   O(n) Left fold on non-empty vectors with strict accumulator.

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

Page 49 of many | Previous | Next