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.

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

    mixed-types-num Numeric.MixedTypes.PreludeHiding

    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!"

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

    LambdaHack Game.LambdaHack.Core.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!"

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

    cabal-install-solver Distribution.Solver.Compat.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!"

  4. sconcat1 :: Semigroup t => [t] -> t

    ShellCheck ShellCheck.Prelude

    No documentation available.

  5. sconcatOrDefault :: Semigroup p => p -> [p] -> p

    ShellCheck ShellCheck.Prelude

    No documentation available.

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

    calligraphy Calligraphy.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!"

  7. unconcat :: forall (n :: Nat) (m :: Nat) a . KnownNat n => SNat m -> Vec (n * m) a -> Vec n (Vec m a)

    clash-prelude Clash.Explicit.Prelude

    Split a vector of (n * m) elements into a vector of "vectors of length m", where the length m is given. 

    >>> unconcat d4 (1:>2:>3:>4:>5:>6:>7:>8:>9:>10:>11:>12:>Nil)
(1 :> 2 :> 3 :> 4 :> Nil) :> (5 :> 6 :> 7 :> 8 :> Nil) :> (9 :> 10 :> 11 :> 12 :> Nil) :> Nil

  8. unconcatBitVector# :: forall (n :: Nat) (m :: Nat) . (KnownNat n, KnownNat m) => BitVector (n * m) -> Vec n (BitVector m)

    clash-prelude Clash.Explicit.Prelude

    No documentation available.

  9. unconcatI :: forall (n :: Nat) (m :: Nat) a . (KnownNat n, KnownNat m) => Vec (n * m) a -> Vec n (Vec m a)

    clash-prelude Clash.Explicit.Prelude

    Split a vector of (n * m) elements into a vector of "vectors of length m", where the length m is determined by the context. 

    >>> unconcatI (1:>2:>3:>4:>5:>6:>7:>8:>9:>10:>11:>12:>Nil) :: Vec 2 (Vec 6 Int)
(1 :> 2 :> 3 :> 4 :> 5 :> 6 :> Nil) :> (7 :> 8 :> 9 :> 10 :> 11 :> 12 :> Nil) :> Nil

  10. unconcat :: forall (n :: Nat) (m :: Nat) a . KnownNat n => SNat m -> Vec (n * m) a -> Vec n (Vec m a)

    clash-prelude Clash.Explicit.Prelude.Safe

    Split a vector of (n * m) elements into a vector of "vectors of length m", where the length m is given. 

    >>> unconcat d4 (1:>2:>3:>4:>5:>6:>7:>8:>9:>10:>11:>12:>Nil)
(1 :> 2 :> 3 :> 4 :> Nil) :> (5 :> 6 :> 7 :> 8 :> Nil) :> (9 :> 10 :> 11 :> 12 :> Nil) :> Nil

Page 10 of many | Previous | Next