Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]

   invertible	Control.Invertible.Monoidal

   Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).

2. sequenceMaybesI :: Monoidal f => [f (Maybe a)] -> f [a]

   invertible	Control.Invertible.Monoidal

   Sequence (like sequenceA) and filter (like catMaybes) a list of monoidals, producing the list of non-Nothing values. Shorter input lists pad with Nothings and longer ones are ignored.

3. consMaybe :: (Maybe a, [a]) <-> [a]

   invertible	Data.Invertible.List

   Convert between (Just head, tail) and the non-empty list head:tail, or (Nothing, list) and list.

4. fromMaybe :: Eq a => a -> Maybe a <-> a

   invertible	Data.Invertible.Maybe

   Convert between Nothing and a default value, or Just and its value (not a true bijection).

5. listToMaybe :: [a] <-> Maybe a

   invertible	Data.Invertible.Maybe

   Convert between (the head of) a (singleton) list and Maybe (see listToMaybe). (invert maybeToList)

6. lookupBaseMaybe :: ParseYamlFile a => BaseDir -> Object -> Text -> Parser (Maybe a)

   keter	Keter.Yaml.FilePath

   A replacement for the .:? operator which will both parse a file path and apply the relative file logic.

7. satisfyMaybe :: (FromServerMessage -> Maybe a) -> Session a

   lsp-test	Language.LSP.Test

   Consumes and returns the result of the specified predicate if it returns Just.

8. getMaybeBij :: MaybeBij -> Maybe Bij

   mappings	Data.Bijection

   No documentation available.

9. data OnMaybe (k1 :: k) (m :: Type -> Type) v

   mappings	Data.Mapping

   Maps on Maybe

10. OnMaybe :: v -> m v -> OnMaybe (k1 :: k) (m :: Type -> Type) v

    mappings	Data.Mapping

    No documentation available.

Page 274 of many | Previous | Next