Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
classy-prelude-conduit ClassyPrelude.Conduit Same as mapOutput, but use a function that returns Maybe values. Since 0.5.0
-
classy-prelude-conduit ClassyPrelude.Conduit Run MaybeT in the base monad Since 1.0.11
fromMaybe :: forall c (f :: Type -> Type) a . c -> Colonnade f a c -> Colonnade f (Maybe a) ccolonnade Colonnade Lift a column over a Maybe. For example, if some people have houses and some do not, the data that pairs them together could be represented as:
>>> :{ let owners :: [(Person,Maybe House)] owners = [ (Person "Jordan" 18, Nothing) , (Person "Ruth" 25, Just (House Red 125000)) , (Person "Sonia" 12, Just (House Green 145000)) ] :}The column encodings defined earlier can be reused with the help of fromMaybe:>>> :{ let colOwners :: Colonnade Headed (Person,Maybe House) String colOwners = mconcat [ lmap fst colPerson , lmap snd (fromMaybe "" colHouse) ] :}>>> putStr (ascii colOwners owners) +--------+-----+-------+---------+ | Name | Age | Color | Price | +--------+-----+-------+---------+ | Jordan | 18 | | | | Ruth | 25 | Red | $125000 | | Sonia | 12 | Green | $145000 | +--------+-----+-------+---------+
chooseUnrankMaybe :: Int -> Int -> Int -> Maybe [Bool]combinatorial Combinatorics No documentation available.
boundedCountMaybeNext :: (Eq a, Bounded a, Enum a) => Maybe a -> Maybe acountable Data.Countable No documentation available.
countMaybeNext :: Countable a => Maybe a -> Maybe acountable Data.Countable No documentation available.
finiteCountMaybeNext :: Finite a => Maybe a -> Maybe acountable Data.Searchable No documentation available.
CqlMaybe :: Maybe Value -> Valuecql Database.CQL.Protocol No documentation available.
CqlMaybe :: Maybe Value -> Valuecql Database.CQL.Protocol.Internal No documentation available.
decToMaybe :: Dec a -> Maybe adec Data.Type.Dec