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. foldl' :: (Size size, Storable b) => (a -> b -> a) -> a -> Vector size b -> a

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

2. foldl1Of :: HasCallStack => Getting (Dual (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a

   diagrams-lib	Diagrams.Prelude

   A variant of foldlOf that has no base case and thus may only be applied to lenses and structures such that the Lens views at least one element of the structure.

   >>> foldl1Of each (+) (1,2,3,4)
   10
   

   foldl1Of l f ≡ foldl1 f . toListOf l
   foldl1 ≡ foldl1Of folded
   

   foldl1Of :: Getter s a     -> (a -> a -> a) -> s -> a
   foldl1Of :: Fold s a       -> (a -> a -> a) -> s -> a
   foldl1Of :: Iso' s a       -> (a -> a -> a) -> s -> a
   foldl1Of :: Lens' s a      -> (a -> a -> a) -> s -> a
   foldl1Of :: Traversal' s a -> (a -> a -> a) -> s -> a
   

3. foldl1Of' :: HasCallStack => Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a

   diagrams-lib	Diagrams.Prelude

   A variant of foldlOf' that has no base case and thus may only be applied to folds and structures such that the fold views at least one element of the structure.

   foldl1Of' l f ≡ foldl1' f . toListOf l
   

   foldl1Of' :: Getter s a     -> (a -> a -> a) -> s -> a
   foldl1Of' :: Fold s a       -> (a -> a -> a) -> s -> a
   foldl1Of' :: Iso' s a       -> (a -> a -> a) -> s -> a
   foldl1Of' :: Lens' s a      -> (a -> a -> a) -> s -> a
   foldl1Of' :: Traversal' s a -> (a -> a -> a) -> s -> a
   

4. foldlMOf :: Monad m => Getting (Endo (r -> m r)) s a -> (r -> a -> m r) -> r -> s -> m r

   diagrams-lib	Diagrams.Prelude

   Monadic fold over the elements of a structure, associating to the left, i.e. from left to right.

   foldlM ≡ foldlMOf folded
   

   foldlMOf :: Monad m => Getter s a     -> (r -> a -> m r) -> r -> s -> m r
   foldlMOf :: Monad m => Fold s a       -> (r -> a -> m r) -> r -> s -> m r
   foldlMOf :: Monad m => Iso' s a       -> (r -> a -> m r) -> r -> s -> m r
   foldlMOf :: Monad m => Lens' s a      -> (r -> a -> m r) -> r -> s -> m r
   foldlMOf :: Monad m => Traversal' s a -> (r -> a -> m r) -> r -> s -> m r
   

5. foldlOf :: Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r

   diagrams-lib	Diagrams.Prelude

   Left-associative fold of the parts of a structure that are viewed through a Lens, Getter, Fold or Traversal.

   foldl ≡ foldlOf folded
   

   foldlOf :: Getter s a     -> (r -> a -> r) -> r -> s -> r
   foldlOf :: Fold s a       -> (r -> a -> r) -> r -> s -> r
   foldlOf :: Lens' s a      -> (r -> a -> r) -> r -> s -> r
   foldlOf :: Iso' s a       -> (r -> a -> r) -> r -> s -> r
   foldlOf :: Traversal' s a -> (r -> a -> r) -> r -> s -> r
   foldlOf :: Prism' s a     -> (r -> a -> r) -> r -> s -> r
   

6. foldlOf' :: Getting (Endo (Endo r)) s a -> (r -> a -> r) -> r -> s -> r

   diagrams-lib	Diagrams.Prelude

   Fold over the elements of a structure, associating to the left, but strictly.

   foldl' ≡ foldlOf' folded
   

   foldlOf' :: Getter s a     -> (r -> a -> r) -> r -> s -> r
   foldlOf' :: Fold s a       -> (r -> a -> r) -> r -> s -> r
   foldlOf' :: Iso' s a       -> (r -> a -> r) -> r -> s -> r
   foldlOf' :: Lens' s a      -> (r -> a -> r) -> r -> s -> r
   foldlOf' :: Traversal' s a -> (r -> a -> r) -> r -> s -> r
   

7. foldl' :: TextualMonoid t => (a -> t -> a) -> (a -> Char -> a) -> a -> t -> a

   monoid-subclasses	Data.Monoid.Textual

   Strict version of foldl.

8. foldl_ :: TextualMonoid t => (a -> Char -> a) -> a -> t -> a

   monoid-subclasses	Data.Monoid.Textual

   foldl_ = foldl const
   

9. foldl_' :: TextualMonoid t => (a -> Char -> a) -> a -> t -> a

   monoid-subclasses	Data.Monoid.Textual

   No documentation available.

10. foldl' :: Factorial m => (a -> m -> a) -> a -> m -> a

    monoid-subclasses	Data.Semigroup.Factorial

    Like foldl' from Data.List on the list of prime factors.

Page 45 of many | Previous | Next