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.

  1. mapBufferM :: (a -> IO b) -> Buffer a -> IO (Vector b)

    vector-buffer Data.Vector.Buffer

    monadic map over a buffer

  2. mapBufferM_ :: (a -> IO b) -> Buffer a -> IO ()

    vector-buffer Data.Vector.Buffer

    monadic map over a buffer

  3. mapBufferM :: (Prim a, Prim b) => (a -> IO b) -> Buffer a -> IO (Vector b)

    vector-buffer Data.Vector.Primitive.Buffer

    monadic map over a buffer

  4. mapBufferM_ :: Prim a => (a -> IO b) -> Buffer a -> IO ()

    vector-buffer Data.Vector.Primitive.Buffer

    monadic map over a buffer

  5. mapBufferM :: (Storable a, Storable b) => (a -> IO b) -> Buffer a -> IO (Vector b)

    vector-buffer Data.Vector.Storable.Buffer

    monadic map over a buffer

  6. mapBufferM_ :: Storable a => (a -> IO b) -> Buffer a -> IO ()

    vector-buffer Data.Vector.Storable.Buffer

    monadic map over a buffer

  7. mapBufferM :: (Unbox a, Unbox b) => (a -> IO b) -> Buffer a -> IO (Vector b)

    vector-buffer Data.Vector.Unboxed.Buffer

    monadic map over a buffer

  8. mapBufferM_ :: Unbox a => (a -> IO b) -> Buffer a -> IO ()

    vector-buffer Data.Vector.Unboxed.Buffer

    monadic map over a buffer

  9. mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    verset Verset

    The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage:
    >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
    (55,[0,1,3,6,10,15,21,28,36,45])
    
    >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
    ("012345",["0","01","012","0123","01234"])
    

  10. mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    verset Verset

    The mapAccumR function behaves like a combination of fmap and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage:
    >>> mapAccumR (\a b -> (a + b, a)) 0 [1..10]
    (55,[54,52,49,45,40,34,27,19,10,0])
    
    >>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5]
    ("054321",["05432","0543","054","05","0"])
    

Page 395 of many | Previous | Next