Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapWithKey :: MonoidNull v2 => (k -> v1 -> v2) -> MonoidMap k v1 -> MonoidMap k v2

   monoidmap	Data.MonoidMap

   Applies a key-dependent function to all non-null values of a MonoidMap. Satisfies the following properties for all functions f:

   (nonNullKey k m) ==> (get k (mapWithKey f m) == f k (get k m))
   (   nullKey k m) ==> (get k (mapWithKey f m) == mempty       )
   

2. mapAPI :: (MapAPI a b, Applicative m) => (GQLRequest -> m GQLResponse) -> a -> m b

   morpheus-graphql-app	Data.Morpheus.App

   No documentation available.

3. mapM :: Monad m => (a -> m b) -> NonEmptyVector a -> m (NonEmptyVector b)

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Apply the monadic action to all elements of the non-empty vector, yielding non-empty vector of results.

   >>> mapM Just (unsafeFromList [1..3])
   Just [1,2,3]
   

   >>> mapM (const Nothing) (unsafeFromList [1..3])
   Nothing
   

4. mapM_ :: Monad m => (a -> m b) -> NonEmptyVector a -> m ()

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Apply the monadic action to all elements of a non-empty vector and ignore the results.

   >>> mapM_ (const $ Just ()) (unsafeFromList [1..3])
   Just ()
   

   >>> mapM_ (const Nothing) (unsafeFromList [1..3])
   Nothing
   

5. mapMaybe :: (a -> Maybe b) -> NonEmptyVector a -> Vector b

   nonempty-vector	Data.Vector.NonEmpty

   O(n) Drop elements when predicate returns Nothing If no elements satisfy the predicate, the resulting vector may be empty.

   >>> mapMaybe (\a -> if a == 2 then Nothing else Just a) (unsafeFromList [1..3])
   [1,3]
   

6. mapInIO :: (output -> IO newOutput) -> Parse output -> Parse newOutput

   ptr	Ptr.Parse

   No documentation available.

7. mapCategoricalPs :: (Num p, Num q) => (p -> q) -> Categorical p e -> Categorical q e

   random-fu	Data.Random.Distribution.Categorical

   Like fmap, but for the probabilities of a categorical distribution.

8. mapIO :: (a -> IO b) -> AddHandler a -> AddHandler b

   reactive-banana	Control.Event.Handler

   Map the event value with an IO action.

9. mapAccum :: MonadMoment m => acc -> Event (acc -> (x, acc)) -> m (Event x, Behavior acc)

   reactive-banana	Reactive.Banana.Combinators

   Efficient combination of accumE and accumB.

10. mapEventIO :: (a -> IO b) -> Event a -> MomentIO (Event b)

    reactive-banana	Reactive.Banana.Frameworks

    Build a new Event that contains the result of an IO computation. The input and result events will not be simultaneous anymore, the latter will occur later than the former. Please use the fmap for Event if your computation is pure. Implementation:

    mapEventIO f e1 = do
    (e2, handler) <- newEvent
    reactimate $ (\a -> f a >>= handler) <$> e1
    return e2
    

Page 225 of many | Previous | Next