Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. productE :: forall (m :: Type -> Type) mono o . (Monad m, MonoFoldable mono, Num (Element mono)) => ConduitT mono o m (Element mono)

   conduit	Data.Conduit.Combinators

   Get the product of all elements in the chunked stream. Subject to fusion

2. product' :: (Foldable f, Num a) => f a -> a

   extra	Data.Foldable.Extra

   A generalization of product' to Foldable instances.

3. productOn' :: (Foldable f, Num b) => (a -> b) -> f a -> b

   extra	Data.Foldable.Extra

   A generalization of productOn' to Foldable instances.

4. product' :: Num a => [a] -> a

   extra	Data.List.Extra

   A strict version of product.

   product' [1, 2, 4] == 8
   

5. productOn' :: Num b => (a -> b) -> [a] -> b

   extra	Data.List.Extra

   A strict version of product, using a custom valuation function.

   productOn' read ["1", "2", "4"] == 8
   

6. product' :: Num a => [a] -> a

   extra	Extra

   A strict version of product.

   product' [1, 2, 4] == 8
   

7. productOn' :: Num b => (a -> b) -> [a] -> b

   extra	Extra

   A strict version of product, using a custom valuation function.

   productOn' read ["1", "2", "4"] == 8
   

8. productOf :: forall k a (is :: IxList) s . (Is k A_Fold, Num a) => Optic' k is s a -> s -> a

   optics-core	Optics.Fold

   Calculate the Product of every number targeted by a Fold.

   >>> productOf each (4,5)
   20
   
   >>> productOf folded [1,2,3,4,5]
   120
   

   product ≡ productOf folded
   

   This operation may be more strict than you would expect. If you want a lazier version use \o -> getProduct . foldMapOf o Product.

9. productOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a

   diagrams-lib	Diagrams.Prelude

   Calculate the Product of every number targeted by a Fold.

   >>> productOf both (4,5)
   20
   
   >>> productOf folded [1,2,3,4,5]
   120
   

   product ≡ productOf folded
   

   This operation may be more strict than you would expect. If you want a lazier version use ala Product . foldMapOf

   productOf :: Num a => Getter s a     -> s -> a
   productOf :: Num a => Fold s a       -> s -> a
   productOf :: Num a => Lens' s a      -> s -> a
   productOf :: Num a => Iso' s a       -> s -> a
   productOf :: Num a => Traversal' s a -> s -> a
   productOf :: Num a => Prism' s a     -> s -> a
   

10. product3With :: (a -> b -> c -> d) -> [[a]] -> [[b]] -> [[c]] -> [[d]]

    leancheck	Test.LeanCheck

    Like productWith, but over 3 lists of tiers.

Page 73 of many | Previous | Next