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.
-
persistent-redis Database.Persist.Redis The Maybe keyword goes after the type. This indicates that the column is nullable, and the generated Haskell code will have a Maybe type for it. Example:
User name Text Maybe
isFieldMaybe :: FieldDef -> Boolpersistent-redis Database.Persist.Redis Check if the field is `Maybe a`
psMaybe :: MonadReader BridgeData m => m PSTypepurescript-bridge Language.PureScript.Bridge.PSTypes Uses type parameters from haskType (bridged).
lookUpVarMaybe :: Typeable a => Env -> Var a -> Maybe aquickcheck-dynamic Test.QuickCheck.StateModel No documentation available.
suchThatMaybe :: MonadGen m => m a -> (a -> Bool) -> m (Maybe a)quickcheck-transformer Test.QuickCheck.GenT Tries to generate a value that satisfies a predicate.
mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Lazy Apply a function to every value in the tree and create one out of Just values.
mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Lazy Apply a function to every value in the tree and create a tree out of Just results.
mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.
mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia bradix-tree Data.Patricia.Word.Strict Apply a function to every value in the tree and create a tree out of Just results. The Maybe is evaluated to WHNF.
mapMaybe :: (a -> Maybe b) -> Radix1Tree a -> Radix1Tree bradix-tree Data.Radix1Tree.Word8.Lazy Apply a function to every value in the tree and create one out of Just values.