Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

7. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

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

   pqueue	Data.PQueue.Prio.Min

   Map a function over all values in the queue.

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

   terminfo	System.Console.Terminfo.Base

   No documentation available.

10. mapBits :: (forall a . Bits a => a -> a) -> Vector Bit -> Vector Bit

    bitvec	Data.Bit

    Map a vectors with the given function. Similar to map, but faster.

    >>> :set -XOverloadedLists
    
    >>> import Data.Bits
    
    >>> mapBits complement [0,1,1]
    [1,0,0]
    

Page 190 of many | Previous | Next