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.
sumPatParens :: EpAnnSumPat -> [AddEpAnn]ghc GHC.Hs.Pat No documentation available.
sumPatVbarsAfter :: EpAnnSumPat -> [EpaLocation]ghc GHC.Hs.Pat No documentation available.
sumPatVbarsBefore :: EpAnnSumPat -> [EpaLocation]ghc GHC.Hs.Pat No documentation available.
-
ghc GHC.Types.Basic No documentation available.
summaryNodeSummary :: SummaryNode -> ModuleGraphNodeghc GHC.Unit.Module.Graph No documentation available.
summaryExamples :: Summary -> !Inthspec-core Test.Hspec.Core.Runner No documentation available.
summaryFailures :: Summary -> !Inthspec-core Test.Hspec.Core.Runner No documentation available.
-
cmdargs System.Console.CmdArgs.Implicit Modes: "My program name/version/copyright is ..." One line summary of the entire program, the first line of --help and the only line of --version. If the string contains a version number component will also provide --numeric-version.
Sample{..} &= summary "CmdArgs v0.0, (C) Neil Mitchell 1981"
sumOf :: forall k a (is :: IxList) s . (Is k A_Fold, Num a) => Optic' k is s a -> s -> aoptics-core Optics.Fold Calculate the Sum of every number targeted by a Fold.
>>> sumOf each (5,6) 11 >>> sumOf folded [1,2,3,4] 10 >>> sumOf (folded % each) [(1,2),(3,4)] 10
sum ≡ sumOf folded
This operation may be more strict than you would expect. If you want a lazier version use \o -> getSum . foldMapOf o Sum-
optics-core Optics.Fold Return entries of the first Fold, then the second one.
>>> toListOf (_1 % ix 0 `summing` _2 % ix 1) ([1,2], [4,7,1]) [1,7]
For the traversal version see adjoin.