Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. mapWithKeyFixedTagsPrecondition :: (Eq v, Eq (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> Bool

   Agda	Agda.Utils.BiMap

   The precondition for mapWithKeyFixedTags f m is that, if m maps k to v, then tag (f k v) == tag v.

2. mapWithKeyPrecondition :: (Eq k, Eq v, Eq (Tag v), HasTag v) => (k -> v -> v) -> BiMap k v -> Bool

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

3. mapLeft :: (a -> c) -> Either a b -> Either c b

   Agda	Agda.Utils.Either

   'Either _ b' is a functor.

4. mapRight :: (b -> d) -> Either a b -> Either a d

   Agda	Agda.Utils.Either

   'Either a' is a functor.

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

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

7. mapMaybe :: (a -> Maybe b) -> List1 a -> [b]

   Agda	Agda.Utils.List1

   Like mapMaybe.

8. mapListT :: (m (Maybe (a, ListT m a)) -> n (Maybe (b, ListT n b))) -> ListT m a -> ListT n b

   Agda	Agda.Utils.ListT

   Boilerplate function to lift MonadReader through the ListT transformer.

9. mapMListT :: Monad m => (a -> m b) -> ListT m a -> ListT m b

   Agda	Agda.Utils.ListT

   Extending a monadic function to ListT.

10. mapMListT_alt :: Monad m => (a -> m b) -> ListT m a -> ListT m b

    Agda	Agda.Utils.ListT

    Alternative implementation using foldListT.

Page 315 of many | Previous | Next