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.

Exact lookup

1. sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a) . SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)

   singletons-base	Data.Foldable.Singletons

   No documentation available.

2. sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a) . SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)

   singletons-base	Data.List.Singletons

   No documentation available.

3. sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: t a) . SFoldable t => Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply (Foldl'Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (t a ~> b)) -> Type) t1) t2) t3)

   singletons-base	Data.Singletons.Base.TH

   No documentation available.

4. foldedFoldl' :: (a -> ByteString -> ByteString -> a) -> a -> Headers -> a

   snap-core	Snap.Types.Headers

   Same as foldl', but the key parameter is of type ByteString instead of CI ByteString. The key is case-folded (lowercase).

5. ifoldl' :: forall (v :: Type -> Type) b a (n :: Nat) . Vector v b => (a -> Finite n -> b -> a) -> a -> Vector v n b -> a

   vector-sized	Data.Vector.Generic.Sized

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

6. ifoldl' :: forall b a (n :: Nat) . Prim b => (a -> Finite n -> b -> a) -> a -> Vector n b -> a

   vector-sized	Data.Vector.Primitive.Sized

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

7. ifoldl' :: forall a (n :: Nat) b . (a -> Finite n -> b -> a) -> a -> Vector n b -> a

   vector-sized	Data.Vector.Sized

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

8. ifoldl' :: forall b a (n :: Nat) . Storable b => (a -> Finite n -> b -> a) -> a -> Vector n b -> a

   vector-sized	Data.Vector.Storable.Sized

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

9. ifoldl' :: forall b a (n :: Nat) . Unbox b => (a -> Finite n -> b -> a) -> a -> Vector n b -> a

   vector-sized	Data.Vector.Unboxed.Sized

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

10. ifoldl' :: (a -> Int -> Word8 -> a) -> a -> Bytes -> a

    byteslice	Data.Bytes

    Left fold over bytes, strict in the accumulator. The reduction function is applied to each element along with its index.

Page 24 of many | Previous | Next