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. module Generic.Data.Function.Traverse.Sum

    traverse over generic sum types. Disambiguates constructors by prepending sum tags. Note that the sum tag approach has efficiency limitations. You may design a constructor disambiguation schema which permits "incrementally" parsing, rather than parsing some whole thing then comparing to each option, which will be faster. If you wish to perform such sum tag handling yourself, but still want the free generics, Generic.Data.FOnCstr can do this for you.

  2. newtype Sum

    gogol-datastore Gogol.Datastore

    Sum of the values of the requested property. * Only numeric values will be aggregated. All non-numeric values including NULL are skipped. * If the aggregated values contain NaN, returns NaN. Infinity math follows IEEE-754 standards. * If the aggregated value set is empty, returns 0. * Returns a 64-bit integer if all aggregated numbers are integers and the sum result does not overflow. Otherwise, the result is returned as a double. Note that even if all the aggregated values are integers, the result is returned as a double if it cannot fit within a 64-bit signed integer. When this occurs, the returned value will lose precision. * When underflow occurs, floating-point aggregation is non-deterministic. This means that running the same query repeatedly without any changes to the underlying values could produce slightly different results each time. In those cases, values should be stored as integers over floating-point numbers. See: newSum smart constructor.

  3. Sum :: Maybe PropertyReference -> Sum

    gogol-datastore Gogol.Datastore

    No documentation available.

  4. newtype Sum

    gogol-datastore Gogol.Datastore.Types

    Sum of the values of the requested property. * Only numeric values will be aggregated. All non-numeric values including NULL are skipped. * If the aggregated values contain NaN, returns NaN. Infinity math follows IEEE-754 standards. * If the aggregated value set is empty, returns 0. * Returns a 64-bit integer if all aggregated numbers are integers and the sum result does not overflow. Otherwise, the result is returned as a double. Note that even if all the aggregated values are integers, the result is returned as a double if it cannot fit within a 64-bit signed integer. When this occurs, the returned value will lose precision. * When underflow occurs, floating-point aggregation is non-deterministic. This means that running the same query repeatedly without any changes to the underlying values could produce slightly different results each time. In those cases, values should be stored as integers over floating-point numbers. See: newSum smart constructor.

  5. Sum :: Maybe PropertyReference -> Sum

    gogol-datastore Gogol.Datastore.Types

    No documentation available.

  6. Sum :: Aggregate

    redis-resp Data.Redis.Command

    addition of scores

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

    base 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 *

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

    base Data.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

    base Data.Foldable

    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 :: Num a => [a] -> a

    base GHC.List

    The sum function computes the sum of a finite list of numbers. 

    >>> sum []
0

>>> sum [42]
42

>>> sum [1..10]
55

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

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

Page 8 of many | Previous | Next