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. mapMaybeMaybeT :: (a -> Maybe b) -> TreeT (MaybeT Identity) a -> TreeT (MaybeT Identity) b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

2. mapMaybeT :: forall (m :: Type -> Type) a b . (Monad m, Alternative m) => (a -> Maybe b) -> TreeT m a -> TreeT m b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

3. mapTreeT :: (m (NodeT m a) -> m (NodeT m a)) -> TreeT m a -> TreeT m a

   hedgehog	Hedgehog.Internal.Tree

   Map between TreeT computations.

4. mapSplitter :: (b -> a) -> Splitter a -> Splitter b

   split	Data.List.Split

   Split over a different type of element by performing a preprocessing step.

   >>> split (mapSplitter snd $ oneOf "-_") $ zip [0..] "a-bc_d"
   [[(0,'a')],[(1,'-')],[(2,'b'),(3,'c')],[(4,'_')],[(5,'d')]]
   

   >>> import Data.Char (toLower)
   
   >>> split (mapSplitter toLower $ dropDelims $ whenElt (== 'x')) "abXcxd"
   ["ab","c","d"]
   

5. mapSplitter :: (b -> a) -> Splitter a -> Splitter b

   split	Data.List.Split.Internals

   Split over a different type of element by performing a preprocessing step.

   >>> split (mapSplitter snd $ oneOf "-_") $ zip [0..] "a-bc_d"
   [[(0,'a')],[(1,'-')],[(2,'b'),(3,'c')],[(4,'_')],[(5,'d')]]
   

   >>> import Data.Char (toLower)
   
   >>> split (mapSplitter toLower $ dropDelims $ whenElt (== 'x')) "abXcxd"
   ["ab","c","d"]
   

6. mapLeafBenchmarks :: ([String] -> Benchmark -> Benchmark) -> Benchmark -> Benchmark

   tasty-bench	Test.Tasty.Bench

   Map leaf benchmarks (bench, not bgroup) with a provided function, which has an access to leaf's reversed path. This helper is useful for bulk application of bcompare. See also locateBenchmark. Real world examples:

   • https://hackage.haskell.org/package/chimera-0.3.3.0/src/bench/Bench.hs
   • https://hackage.haskell.org/package/text-builder-linear-0.1.1/src/bench/Main.hs

7. map' :: (Mapping p, Functor f) => p a b -> p (f a) (f b)

   profunctors	Data.Profunctor

   Laws:

   map' . rmap f ≡ rmap (fmap f) . map'
   map' . map' ≡ dimap Compose getCompose . map'
   dimap Identity runIdentity . map' ≡ id
   

8. map' :: (Mapping p, Functor f) => p a b -> p (f a) (f b)

   profunctors	Data.Profunctor.Mapping

   Laws:

   map' . rmap f ≡ rmap (fmap f) . map'
   map' . map' ≡ dimap Compose getCompose . map'
   dimap Identity runIdentity . map' ≡ id
   

9. mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

   microlens	Lens.Micro

   This generalizes mapAccumL to an arbitrary Traversal. (Note that it doesn't work on folds, only traversals.)

   mapAccumL ≡ mapAccumLOf traverse
   

10. mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t

    microlens	Lens.Micro

    Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results.

    >>> mapMOf both (\x -> [x, x + 1]) (1,3)
    [(1,3),(1,4),(2,3),(2,4)]
    

Page 82 of many | Previous | Next