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. foldl1' :: forall a (n :: Natural) . Unbox a => (a -> a -> a) -> Vector (1 + n) a -> a

   vector-sized	Data.Vector.Unboxed.Sized

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

2. foldl' :: PrimType ty => (a -> ty -> a) -> a -> Block ty -> a

   basement	Basement.Block

   No documentation available.

3. foldl1' :: PrimType ty => (ty -> ty -> ty) -> NonEmpty (Block ty) -> ty

   basement	Basement.Block

   No documentation available.

4. foldl' :: (a -> ty -> a) -> a -> Array ty -> a

   basement	Basement.BoxedArray

   No documentation available.

5. foldl1' :: (ty -> ty -> ty) -> NonEmpty (Array ty) -> ty

   basement	Basement.BoxedArray

   No documentation available.

6. foldl' :: forall ty a (n :: Nat) . PrimType ty => (a -> ty -> a) -> a -> BlockN n ty -> a

   basement	Basement.Sized.Block

   No documentation available.

7. foldl' :: forall b a (n :: Nat) . (b -> a -> b) -> b -> ListN n a -> b

   basement	Basement.Sized.List

   Fold all elements from left strictly

8. foldl' :: forall ty a (n :: Nat) . PrimType ty => (a -> ty -> a) -> a -> UVect n ty -> a

   basement	Basement.Sized.UVect

   No documentation available.

9. foldl' :: forall a ty (n :: Nat) . (a -> ty -> a) -> a -> Vect n ty -> a

   basement	Basement.Sized.Vect

   No documentation available.

10. foldl' :: PrimType ty => (a -> ty -> a) -> a -> UArray ty -> a

    basement	Basement.UArray

    No documentation available.

Page 51 of many | Previous | Next