Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapWriter :: ((a, w) -> (b, w')) -> Writer w a -> Writer w' b

   automaton	Data.Automaton.Trans.Writer

   Map both the return value and output of a computation using the given function.

   • runWriter (mapWriter f m) = f (runWriter
     m)

2. mapWriterT :: (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b

   automaton	Data.Automaton.Trans.Writer

   Map both the return value and output of a computation using the given function.

   • runWriterT (mapWriterT f m) = f
     (runWriterT m)

3. mapOutput :: forall (m :: Type -> Type) a b e . Functor m => (a -> b) -> StreamExcept a m e -> StreamExcept b m e

   automaton	Data.Stream.Except

   Apply a function to the output of the stream

4. mapOptimizedStreamT :: (Functor m, Functor n) => (forall s . () => m (Result s a) -> n (Result s b)) -> OptimizedStreamT m a -> OptimizedStreamT n b

   automaton	Data.Stream.Optimized

   Change the output type and effect of a stream without changing its state type.

5. mapResultState :: (s1 -> s2) -> Result s1 a -> Result s2 a

   automaton	Data.Stream.Result

   Apply a function to the state of a Result.

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

   base-prelude	BasePrelude

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

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

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

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

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

Page 212 of many | Previous | Next