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. mapExceptional :: (e0 -> e1) -> (a -> b) -> Exceptional e0 a -> Exceptional e1 b

   explicit-exception	Control.Monad.Exception.Synchronous

   No documentation available.

2. mapExceptionalT :: (m (Exceptional e0 a) -> n (Exceptional e1 b)) -> ExceptionalT e0 m a -> ExceptionalT e1 n b

   explicit-exception	Control.Monad.Exception.Synchronous

   No documentation available.

3. mapRIO :: (outer -> inner) -> RIO inner a -> RIO outer a

   rio	RIO

   Lift one RIO env to another.

4. mapAccumL :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)

   rio	RIO.ByteString

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new ByteString.

5. mapAccumR :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)

   rio	RIO.ByteString

   The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString.

6. mapAccumL :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)

   rio	RIO.ByteString.Lazy

   The mapAccumL function behaves like a combination of map and foldl; it applies a function to each element of a ByteString, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new ByteString.

7. mapAccumR :: (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)

   rio	RIO.ByteString.Lazy

   The mapAccumR function behaves like a combination of map and foldr; it applies a function to each element of a ByteString, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new ByteString.

8. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   rio	RIO.HashMap

   Transform this map by applying a function to every value and retaining only some of them.

9. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   rio	RIO.HashMap

   Transform this map by applying a function to every value and retaining only some of them.

10. mapWithKey :: (k -> v1 -> v2) -> HashMap k v1 -> HashMap k v2

    rio	RIO.HashMap

    Transform this map by applying a function to every value.

Page 164 of many | Previous | Next