Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
sumEncoding :: SchemaOptions -> SumEncodingopenapi3 Data.OpenApi.SchemaOptions Specifies how to encode constructors of a sum datatype.
sum' :: (Foldable t, Semiring a) => t a -> asemirings Data.Semiring The sum' function computes the additive sum of the elements in a structure. This function is strict. For a lazy version, see sum.
sumAccounts :: Account -> Accounthledger-lib Hledger.Data.Account Add subaccount-inclusive balances to an account tree.
sumPostings :: [Posting] -> MixedAmounthledger-lib Hledger.Data.Posting Sum all amounts from a list of postings.
summary_only :: HasReportOptsNoUpdate c => Lens' c Boolhledger-lib Hledger.Reports.ReportOptions No documentation available.
summary_only_ :: ReportOpts -> Boolhledger-lib Hledger.Reports.ReportOptions No documentation available.
sumStrict :: Num a => [a] -> ahledger-lib Hledger.Utils Strict version of sum that doesn’t leak space
-
numeric-prelude Algebra.Additive Sum up all elements of a non-empty list. This avoids including a zero which is useful for types where no universal zero is available. ToDo: Should have NonEmpty type.
\(QC.NonEmpty ns) -> A.sum ns == (A.sum1 ns :: Integer)
sumNestedAssociative :: C a => [a] -> anumeric-prelude Algebra.Additive Sum the operands in an order, such that the dependencies are minimized. Does this have a measurably effect on speed? Requires associativity.
\ns -> A.sum ns == (A.sumNestedAssociative ns :: Integer)
sumNestedCommutative :: C a => [a] -> anumeric-prelude Algebra.Additive Make sure that the last entries in the list are equally often part of an addition. Maybe this can reduce rounding errors. The list that sum2 computes is a breadth-first-flattened binary tree. Requires associativity and commutativity.
\ns -> A.sum ns == (A.sumNestedCommutative ns :: Integer)