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. boundedCountMaybeNext :: (Eq a, Bounded a, Enum a) => Maybe a -> Maybe a

   countable	Data.Countable

   No documentation available.

2. countMaybeNext :: Countable a => Maybe a -> Maybe a

   countable	Data.Countable

   No documentation available.

3. finiteCountMaybeNext :: Finite a => Maybe a -> Maybe a

   countable	Data.Searchable

   No documentation available.

4. CqlMaybe :: Maybe Value -> Value

   cql	Database.CQL.Protocol

   No documentation available.

5. CqlMaybe :: Maybe Value -> Value

   cql	Database.CQL.Protocol.Internal

   No documentation available.

6. envMaybe :: Var a => String -> Parser (Maybe a)

   envy	System.Envy

   Environment variable getter returning Maybe

7. suchThatMaybe :: forall a (m :: Type -> Type) . Monad m => FakeT m a -> (a -> Bool) -> FakeT m (Maybe a)

   fakedata	Faker.Combinators

   Tries to generate a value that satisfies a predicate.

   λ> import qualified Faker.Address as AD
   λ> item :: forall a m. Text <- generate $ suchThatMaybe AD.country (x -> (T.length x > 5))
   λ> item
   Just Ecuador
   

8. catMaybes :: Filtrable f => f (Maybe a) -> f a

   filtrable	Data.Filtrable

   catMaybes = mapMaybe id
   

9. mapMaybe :: Filtrable f => (a -> Maybe b) -> f a -> f b

   filtrable	Data.Filtrable

   Map the container with the given function, dropping the elements for which it returns Nothing.

10. mapMaybeA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Maybe b)) -> f a -> p (f b)

    filtrable	Data.Filtrable

    Traverse the container with the given function, dropping the elements for which it returns Nothing.

Page 241 of many | Previous | Next