Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

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

2. headMaybe :: [a] -> Maybe a

   rio	RIO.List

   No documentation available.

3. initMaybe :: [a] -> Maybe [a]

   rio	RIO.List

   No documentation available.

4. lastMaybe :: [a] -> Maybe a

   rio	RIO.List

   No documentation available.

5. maximumByMaybe :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a

   rio	RIO.List

   No documentation available.

6. maximumMaybe :: (Ord a, Foldable t) => t a -> Maybe a

   rio	RIO.List

   No documentation available.

7. minimumByMaybe :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a

   rio	RIO.List

   No documentation available.

8. minimumMaybe :: (Ord a, Foldable t) => t a -> Maybe a

   rio	RIO.List

   No documentation available.

9. tailMaybe :: [a] -> Maybe [a]

   rio	RIO.List

   No documentation available.

10. mapMaybe :: (a -> Maybe b) -> Map k a -> Map k b

    rio	RIO.Map

    Map values and collect the Just results.

    let f x = if x == "a" then Just "new a" else Nothing
    mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
    

Page 163 of many | Previous | Next