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.

Exact lookup

1. mapF :: (IsList t, Item t ~ (k, v), Buildable k, Buildable v) => t -> Builder

   fmt	Fmt.Internal.Formatters

   A simple JSON-like map formatter; works for Map, HashMap, etc, as well as ordinary lists of pairs.

   >>> mapF [("a", 1), ("b", 4)]
   "{a: 1, b: 4}"
   

   For multiline output, use jsonMapF.

2. mapF' :: (IsList t, Item t ~ (k, v)) => (k -> Builder) -> (v -> Builder) -> t -> Builder

   fmt	Fmt.Internal.Formatters

   A version of mapF that lets you supply your own building function for keys and values.

3. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

   hasql	Hasql.TestingKit.Preludes.Base

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

4. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

   hasql	Hasql.TestingKit.Preludes.Base

   Map the unwrapped computation using the given function.

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

5. mapKeys :: (Eq k', Hashable k') => (k -> k') -> InsOrdHashMap k v -> InsOrdHashMap k' v

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   Order preserving mapping of keys.

6. mapMaybe :: (v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

7. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

8. mapWithKey :: (k -> v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   insert-ordered-containers	Data.HashMap.Strict.InsOrd

   No documentation available.

9. mapped :: (Monad m, Functor f) => (forall x . () => f x -> m (g x)) -> Stream f m r -> Stream g m r

   streaming	Streaming

   Map layers of one functor to another with a transformation involving the base monad. This function is completely functor-general. It is often useful with the more concrete type

   mapped :: (forall x. Stream (Of a) IO x -> IO (Of b x)) -> Stream (Stream (Of a) IO) IO r -> Stream (Of b) IO r
   

   to process groups which have been demarcated in an effectful, IO-based stream by grouping functions like group, split or breaks. Summary functions like fold, foldM, mconcat or toList are often used to define the transformation argument. For example:

   >>> S.toList_ $ S.mapped S.toList $ S.split 'c' (S.each "abcde")
   ["ab","de"]
   

   maps and mapped obey these rules:

   maps id              = id
   mapped return        = id
   maps f . maps g      = maps (f . g)
   mapped f . mapped g  = mapped (f <=< g)
   maps f . mapped g    = mapped (fmap f . g)
   mapped f . maps g    = mapped (f <=< fmap g)
   

   maps is more fundamental than mapped, which is best understood as a convenience for effecting this frequent composition:

   mapped phi = decompose . maps (Compose . phi)
   

10. mappedPost :: (Monad m, Functor g) => (forall x . () => f x -> m (g x)) -> Stream f m r -> Stream g m r

    streaming	Streaming

    A version of mapped that imposes a Functor constraint on the target functor rather than the source functor. This version should be preferred if fmap on the target functor is cheaper.

Page 180 of many | Previous | Next