Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

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

   rio	RIO

   Lift one RIO env to another.

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

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

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

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

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

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

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

   rio	RIO.HashMap

   Transform this map by applying a function to every value.

9. mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

   rio	RIO.List

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

   Examples

   Basic usage:

   >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
   (55,[0,1,3,6,10,15,21,28,36,45])
   

   >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
   ("012345",["0","01","012","0123","01234"])
   

10. mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    rio	RIO.List

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

    Examples

    Basic usage:

    >>> mapAccumR (\a b -> (a + b, a)) 0 [1..10]
    (55,[54,52,49,45,40,34,27,19,10,0])
    

    >>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]
    ("054321",["05432","0543","054","05","0"])
    

Page 124 of many | Previous | Next