Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

   clash-prelude	Clash.HaskellPrelude

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

2. mappend :: Monoid a => a -> a -> a

   clash-prelude	Clash.HaskellPrelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

3. mapAccumL :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Prelude

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a vector, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumL (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,1 :> 2 :> 4 :> 7 :> Nil)
   

   "mapAccumL f acc xs" corresponds to the following circuit layout:

4. mapAccumR :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Prelude

   The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a vector, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumR (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,10 :> 8 :> 5 :> 1 :> Nil)
   

   "mapAccumR f acc xs" corresponds to the following circuit layout:

5. mapAccumL :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Prelude.Safe

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a vector, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumL (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,1 :> 2 :> 4 :> 7 :> Nil)
   

   "mapAccumL f acc xs" corresponds to the following circuit layout:

6. mapAccumR :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Prelude.Safe

   The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a vector, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumR (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,10 :> 8 :> 5 :> 1 :> Nil)
   

   "mapAccumR f acc xs" corresponds to the following circuit layout:

7. mapFemtoseconds :: (Int64 -> Int64) -> Femtoseconds -> Femtoseconds

   clash-prelude	Clash.Signal.Internal

   Map Int64 fields in Femtoseconds

8. mapSignal# :: forall a b (dom :: Domain) . (a -> b) -> Signal dom a -> Signal dom b

   clash-prelude	Clash.Signal.Internal

   No documentation available.

9. mapAccumL :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

   clash-prelude	Clash.Sized.Vector

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a vector, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new vector.

   >>> mapAccumL (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
   (10,1 :> 2 :> 4 :> 7 :> Nil)
   

   "mapAccumL f acc xs" corresponds to the following circuit layout:

10. mapAccumR :: forall acc x y (n :: Nat) . (acc -> x -> (acc, y)) -> acc -> Vec n x -> (acc, Vec n y)

    clash-prelude	Clash.Sized.Vector

    The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a vector, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new vector.

    >>> mapAccumR (\acc x -> (acc + x,acc + 1)) 0 (1 :> 2 :> 3 :> 4 :> Nil)
    (10,10 :> 8 :> 5 :> 1 :> Nil)
    

    "mapAccumR f acc xs" corresponds to the following circuit layout:

Page 280 of many | Previous | Next