Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapWithKeyPrecondition :: (Eq k, Eq v, Eq (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> BoolAgda Agda.Utils.BiMap The precondition for mapWithKey f m: For any two distinct mappings k₁ ↦ v₁, k₂ ↦ v₂ in m for which the tags of f k₁ v₁ and f k₂ v₂ are defined the values of f must be distinct (f k₁ v₁ ≠ f k₂ v₂). Furthermore tag must be injective for { f k v | (k, v) ∈ m }.
mapLeft :: (a -> c) -> Either a b -> Either c bAgda Agda.Utils.Either 'Either _ b' is a functor.
mapRight :: (b -> d) -> Either a b -> Either a dAgda Agda.Utils.Either 'Either a' is a functor.
mapWithEdge :: (Edge n e -> e') -> Graph n e -> Graph n e'Agda Agda.Utils.Graph.AdjacencyMap.Unidirectional A variant of fmap that provides extra information to the function argument. O(n + e).
mapMaybeAndRest :: (a -> Maybe b) -> [a] -> ([b], Suffix a)Agda Agda.Utils.List Like mapMaybe, but additionally return the last partition of the list where the function always returns Nothing. O(n).
mapMaybe :: (a -> Maybe b) -> List1 a -> [b]Agda Agda.Utils.List1 Like mapMaybe.
mapListT :: (m (Maybe (a, ListT m a)) -> n (Maybe (b, ListT n b))) -> ListT m a -> ListT n bAgda Agda.Utils.ListT Boilerplate function to lift MonadReader through the ListT transformer.
mapMListT :: Monad m => (a -> m b) -> ListT m a -> ListT m bAgda Agda.Utils.ListT Extending a monadic function to ListT.
mapMListT_alt :: Monad m => (a -> m b) -> ListT m a -> ListT m bAgda Agda.Utils.ListT Alternative implementation using foldListT.
mapM' :: (Foldable t, Applicative m, Monoid b) => (a -> m b) -> t a -> m bAgda Agda.Utils.Monad Generalized version of traverse_ :: Applicative m => (a -> m ()) -> [a] -> m () Executes effects and collects results in left-to-right order. Works best with left-associative monoids. Note that there is an alternative
mapM' f t = foldr mappend mempty $ mapM f t
that collects results in right-to-left order (effects still left-to-right). It might be preferable for right associative monoids.