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.

Exact lookup

1. mconcat_ :: (Monad m, Monoid w) => Stream (Of w) m r -> m w

   streaming	Streaming.Prelude

   No documentation available.

2. data MconcatSym0 (a1 :: TyFun [a] a)

   singletons-base	Prelude.Singletons

   No documentation available.

3. type family MconcatSym1 (a6989586621680307190 :: [a]) :: a

   singletons-base	Prelude.Singletons

   No documentation available.

4. sConcat :: forall (t1 :: Type -> Type) a (t2 :: t1 [a]) . SFoldable t1 => Sing t2 -> Sing (Apply (ConcatSym0 :: TyFun (t1 [a]) [a] -> Type) t2)

   singletons-base	Prelude.Singletons

   No documentation available.

5. sConcatMap :: forall a b (t1 :: Type -> Type) (t2 :: a ~> [b]) (t3 :: t1 a) . SFoldable t1 => Sing t2 -> Sing t3 -> Sing (Apply (Apply (ConcatMapSym0 :: TyFun (a ~> [b]) (t1 a ~> [b]) -> Type) t2) t3)

   singletons-base	Prelude.Singletons

   No documentation available.

6. sMconcat :: forall (t :: [a]) . SMonoid a => Sing t -> Sing (Apply (MconcatSym0 :: TyFun [a] a -> Type) t)

   singletons-base	Prelude.Singletons

   No documentation available.

7. mconcat :: Monoid a => [a] -> a

   numhask	NumHask.Prelude

   Fold a list using the monoid. For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

   >>> mconcat ["Hello", " ", "Haskell", "!"]
   "Hello Haskell!"
   

8. sconcat :: Semigroup a => NonEmpty a -> a

   numhask	NumHask.Prelude

   Reduce a non-empty list with <> The default definition should be sufficient, but this can be overridden for efficiency.

   Examples

   For the following examples, we will assume that we have:

   >>> import Data.List.NonEmpty (NonEmpty (..))
   

   >>> sconcat $ "Hello" :| [" ", "Haskell", "!"]
   "Hello Haskell!"
   

   >>> sconcat $ Just [1, 2, 3] :| [Nothing, Just [4, 5, 6]]
   Just [1,2,3,4,5,6]
   

   >>> sconcat $ Left 1 :| [Right 2, Left 3, Right 4]
   Right 2
   

9. mconcat :: Monoid a => [a] -> a

   ghc-lib-parser	GHC.Prelude.Basic

   Fold a list using the monoid. For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

   >>> mconcat ["Hello", " ", "Haskell", "!"]
   "Hello Haskell!"
   

10. mconcat :: Monoid a => [a] -> a

    rebase	Rebase.Prelude

    Fold a list using the monoid. For most types, the default definition for mconcat will be used, but the function is included in the class definition so that an optimized version can be provided for specific types.

    >>> mconcat ["Hello", " ", "Haskell", "!"]
    "Hello Haskell!"
    

Page 9 of many | Previous | Next