Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. mapOutput :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    classy-prelude-yesod ClassyPrelude.Yesod

    Apply a function to all the output values of a ConduitT. This mimics the behavior of fmap for a Source and Conduit in pre-0.4 days. It can also be simulated by fusing with the map conduit from Data.Conduit.List. Since 0.4.1

  2. mapOutputMaybe :: forall (m :: Type -> Type) o1 o2 i r . Monad m => (o1 -> Maybe o2) -> ConduitT i o1 m r -> ConduitT i o2 m r

    classy-prelude-yesod ClassyPrelude.Yesod

    Same as mapOutput, but use a function that returns Maybe values. Since 0.5.0

  3. mapToJSON :: [(Text, PersistValue)] -> Text

    classy-prelude-yesod ClassyPrelude.Yesod

    Convert map (list of tuples) into textual representation of JSON object. This is a type-constrained synonym for toJsonText.

  4. mapToList :: IsMap map => map -> [(ContainerKey map, MapValue map)]

    classy-prelude-yesod ClassyPrelude.Yesod

    Convert a map to a list of key-value pairs.

  5. mapWhileC :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> ConduitT a b m ()

    classy-prelude-yesod ClassyPrelude.Yesod

    Map values as long as the result is Just.

  6. mapWithKey :: IsMap map => (ContainerKey map -> MapValue map -> MapValue map) -> map -> map

    classy-prelude-yesod ClassyPrelude.Yesod

    Apply a function over every key-value pair of a map.

  7. mappend :: Monoid a => a -> a -> a

    classy-prelude-yesod ClassyPrelude.Yesod

    An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

  8. mappendRecordHashMap :: (Monoid r, IsRecordHashMap r c m) => m -> m -> m

    columnar Text.Columnar

    often we will want to construct a Monoid HashMap from Monoid records

  9. mappendRecordMap :: (Monoid r, IsRecordIntMap r c m) => m -> m -> m

    columnar Text.Columnar

    often we will want to construct a Monoid Intmap from Monoid records

  10. mapEither :: (SumToProduct f r t, Object r a, ObjectSum r b c, Object t (f a), ObjectPair t (f b) (f c)) => r a (b + c) -> t (f a) (f b, f c)

    constrained-categories Control.Category.Constrained.Prelude 

    mapEither f ≡ sum2product . fmap f

Page 336 of many | Previous | Next