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. mapMaybe :: Ord key => key -> T (Map key elem) (Maybe elem)

   data-accessor	Data.Accessor.Container

   Treats a finite map like an infinite map, where all undefined elements are Nothing and defined elements are Just.

2. mappend :: Monoid a => a -> a -> a

   generic-deriving	Generics.Deriving.Monoid

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

3. mappend' :: forall (x :: k) . Monoid' f => f x -> f x -> f x

   generic-deriving	Generics.Deriving.Monoid

   No documentation available.

4. mappenddefault :: (Generic a, Monoid' (Rep a)) => a -> a -> a

   generic-deriving	Generics.Deriving.Monoid

   No documentation available.

5. mapAdjacent :: Traversable f => (a -> a -> b) -> T f a -> f b

   non-empty	Data.NonEmpty

   No documentation available.

6. mapHead :: forall a (f :: Type -> Type) . (a -> a) -> T f a -> T f a

   non-empty	Data.NonEmpty

   No documentation available.

7. mapTail :: (f a -> g a) -> T f a -> T g a

   non-empty	Data.NonEmpty

   No documentation available.

8. mapWithKey :: Ord k => (k -> a -> b) -> T k a -> T k b

   non-empty	Data.NonEmpty.Map

   No documentation available.

9. mapAdjacent :: (Cons f, Zip f) => (a -> a -> b) -> T f a -> f b

   non-empty	Data.NonEmpty.Mixed

   No documentation available.

10. mapped__ :: (Mapping p, Functor f) => Optic__ p i i (f a) (f b) a b

    optics-core	Optics.Internal.Setter

    Internal implementation of mapped.

Page 117 of many | Previous | Next