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.

Exact lookup

1. mapWithIndex :: (Int -> a -> b) -> NESeq a -> NESeq b

   nonempty-containers	Data.Sequence.NonEmpty

   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.

2. mapMonotonic :: (a -> b) -> NESet a -> NESet b

   nonempty-containers	Data.Set.NonEmpty

   O(n). 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 = Data.Foldable.toList s
   

3. mappingNamer :: (String -> [String]) -> FieldNamer

   optics-th	Optics.TH

   Create a FieldNamer from a mapping function. If the function returns [], it creates no lens for the field.

4. mapToDMap :: Map k v -> DMap (Const2 k v) Identity

   patch	Data.Functor.Misc

   Convert a regular Map to a DMap

5. mapIntMapPatchWithKey :: (Int -> a -> b) -> PatchIntMap a -> PatchIntMap b

   patch	Data.Patch

   Map a function Int -> a -> b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a PatchIntMap b.

6. mapIntMapPatchWithKey :: (Int -> a -> b) -> PatchIntMap a -> PatchIntMap b

   patch	Data.Patch.IntMap

   Map a function Int -> a -> b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a PatchIntMap b.

7. mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])

   prelude-compat	Data.List2010

   No documentation available.

8. mapAccumR :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])

   prelude-compat	Data.List2010

   No documentation available.

9. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   prelude-compat	Prelude2010

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

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

    prelude-compat	Prelude2010

    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.

Page 244 of many | Previous | Next