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.

Exact lookup

1. mapEither3M :: Applicative m => (a -> m (Either3 b c d)) -> [a] -> m ([b], [c], [d])

   Agda	Agda.Utils.Three

   No documentation available.

2. mapSubTries :: Ord k => (Trie k u -> Maybe v) -> Trie k u -> Trie k v

   Agda	Agda.Utils.Trie

   Create new values based on the entire subtrie. Almost, but not quite comonad extend.

3. mapFst :: (a -> c) -> (a, b) -> (c, b)

   Agda	Agda.Utils.Tuple

   mapFst f = f -*- id
   

4. mapFstM :: Functor m => (a -> m c) -> (a, b) -> m (c, b)

   Agda	Agda.Utils.Tuple

   Monadic mapFst.

5. mapPairM :: Applicative m => (a -> m c) -> (b -> m d) -> (a, b) -> m (c, d)

   Agda	Agda.Utils.Tuple

   Monadic version of -*-.

6. mapSnd :: (b -> d) -> (a, b) -> (a, d)

   Agda	Agda.Utils.Tuple

   mapSnd g = id -*- g
   

7. mapSndM :: Functor m => (b -> m d) -> (a, b) -> m (a, d)

   Agda	Agda.Utils.Tuple

   Monadic mapSnd.

8. mapChangeT :: (m (a, Any) -> n (b, Any)) -> ChangeT m a -> ChangeT n b

   Agda	Agda.Utils.Update

   Map a ChangeT computation (monad transformer action).

9. mapMonotonic :: (Key -> Key) -> IntSet -> IntSet

   Agda	Agda.Utils.VarSet

   The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:

   and [x < y ==> f x < f y | x <- ls, y <- ls]
   ==> mapMonotonic f s == map f s
   where ls = toList s
   

10. mapValue :: forall a (b :: Bool) . Boolean a => (a -> a) -> WithDefault' a b -> WithDefault' a b

    Agda	Agda.Utils.WithDefault

    Only modify non-Default values.

Page 275 of many | Previous | Next