Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. 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.

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

    classy-prelude-yesod ClassyPrelude.Yesod

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

  3. 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.

  4. 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.

  5. 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.

  6. 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

  7. 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

  8. 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

  9. mapM :: (Traversable s t k l, k ~ l, s ~ t, Applicative m k k, Object k a, Object k (t a), ObjectPair k b (t b), ObjectPair k (m b) (m (t b)), TraversalObject k t b) => k a (m b) -> k (t a) (m (t b))

    constrained-categories Control.Category.Constrained.Prelude

    traverse, restricted to endofunctors. May be more efficient to implement.

  10. mapM_ :: forall t k o f a b u . (Foldable t k k, WellPointed k, Monoidal f k k, u ~ UnitObject k, ObjectPair k (f u) (t a), ObjectPair k (f u) a, ObjectPair k u (t a), ObjectPair k (t a) u, ObjectPair k (f u) (f u), ObjectPair k u u, ObjectPair k b u, Object k (f b)) => k a (f b) -> k (t a) (f u)

    constrained-categories Control.Category.Constrained.Prelude

    The distinction between mapM_ and traverse_ doesn't really make sense on grounds of Monoidal / Applicative vs Monad, but it has in fact some benefits to restrict this to endofunctors, to make the constraint list at least somewhat shorter.

Page 338 of many | Previous | Next