Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. zipWithMaybeMatched :: forall (f :: Type -> Type) k x y z . Applicative f => (k -> x -> y -> Maybe z) -> WhenMatched f k x y z

   containers	Data.Map.Strict.Internal

   When a key is found in both maps, apply a function to the key and values and maybe use the result in the merged map.

   zipWithMaybeMatched :: (k -> x -> y -> Maybe z)
   -> SimpleWhenMatched k x y z
   

2. foldToMaybeTree :: (b -> b -> b) -> (a -> b) -> FingerTree a -> Maybe b

   containers	Data.Sequence.Internal.Sorting

   A foldMap-like function, specialized to the Option monoid, which takes advantage of the internal structure of Seq to avoid wrapping in Maybe at certain points.

3. foldToMaybeWithIndexTree :: (b -> b -> b) -> (Int -> Elem y -> b) -> Int -> FingerTree (Elem y) -> Maybe b

   containers	Data.Sequence.Internal.Sorting

   A foldMapWithIndex-like function, specialized to the Option monoid, which takes advantage of the internal structure of Seq to avoid wrapping in Maybe at certain points.

4. exceptToMaybeT :: forall (m :: Type -> Type) e a . Functor m => ExceptT e m a -> MaybeT m a

   transformers	Control.Monad.Trans.Maybe

   Convert a ExceptT computation to MaybeT, discarding the value of any exception.

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

   transformers	Control.Monad.Trans.Maybe

   Convert a Maybe computation to MaybeT.

6. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   transformers	Control.Monad.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

7. runMaybeT :: MaybeT (m :: Type -> Type) a -> m (Maybe a)

   transformers	Control.Monad.Trans.Maybe

   No documentation available.

8. suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)

   QuickCheck	Test.QuickCheck

   Tries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.

9. suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)

   QuickCheck	Test.QuickCheck.Gen

   Tries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.

10. mapMaybe :: (a -> Maybe b) -> KeyMap a -> KeyMap b

    aeson	Data.Aeson.KeyMap

    Map values and collect the Just results.

Page 106 of many | Previous | Next