Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. mapAccumROf :: forall k (is :: IxList) s t a b acc . Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)

   optics-core	Optics.Traversal

   This generalizes mapAccumR to an arbitrary Traversal.

   mapAccumR ≡ mapAccumROf traversed
   

   mapAccumROf accumulates State from right to left.

2. mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b

   MonadRandom	Control.Monad.Random.Lazy

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

   • runRand (mapRand f m) = f . runRand
     m

3. mapRandT :: (m (a, g) -> n (b, g)) -> RandT g m a -> RandT g n b

   MonadRandom	Control.Monad.Random.Lazy

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

   • runRandT (mapRandT f m) = f . runRandT
     m

4. mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b

   MonadRandom	Control.Monad.Random.Strict

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

   • runRand (mapRand f m) = f . runRand
     m

5. mapRandT :: (m (a, g) -> n (b, g)) -> RandT g m a -> RandT g n b

   MonadRandom	Control.Monad.Random.Strict

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

   • runRandT (mapRandT f m) = f . runRandT
     m

6. mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b

   MonadRandom	Control.Monad.Trans.Random.Lazy

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

   • runRand (mapRand f m) = f . runRand
     m

7. mapRandT :: (m (a, g) -> n (b, g)) -> RandT g m a -> RandT g n b

   MonadRandom	Control.Monad.Trans.Random.Lazy

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

   • runRandT (mapRandT f m) = f . runRandT
     m

8. mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b

   MonadRandom	Control.Monad.Trans.Random.Strict

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

   • runRand (mapRand f m) = f . runRand
     m

9. mapRandT :: (m (a, g) -> n (b, g)) -> RandT g m a -> RandT g n b

   MonadRandom	Control.Monad.Trans.Random.Strict

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

   • runRandT (mapRandT f m) = f . runRandT
     m

10. mappedFileFree :: (HasCallStack, MonadIO m) => MappedFile -> m ()

    gi-glib	GI.GLib.Structs.MappedFile

    Deprecated: (Since version 2.22)Use mappedFileUnref instead.

Page 119 of many | Previous | Next