Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. sum :: forall (m :: Type -> Type) a o . (Monad m, Num a) => ConduitT a o m a

    conduit Data.Conduit.Combinators

    Get the sum of all values in the stream. Subject to fusion

  2. sum :: (Foldable t, Num a) => t a -> a

    hedgehog Hedgehog.Internal.Prelude

    The sum function computes the sum of the numbers of a structure.

    Examples

    Basic usage: 
    >>> sum []
0

    >>> sum [42]
42

    >>> sum [1..10]
55

    >>> sum [4.1, 2.0, 1.7]
7.8

    >>> sum [1..]
* Hangs forever *

  3. sum :: (Foldable t, Num a) => t a -> a

    ghc GHC.Prelude.Basic

    No documentation available.

  4. sum :: (Monad m, Num a) => Producer a m () -> m a

    pipes Pipes.Prelude

    Compute the sum of the elements of a Producer

  5. sum :: Num a => Fold a a

    foldl Control.Foldl

    Computes the sum of all elements

  6. sum :: forall a (f :: Type -> Type) . (Num a, Foldable f) => T f a -> a

    non-empty Data.NonEmpty

    sum does not need a zero for initialization

  7. sum :: (MonoFoldable mono, Num (Element mono)) => mono -> Element mono

    mono-traversable Data.MonoTraversable.Unprefixed

    Synonym for osum

  8. sum :: (Foldable t, Num a) => t a -> a

    rio RIO.List

    The sum function computes the sum of the numbers of a structure.

    Examples

    Basic usage: 
    >>> sum []
0

    >>> sum [42]
42

    >>> sum [1..10]
55

    >>> sum [4.1, 2.0, 1.7]
7.8

    >>> sum [1..]
* Hangs forever *

  9. sum :: (Foldable t, Num a) => t a -> a

    rio RIO.Prelude

    The sum function computes the sum of the numbers of a structure.

    Examples

    Basic usage: 
    >>> sum []
0

    >>> sum [42]
42

    >>> sum [1..10]
55

    >>> sum [4.1, 2.0, 1.7]
7.8

    >>> sum [1..]
* Hangs forever *

  10. sum :: (Vector v a, Num a) => v a -> a

    rio RIO.Vector

    No documentation available.

Page 9 of many | Previous | Next