Hoogle Search
Within LTS Haskell 24.4 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sum :: IntegerMean -> Maybe SplitInt64gogol-dataflow Gogol.Dataflow.Types The sum of all values being aggregated.
sum :: Quantiles -> Maybe Int64gogol-dataproc Gogol.Dataproc No documentation available.
sum :: Quantiles -> Maybe Int64gogol-dataproc Gogol.Dataproc.Types No documentation available.
sum :: Aggregation -> Maybe Sumgogol-datastore Gogol.Datastore Sum aggregator.
sum :: Aggregation -> Maybe Sumgogol-datastore Gogol.Datastore.Types Sum aggregator.
sum :: (Foldable t, Num a) => t a -> alistsafe Data.List.Safe 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 *
-
logfloat Data.Number.LogFloat O(n). Compute the sum of a finite list of LogFloats, being careful to avoid underflow issues. That is, the following equivalence holds (modulo underflow and all that):
logFloat . sum == sum . map logFloat
N.B., this function requires two passes over the input. Thus, it is not amenable to list fusion, and hence will use a lot of memory when summing long lists. Since: 0.13 sum :: (Foldable t, Num a) => t a -> averset Verset 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 *
sum :: (Foldable t, Num a) => t a -> axmonad-contrib XMonad.Config.Prime 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 *
sum :: (Foldable t, Num a) => t a -> axmonad-contrib XMonad.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 *