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.

  1. mapEither :: Ord k => (a -> Either b c) -> MaxPQueue k a -> (MaxPQueue k b, MaxPQueue k c)

    pqueue Data.PQueue.Prio.Max

    Map values and separate the Left and Right results.

  2. mapEitherWithKey :: Ord k => (k -> a -> Either b c) -> MaxPQueue k a -> (MaxPQueue k b, MaxPQueue k c)

    pqueue Data.PQueue.Prio.Max

    Map values and separate the Left and Right results.

  3. mapKeys :: Ord k' => (k -> k') -> MaxPQueue k a -> MaxPQueue k' a

    pqueue Data.PQueue.Prio.Max

    Map a function over all values in the queue.

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

  5. 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 () = ⊥.

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

    pqueue Data.PQueue.Prio.Max

    Map values and collect the Just results.

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

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

    pqueue Data.PQueue.Prio.Max

    Map a function over all values in the queue.

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

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

Page 229 of many | Previous | Next