Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b

   monads-tf	Control.Monad.Writer.Strict

   Map both the return value and output of a computation using the given function.

   • runWriter (mapWriter f m) = f (runWriter
     m)

2. mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b

   monads-tf	Control.Monad.Writer.Strict

   Map both the return value and output of a computation using the given function.

   • runWriterT (mapWriterT f m) = f
     (runWriterT m)

3. mapAccumL :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap	Data.MonoidMap

   Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property:

   mapAccumL f s m ==
   fmap fromMap (Traversable.mapAccumL f s (toMap m))
   

4. mapAccumLWithKey :: MonoidNull v2 => (s -> k -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap	Data.MonoidMap

   Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property:

   mapAccumLWithKey f s m ==
   fmap fromMap (Map.mapAccumWithKey f s (toMap m))
   

5. mapAccumR :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap	Data.MonoidMap

   Threads an accumulating argument through the map in descending order of keys. Satisfies the following property:

   mapAccumR f s m ==
   fmap fromMap (Traversable.mapAccumR f s (toMap m))
   

6. mapAccumRWithKey :: MonoidNull v2 => (s -> k -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

   monoidmap	Data.MonoidMap

   Threads an accumulating argument through the map in descending order of keys. Satisfies the following property:

   mapAccumRWithKey f s m ==
   fmap fromMap (Map.mapAccumRWithKey f s (toMap m))
   

7. mapKeys :: (Ord k2, MonoidNull v) => (k1 -> k2) -> MonoidMap k1 v -> MonoidMap k2 v

   monoidmap	Data.MonoidMap

   Applies a function to all the keys of a MonoidMap that are associated with non-null values. If the resultant map would contain more than one value for the same key, values are combined together in ascending key order with the (<>) operator. Satisfies the following property for all possible keys k:

   get k (mapKeys f m) ==
   foldMap
   (`get` m)
   (filter ((==) k . f) (nonNullKeys m))
   

8. mapKeysWith :: (Ord k2, MonoidNull v) => (v -> v -> v) -> (k1 -> k2) -> MonoidMap k1 v -> MonoidMap k2 v

   monoidmap	Data.MonoidMap

   Applies a function to all the keys of a MonoidMap that are associated with non-null values, with a combining function for values. If the resultant map would contain more than one value for the same key, values are combined together in ascending key order with the given combining function. Satisfies the following property:

   mapKeysWith c f == fromListWith c . fmap (first f) . toList
   

9. mapWithKey :: MonoidNull v2 => (k -> v1 -> v2) -> MonoidMap k v1 -> MonoidMap k v2

   monoidmap	Data.MonoidMap

   Applies a key-dependent function to all non-null values of a MonoidMap. Satisfies the following properties for all functions f:

   (nonNullKey k m) ==> (get k (mapWithKey f m) == f k (get k m))
   (   nullKey k m) ==> (get k (mapWithKey f m) == mempty       )
   

10. mapAPI :: (MapAPI a b, Applicative m) => (GQLRequest -> m GQLResponse) -> a -> m b

    morpheus-graphql-app	Data.Morpheus.App

    No documentation available.

Page 224 of many | Previous | Next