Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. productMaybeWith :: (a -> b -> Maybe c) -> [[a]] -> [[b]] -> [[c]]

   leancheck	Test.LeanCheck.Tiers

   Take the product of lists of tiers by a function returning a Maybe value discarding Nothing values.

2. mapMaybeMProp :: (IsList c, IsList d, Eq d, Show d, Show b, Item c ~ a, Item d ~ b, Arbitrary c, Arbitrary b, Show c, Show a, CoArbitrary a, Function a) => Proxy a -> Proxy b -> (forall s . () => (a -> ST s (Maybe b)) -> c -> ST s d) -> Property

   quickcheck-classes-base	Test.QuickCheck.Classes.Base.IsList

   No documentation available.

3. mapMaybeProp :: (IsList c, Item c ~ a, Item d ~ b, Eq d, IsList d, Arbitrary b, Show d, Show b, Arbitrary c, Show c, Show a, Eq c, CoArbitrary a, Function a) => Proxy a -> Proxy b -> ((a -> Maybe b) -> c -> d) -> Property

   quickcheck-classes-base	Test.QuickCheck.Classes.Base.IsList

   Property for the mapMaybe function, which keeps elements for which the predicate holds true.

4. fromMaybeS :: Selective f => f a -> f (Maybe a) -> f a

   selective	Control.Selective

   A lifted version of fromMaybe.

5. greadMaybe :: GRead t => String -> (forall (a :: k) . () => t a -> b) -> Maybe b

   some	Data.GADT.Show

   >>> greadMaybe "InL Refl" mkSome :: Maybe (Some (Sum ((:~:) Int) ((:~:) Bool)))
   Just (mkSome (InL Refl))
   

   >>> greadMaybe "L1 Refl" mkSome :: Maybe (Some ((:~:) Int :+: (:~:) Bool))
   Just (mkSome (L1 Refl))
   

   >>> greadMaybe "garbage" mkSome :: Maybe (Some ((:~:) Int))
   Nothing
   

6. mapMaybeWithKey :: GCompare k2 => (forall (v :: k1) . () => k2 v -> f v -> Maybe (g v)) -> DMap k2 f -> DMap k2 g

   dependent-map	Data.Dependent.Map

   O(n). Map keys/values and collect the Just results.

7. threadMaybe :: (i -> r -> a) -> Split t i r -> SplitM t j i -> SplitM t j a

   fgl	Data.Graph.Inductive.Internal.Thread

   No documentation available.

8. threadMaybe' :: (r -> a) -> Split t i r -> Split t j (Maybe i) -> Split t j (Maybe a)

   fgl	Data.Graph.Inductive.Internal.Thread

   No documentation available.

9. timeoutMaybe :: Exception e => Maybe Int -> e -> IO a -> IO a

   network-transport	Network.Transport.Internal

   If the timeout value is not Nothing, wrap the given computation with a timeout and it if times out throw the specified exception. Identity otherwise.

10. leftToMaybe :: Either l r -> Maybe l

    relude	Relude.Monad.Either

    Maps left part of Either to Maybe.

    >>> leftToMaybe (Left True)
    Just True
    
    >>> leftToMaybe (Right "aba")
    Nothing
    

Page 166 of many | Previous | Next