Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

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

   clash-prelude	Clash.Explicit.Prelude.Safe

   No documentation available.

2. 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.Safe

   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
   

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

   clash-prelude	Clash.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
   

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

   clash-prelude	Clash.Prelude

   No documentation available.

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

   clash-prelude	Clash.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
   

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

   clash-prelude	Clash.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
   

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

   clash-prelude	Clash.Prelude.Safe

   No documentation available.

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

   clash-prelude	Clash.Prelude.Safe

   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
   

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

   dimensional	Numeric.Units.Dimensional.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!"
   

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

    distribution-opensuse	OpenSuse.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 11 of many | Previous | Next