Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. mapAccumR :: (Storable a, Storable b) => (acc -> a -> (acc, b)) -> acc -> Vector a -> (acc, Vector b)

   storablevector	Data.StorableVector.Lazy

   No documentation available.

2. mapAccumL :: (Storable a, Storable b) => (acc -> a -> (acc, b)) -> acc -> Vector a -> (acc, Vector b)

   storablevector	Data.StorableVector.Lazy.Pattern

   No documentation available.

3. mapAccumR :: (Storable a, Storable b) => (acc -> a -> (acc, b)) -> acc -> Vector a -> (acc, Vector b)

   storablevector	Data.StorableVector.Lazy.Pattern

   No documentation available.

4. mapAccumL :: (Size size, Storable a, Storable b) => (acc -> a -> (acc, b)) -> acc -> Vector size a -> (acc, Vector size b)

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

5. mapAccumR :: (Size size, Storable a, Storable b) => (acc -> a -> (acc, b)) -> acc -> Vector size a -> (acc, Vector size b)

   storablevector	Data.StorableVector.Lazy.Typed

   No documentation available.

6. mapST :: (Storable a, Storable b) => (a -> ST s b) -> Vector a -> ST s (Vector b)

   storablevector	Data.StorableVector.ST.Lazy

   :module + Data.STRef
   VS.unpack $ Control.Monad.ST.runST (do ref <- newSTRef 'a'; mapST (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VS.pack [1,2,3,4::Data.Int.Int16]))
   

7. mapSTLazy :: (Storable a, Storable b) => (a -> ST s b) -> Vector a -> ST s (Vector b)

   storablevector	Data.StorableVector.ST.Lazy

   *Data.StorableVector.ST.Strict Data.STRef> VL.unpack $ Control.Monad.ST.runST (do ref <- newSTRef 'a'; mapSTLazy (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VL.pack VL.defaultChunkSize [1,2,3,4::Data.Int.Int16]))
   "abcd"
   

   The following should not work on infinite streams, since we are in ST with strict >>=. But it works. Why?

   *Data.StorableVector.ST.Strict Data.STRef.Lazy> VL.unpack $ Control.Monad.ST.Lazy.runST (do ref <- newSTRef 'a'; mapSTLazy (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VL.pack VL.defaultChunkSize [0::Data.Int.Int16 ..]))
   "Interrupted.
   

8. mapST :: (Storable a, Storable b) => (a -> ST s b) -> Vector a -> ST s (Vector b)

   storablevector	Data.StorableVector.ST.Strict

   :module + Data.STRef
   VS.unpack $ Control.Monad.ST.runST (do ref <- newSTRef 'a'; mapST (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VS.pack [1,2,3,4::Data.Int.Int16]))
   

9. mapSTLazy :: (Storable a, Storable b) => (a -> ST s b) -> Vector a -> ST s (Vector b)

   storablevector	Data.StorableVector.ST.Strict

   *Data.StorableVector.ST.Strict Data.STRef> VL.unpack $ Control.Monad.ST.runST (do ref <- newSTRef 'a'; mapSTLazy (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VL.pack VL.defaultChunkSize [1,2,3,4::Data.Int.Int16]))
   "abcd"
   

   The following should not work on infinite streams, since we are in ST with strict >>=. But it works. Why?

   *Data.StorableVector.ST.Strict Data.STRef> VL.unpack $ Control.Monad.ST.runST (do ref <- newSTRef 'a'; mapSTLazy (\ _n -> do c <- readSTRef ref; modifySTRef ref succ; return c) (VL.pack VL.defaultChunkSize [0::Data.Int.Int16 ..]))
   "Interrupted.
   

10. mapEntries :: (GenEntry tarPath linkTarget -> Either e' (GenEntry tarPath linkTarget)) -> GenEntries tarPath linkTarget e -> GenEntries tarPath linkTarget (Either e e')

    tar	Codec.Archive.Tar

    This is like the standard map function on lists, but for Entries. It includes failure as a extra possible outcome of the mapping function. If your mapping function cannot fail it may be more convenient to use mapEntriesNoFail

Page 131 of many | Previous | Next