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.

  1. foldl1 :: forall a (n :: Natural) . Prim a => (a -> a -> a) -> Vector (1 + n) a -> a

    vector-sized Data.Vector.Primitive.Sized

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

  2. foldl1' :: forall a (n :: Natural) . Prim a => (a -> a -> a) -> Vector (1 + n) a -> a

    vector-sized Data.Vector.Primitive.Sized

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

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

  4. foldl1 :: forall a (n :: Natural) . (a -> a -> a) -> Vector (1 + n) a -> a

    vector-sized Data.Vector.Sized

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

  5. foldl1' :: forall a (n :: Natural) . (a -> a -> a) -> Vector (1 + n) a -> a

    vector-sized Data.Vector.Sized

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

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

  7. foldl1 :: forall a (n :: Natural) . Storable a => (a -> a -> a) -> Vector (1 + n) a -> a

    vector-sized Data.Vector.Storable.Sized

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

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

    vector-sized Data.Vector.Storable.Sized

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

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

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

Page 50 of many | Previous | Next