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 -> b -> a) -> a -> NEIntMap b -> a

    nonempty-containers Data.IntMap.NonEmpty.Internal

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  2. foldl' :: (a -> Key -> a) -> a -> NEIntSet -> a

    nonempty-containers Data.IntSet.NonEmpty

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  3. foldl' :: (a -> b -> a) -> a -> NEMap k b -> a

    nonempty-containers Data.Map.NonEmpty

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  4. foldl' :: (a -> b -> a) -> a -> NEMap k b -> a

    nonempty-containers Data.Map.NonEmpty.Internal

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  5. foldl' :: (a -> b -> a) -> a -> NESet b -> a

    nonempty-containers Data.Set.NonEmpty

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  6. foldl' :: (a -> b -> a) -> a -> NESet b -> a

    nonempty-containers Data.Set.NonEmpty.Internal

    O(n). A strict version of foldl. Each application of the operator is evaluated before using the result in the next application. This function is strict in the starting value.

  7. foldl' :: (a -> b -> a) -> a -> [b] -> a

    prelude-compat Data.List2010

    No documentation available.

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

    rebase Rebase.Data.Vector

    No documentation available.

  9. foldl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> m a

    rebase Rebase.Data.Vector.Fusion.Stream.Monadic

    Left fold with a strict accumulator

  10. foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a

    rebase Rebase.Data.Vector.Generic

    No documentation available.

Page 13 of many | Previous | Next