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.

  1. 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.

  2. 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.

  3. 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

  4. 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

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

    invertible Control.Invertible.Monoidal

    Map each element to a monoidal and sequenceI_ the results.

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

  7. mapFree :: (forall a' . () => f a' -> m a') -> Free f a -> Free m a

    invertible Control.Invertible.Monoidal.Free

    Transform the type constructor within a Free.

  8. mapConstraint :: (Monad m, Functor m) => (JType -> m JType) -> Constraint -> m Constraint

    jmacro Language.Javascript.JMacro.TypeCheck

    No documentation available.

  9. mapAccum :: (a -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)

    justified-containers Data.Map.Justified

    O(n). The function mapAccum threads an accumulating argument through the map in ascending order of keys.

  10. mapAccumWithKey :: (a -> Key ph k -> b -> (a, c)) -> a -> Map ph k b -> (a, Map ph k c)

    justified-containers Data.Map.Justified

    O(n). The function mapAccumWithKey threads an accumulating argument through the map in ascending order of keys.

Page 345 of many | Previous | Next