Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

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

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

   pqueue	Data.PQueue.Prio.Min

   Map a function over all values in the queue.

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

   terminfo	System.Console.Terminfo.Base

   No documentation available.

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

6. mapInPlace :: PrimMonad m => (forall a . Bits a => a -> a) -> MVector (PrimState m) Bit -> m ()

   bitvec	Data.Bit

   Apply a function to a mutable vector bitwise, rewriting its contents. Cf. mapBits.

   >>> :set -XOverloadedLists
   
   >>> import Data.Bits
   
   >>> Data.Vector.Unboxed.modify (mapInPlace complement) [0,1,1]
   [1,0,0]
   

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

   bitvec	Data.Bit.ThreadSafe

   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]
   

8. mapInPlace :: PrimMonad m => (forall a . Bits a => a -> a) -> MVector (PrimState m) Bit -> m ()

   bitvec	Data.Bit.ThreadSafe

   Apply a function to a mutable vector bitwise, rewriting its contents. Cf. mapBits.

   >>> :set -XOverloadedLists
   
   >>> import Data.Bits
   
   >>> Data.Vector.Unboxed.modify (mapInPlace complement) [0,1,1]
   [1,0,0]
   

9. mapBound :: forall (f :: Type -> Type) b b' a . Functor f => (b -> b') -> Scope b f a -> Scope b' f a

   bound	Bound.Scope

   Perform a change of variables on bound variables.

10. mapMBound :: forall m (f :: Type -> Type) b c a . (Monad m, Traversable f) => (b -> m c) -> Scope b f a -> m (Scope c f a)

    bound	Bound.Scope

    mapM over both bound and free variables

Page 231 of many | Previous | Next