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. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

    cabal-install-solver Distribution.Solver.Compat.Prelude

    Map a function over all the elements of a container and concatenate the resulting lists.

    Examples

    Basic usage: 
    >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
[1,2,3,10,11,12,100,101,102,1000,1001,1002]

    >>> concatMap (take 3) (Just [1..])
[1,2,3]

  2. concatMap :: Foldable t => (a -> [b]) -> t a -> [b]

    calligraphy Calligraphy.Prelude

    Map a function over all the elements of a container and concatenate the resulting lists.

    Examples

    Basic usage: 
    >>> concatMap (take 3) [[1..], [10..], [100..], [1000..]]
[1,2,3,10,11,12,100,101,102,1000,1001,1002]

    >>> concatMap (take 3) (Just [1..])
[1,2,3]

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

    clash-prelude Clash.Explicit.Prelude

    No documentation available.

  4. concatMap :: forall a (m :: Nat) b (n :: Nat) . (a -> Vec m b) -> Vec n a -> Vec (n * m) b

    clash-prelude Clash.Explicit.Prelude

    Map a function over all the elements of a vector and concatentate the resulting vectors. 

    >>> concatMap (replicate d3) (1:>2:>3:>Nil)
1 :> 1 :> 1 :> 2 :> 2 :> 2 :> 3 :> 3 :> 3 :> Nil

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

    clash-prelude Clash.Explicit.Prelude.Safe

    No documentation available.

  6. concatMap :: forall a (m :: Nat) b (n :: Nat) . (a -> Vec m b) -> Vec n a -> Vec (n * m) b

    clash-prelude Clash.Explicit.Prelude.Safe

    Map a function over all the elements of a vector and concatentate the resulting vectors. 

    >>> concatMap (replicate d3) (1:>2:>3:>Nil)
1 :> 1 :> 1 :> 2 :> 2 :> 2 :> 3 :> 3 :> 3 :> Nil

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

    clash-prelude Clash.Prelude

    No documentation available.

  8. concatMap :: forall a (m :: Nat) b (n :: Nat) . (a -> Vec m b) -> Vec n a -> Vec (n * m) b

    clash-prelude Clash.Prelude

    Map a function over all the elements of a vector and concatentate the resulting vectors. 

    >>> concatMap (replicate d3) (1:>2:>3:>Nil)
1 :> 1 :> 1 :> 2 :> 2 :> 2 :> 3 :> 3 :> 3 :> Nil

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

    clash-prelude Clash.Prelude.Safe

    No documentation available.

  10. concatMap :: forall a (m :: Nat) b (n :: Nat) . (a -> Vec m b) -> Vec n a -> Vec (n * m) b

    clash-prelude Clash.Prelude.Safe

    Map a function over all the elements of a vector and concatentate the resulting vectors. 

    >>> concatMap (replicate d3) (1:>2:>3:>Nil)
1 :> 1 :> 1 :> 2 :> 2 :> 2 :> 3 :> 3 :> 3 :> Nil

Page 5 of many | Previous | Next