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.

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

    hedgehog Hedgehog.Internal.Prelude

    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.

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

    hedgehog Hedgehog.Internal.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. mapConfig :: (PropertyConfig -> PropertyConfig) -> Property -> Property

    hedgehog Hedgehog.Internal.Property

    Map a config modification function over a property.

  4. mapMaybe :: (a -> Maybe b) -> Tree a -> Maybe (Tree b)

    hedgehog Hedgehog.Internal.Tree

    No documentation available.

  5. mapMaybeMaybeT :: (a -> Maybe b) -> TreeT (MaybeT Identity) a -> TreeT (MaybeT Identity) b

    hedgehog Hedgehog.Internal.Tree

    No documentation available.

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

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

    hedgehog Hedgehog.Internal.Tree

    Map between TreeT computations.

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

  9. 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"]

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

Page 122 of many | Previous | Next