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. initMaybe :: [a] -> Maybe [a]

   Agda	Agda.Utils.List

   init, safe. O(n).

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

   Agda	Agda.Utils.List

   Last element (safe). O(n).

3. mapMaybeAndRest :: (a -> Maybe b) -> [a] -> ([b], Suffix a)

   Agda	Agda.Utils.List

   Like mapMaybe, but additionally return the last partition of the list where the function always returns Nothing. O(n).

4. partitionMaybe :: (a -> Maybe b) -> [a] -> ([a], [b])

   Agda	Agda.Utils.List

   Partition a list into Nothings and Justs. O(n).

   partitionMaybe f = partitionEithers . map ( a -> maybe (Left a) Right (f a))
   

   Note: mapMaybe f = snd . partitionMaybe f.

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

   Agda	Agda.Utils.List

   Tail function (safe). O(1).

6. catMaybes :: List1 (Maybe a) -> [a]

   Agda	Agda.Utils.List1

   Like catMaybes.

7. mapMaybe :: (a -> Maybe b) -> List1 a -> [b]

   Agda	Agda.Utils.List1

   Like mapMaybe.

8. fromList1Maybe :: List1 a -> Maybe (List2 a)

   Agda	Agda.Utils.List2

   Safe. O(1).

9. fromListMaybe :: [a] -> Maybe (List2 a)

   Agda	Agda.Utils.List2

   Safe. O(1).

10. boolToMaybe :: Bool -> a -> Maybe a

    Agda	Agda.Utils.Maybe

    Retain object when tag is True.

Page 263 of many | Previous | Next