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

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

   patch	Data.Functor.Misc

   Convert a regular Map to a DMap

3. 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.

4. 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.

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

   prelude-compat	Data.List2010

   No documentation available.

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

   prelude-compat	Data.List2010

   No documentation available.

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

8. 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.

9. mapLeft :: Bifunctor p => (a -> b) -> p a c -> p b c

   rebase	Rebase.Data.Bifunctor

   A more meaningful and conflict-free alias for first.

10. mapRight :: Bifunctor p => (b -> c) -> p a b -> p a c

    rebase	Rebase.Data.Bifunctor

    A more meaningful and conflict-free alias for second.

Page 241 of many | Previous | Next