Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   rio	RIO.Prelude

   Monadic mapMaybe.

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

   rio	RIO.Prelude

   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. mapWithIndex :: (Int -> a -> b) -> Seq a -> Seq b

   rio	RIO.Seq

   A generalization of fmap, mapWithIndex takes a mapping function that also depends on the element's index, and applies it to every element in the sequence.

4. mapMonotonic :: (a -> b) -> Set a -> Set b

   rio	RIO.Set.Unchecked

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

5. mapState :: ((a, s) -> (b, s)) -> State s a -> State s b

   rio	RIO.State

   Map both the return value and final state of a computation using the given function.

   • runState (mapState f m) = f . runState
     m

6. mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b

   rio	RIO.State

   Map both the return value and final state of a computation using the given function.

   • runStateT (mapStateT f m) = f .
     runStateT m

7. mapAccumL :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)

   rio	RIO.Text

   O(n) Like a combination of map and foldl'. Applies a function to each element of a Text, passing an accumulating parameter from left to right, and returns a final Text. Performs replacement on invalid scalar values.

8. mapAccumR :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)

   rio	RIO.Text

   The mapAccumR function behaves like a combination of map and a strict foldr; it applies a function to each element of a Text, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new Text. Performs replacement on invalid scalar values.

9. mapAccumL :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)

   rio	RIO.Text.Lazy

   O(n) Like a combination of map and foldl'. Applies a function to each element of a Text, passing an accumulating parameter from left to right, and returns a final Text. Performs replacement on invalid scalar values.

10. mapAccumR :: (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)

    rio	RIO.Text.Lazy

    The mapAccumR function behaves like a combination of map and a strict foldr; it applies a function to each element of a Text, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new Text. Performs replacement on invalid scalar values.

Page 127 of many | Previous | Next