Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapWithIndex :: (Int -> a -> b) -> Seq a -> Seq brio 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.
mapMonotonic :: (a -> b) -> Set a -> Set brio 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
mapState :: ((a, s) -> (b, s)) -> State s a -> State s brio RIO.State Map both the return value and final state of a computation using the given function.
mapStateT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n brio RIO.State Map both the return value and final state of a computation using the given function.
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.
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.
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.
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.
mapM :: (Monad m, Vector v a, Vector v b) => (a -> m b) -> v a -> m (v b)rio RIO.Vector No documentation available.
mapM_ :: (Monad m, Vector v a) => (a -> m b) -> v a -> m ()rio RIO.Vector No documentation available.