Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. mapOverIncludePaths :: (FilePath -> FilePath) -> DynFlags -> DynFlags

   hie-bios	HIE.Bios.Ghc.Gap

   No documentation available.

2. mapData :: (Unbox a, Unbox b, Bin bin) => (Vector a -> Vector b) -> Histogram bin a -> Histogram bin b

   histogram-fill	Data.Histogram

   No documentation available.

3. mapData :: (Vector v a, Vector u b, Bin bin) => (v a -> u b) -> Histogram v bin a -> Histogram u bin b

   histogram-fill	Data.Histogram.Generic

   No documentation available.

4. mapToJSON :: [(Text, PersistValue)] -> Text

   hledger-web	Hledger.Web.Import

   Convert map (list of tuples) into textual representation of JSON object. This is a type-constrained synonym for toJsonText.

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

   hledger-web	Hledger.Web.Import

   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.

6. mapAccumL :: forall a b c . (Storable b, Storable c) => (a -> b -> (a, c)) -> a -> Vector b -> (a, Vector c)

   hw-prim	HaskellWorks.Data.Vector.Storable

   No documentation available.

7. map2I :: (a -> Bool) -> (a -> [[a]]) -> [a] -> [a]

   intermediate-structures	Data.IntermediateStructures1

   Function that applies additional function f :: a -> [[a]] to a if p :: a -> Bool and p a = True

8. mapI :: (a -> Bool) -> (a -> [a]) -> [a] -> [a]

   intermediate-structures	Data.IntermediateStructures1

   Function that applies additional function f :: a -> [a] to a if p :: a -> Bool and p a = True

9. mapI_ :: (Foldable t, Monoidal f) => (a -> f ()) -> t a -> f ()

   invertible	Control.Invertible.Monoidal

   Map each element to a monoidal and sequenceI_ the results.

10. mapMaybeI :: Monoidal f => (a -> f (Maybe b)) -> [a] -> f [b]

    invertible	Control.Invertible.Monoidal

    Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).

Page 304 of many | Previous | Next