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

   hedgehog	Hedgehog.Internal.Property

   Map a config modification function over a property.

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

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

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

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

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

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

   hedgehog	Hedgehog.Internal.Tree

   Map between TreeT computations.

6. mapAsWord128 :: ByteArray bs => (Word128 -> Word128) -> bs -> bs

   memory	Data.ByteArray.Mapping

   map blocks of 128 bits of a bytearray, creating a new bytestring of equivalent size where each blocks has been mapped through f no length checking is done. unsafe

7. mapAsWord64 :: ByteArray bs => (Word64 -> Word64) -> bs -> bs

   memory	Data.ByteArray.Mapping

   map blocks of 64 bits of a bytearray, creating a new bytestring of equivalent size where each blocks has been mapped through f no length checking is done. unsafe

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 119 of many | Previous | Next