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. readMaybe :: Read a => String -> Maybe a

   cabal-install	Distribution.Client.Utils

   Parse a string using the Read instance. Succeeds if there is exactly one valid result.

   >>> readMaybe "123" :: Maybe Int
   Just 123
   

   >>> readMaybe "hello" :: Maybe Int
   Nothing
   

2. liftMaybe :: (MonadError error m, CoHas option error) => option -> Maybe a -> m a

   can-i-haz	Control.Monad.Except.CoHas

   Lifts a Maybe into any MonadError error. This function injects the passed option if the Maybe is Nothing.

3. mapMaybeVarEnv :: (a -> Maybe b) -> VarEnv a -> VarEnv b

   clash-lib	Clash.Core.VarEnv

   Apply a function to every element in the environment; values for which the function returns Nothing are removed from the environment

4. mapMaybe :: (a -> Maybe b) -> UniqMap a -> UniqMap b

   clash-lib	Clash.Data.UniqMap

   Apply a function to all elements in the map, keeping those where the result is not Nothing.

5. parseMaybeSingle :: (Char -> Bool) -> Text -> Maybe Text

   clash-lib	Clash.Netlist.Id.Common

   No documentation available.

6. isVoidMaybe :: Bool -> Maybe HWType -> Bool

   clash-lib	Clash.Netlist.Util

   No documentation available.

7. deconstructMaybe :: (HasCallStack, Backend backend) => TExpr -> (Text, Text) -> State (BlockState backend) (TExpr, TExpr)

   clash-lib	Clash.Primitives.DSL

   Deconstruct a Maybe into its constructor Bit and contents of its Just field. Note that the contents might be undefined, if the constructor bit is set to Nothing.

8. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

   clash-lib	Clash.Util

   Convert a Maybe computation to MaybeT.

9. mapMaybeEdgeKeys :: (Edge e1, Ord n) => (e0 n -> Maybe (e1 n)) -> Graph e0 n el nl -> Graph e1 n el nl

   comfort-graph	Data.Graph.Comfort

   You may only use this for filtering edges and use more specialised types as a result. You must not alter source and target nodes of edges.

10. fuseBothMaybe :: forall (m :: Type -> Type) a b u v c r . Monad m => Pipe a b u m v -> Pipe b c v m r -> Pipe a c u m (Maybe v, r)

    conduino	Data.Conduino

    Like fuseBoth and &|, except does not wait for the upstream pipe to terminate. Return Nothing in the first field if the upstream pipe hasn't terminated, and Just if it has, with the terminating value.

Page 265 of many | Previous | Next