Hoogle Search
Within LTS Haskell 24.2 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
base-compat Data.Semigroup.Compat No documentation available.
-
No documentation available.
data
Sum (p :: k -> k1 -> Type) (q :: k -> k1 -> Type) (a :: k) (b :: k1)bifunctors Data.Bifunctor.Sum No documentation available.
Sum :: ConTag -> Arity -> LocatedA b -> [EpaLocation] -> [EpaLocation] -> SumOrTuple bghc GHC.Parser.PostProcess Last two are the locations of the '|' before and after the payload
Sum :: ConTag -> Arity -> LocatedA b -> [EpaLocation] -> [EpaLocation] -> SumOrTuple bghc GHC.Parser.Types Last two are the locations of the '|' before and after the payload
-
No documentation available.
-
generic-deriving Generics.Deriving.Monoid Monoid under addition.
Sum a <> Sum b = Sum (a + b)
Examples
>>> Sum 1 <> Sum 2 <> mempty Sum {getSum = 3}>>> mconcat [ Sum n | n <- [3 .. 9]] Sum {getSum = 42} -
generic-deriving Generics.Deriving.Monoid No documentation available.
-
No documentation available.
-
Functions for summing floating point numbers more accurately than the naive sum function and its counterparts in the vector package and elsewhere. When used with floating point numbers, in the worst case, the sum function accumulates numeric error at a rate proportional to the number of values being summed. The algorithms in this module implement different methods of /compensated summation/, which reduce the accumulation of numeric error so that it either grows much more slowly than the number of inputs (e.g. logarithmically), or remains constant.