Hoogle Search

Within LTS Haskell 24.27 (ghc-9.10.3)

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

Exact lookup

1. mapKeysMonotonic :: (k -> k') -> MaxPQueue k a -> MaxPQueue k' a

   pqueue	Data.PQueue.Prio.Max

   mapKeysMonotonic f q == mapKeys f q, but only works when f is strictly monotonic. The precondition is not checked. This function has better performance than mapKeys.

2. mapMWithKey :: (Ord k, Monad m) => (k -> a -> m b) -> MaxPQueue k a -> m (MaxPQueue k b)

   pqueue	Data.PQueue.Prio.Max

   A strictly accumulating version of traverseWithKey. This works well in IO and strict State, and is likely what you want for other "strict" monads, where ⊥ >>= pure () = ⊥.

3. mapMaybe :: Ord k => (a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

4. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

5. mapWithKey :: (k -> a -> b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map a function over all values in the queue.

6. mapEither :: Ord k => (a -> Either b c) -> MinPQueue k a -> (MinPQueue k b, MinPQueue k c)

   pqueue	Data.PQueue.Prio.Min

   Map values and separate the Left and Right results.

7. mapEitherWithKey :: Ord k => (k -> a -> Either b c) -> MinPQueue k a -> (MinPQueue k b, MinPQueue k c)

   pqueue	Data.PQueue.Prio.Min

   Map values and separate the Left and Right results.

8. mapKeys :: Ord k' => (k -> k') -> MinPQueue k a -> MinPQueue k' a

   pqueue	Data.PQueue.Prio.Min

   mapKeys f q is the queue obtained by applying f to each key of q.

9. mapKeysMonotonic :: (k -> k') -> MinPQueue k a -> MinPQueue k' a

   pqueue	Data.PQueue.Prio.Min

   mapKeysMonotonic f q == mapKeys f q, but only works when f is (weakly) monotonic. The precondition is not checked. This function has better performance than mapKeys. Note: if the given function returns bottom for any of the keys in the queue, then the portion of the queue which is bottom is unspecified.

10. mapMWithKey :: (Ord k, Monad m) => (k -> a -> m b) -> MinPQueue k a -> m (MinPQueue k b)

    pqueue	Data.PQueue.Prio.Min

    A strictly accumulating version of traverseWithKey. This works well in IO and strict State, and is likely what you want for other "strict" monads, where ⊥ >>= pure () = ⊥.

Page 189 of many | Previous | Next