Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. liftPowerSumInt1 :: (C a, Eq a, C a) => ([a] -> [a]) -> [a] -> [a]

   numeric-prelude	MathObj.RootSet

   No documentation available.

2. liftPowerSumInt2 :: (C a, Eq a, C a) => ([a] -> [a] -> [a]) -> [a] -> [a] -> [a]

   numeric-prelude	MathObj.RootSet

   No documentation available.

3. toPowerSums :: (C a, C a) => [a] -> [a]

   numeric-prelude	MathObj.RootSet

   No documentation available.

4. truncSeriesSummands :: Series -> Series

   numeric-prelude	Number.Positional

   help showing series summands

5. accsum :: (Additive a, Traversable f) => f a -> f a

   numhask	NumHask

   Compute the accumulating sum of a Traversable.

   >>> accsum [0..10]
   [0,1,3,6,10,15,21,28,36,45,55]
   

6. accsum :: (Additive a, Traversable f) => f a -> f a

   numhask	NumHask.Algebra.Additive

   Compute the accumulating sum of a Traversable.

   >>> accsum [0..10]
   [0,1,3,6,10,15,21,28,36,45,55]
   

7. getSum :: Sum a -> a

   numhask	NumHask.Algebra.Additive

   No documentation available.

8. asum :: (Foldable t, Alternative f) => t (f a) -> f a

   numhask	NumHask.Prelude

   The sum of a collection of actions using (<|>), generalizing concat. asum is just like msum, but generalised to Alternative.

   Examples

   Basic usage:

   >>> asum [Just "Hello", Nothing, Just "World"]
   Just "Hello"
   

9. msum :: (Foldable t, MonadPlus m) => t (m a) -> m a

   numhask	NumHask.Prelude

   The sum of a collection of actions using (<|>), generalizing concat. msum is just like asum, but specialised to MonadPlus.

   Examples

   Basic usage, using the MonadPlus instance for Maybe:

   >>> msum [Just "Hello", Nothing, Just "World"]
   Just "Hello"
   

10. dsumToEither :: DSum (EitherTag a b) Identity -> Either a b

    reflex	Reflex.Class

    Convert DSum to Either. Inverse of eitherToDSum.

Page 129 of many | Previous | Next