Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. transformOf :: forall k (is :: IxList) a b . Is k A_Setter => Optic k is a b a b -> (b -> b) -> a -> b

   optics-core	Optics.Setter

   Transform every element by recursively applying a given Setter in a bottom-up manner.

2. transformMOf :: forall k m (is :: IxList) a b . (Is k A_Traversal, Monad m) => Optic k is a b a b -> (b -> m b) -> a -> m b

   optics-core	Optics.Traversal

   Transform every element in a tree using a user supplied Traversal in a bottom-up manner with a monadic effect.

3. uniform :: (Foldable t, MonadRandom m) => t a -> m a

   MonadRandom	Control.Monad.Random.Class

   Sample a value uniformly from a nonempty collection of elements.

4. uniformMay :: (Foldable t, MonadRandom m) => t a -> m (Maybe a)

   MonadRandom	Control.Monad.Random.Class

   Sample a value uniformly from a collection of elements. Return Nothing if the collection is empty.

5. class Uniform a

   MonadRandom	Control.Monad.Random.Lazy

   The class of types for which a uniformly distributed value can be drawn from all possible values of the type.

6. class UniformRange a

   MonadRandom	Control.Monad.Random.Lazy

   The class of types for which a uniformly distributed value can be drawn from a range.

7. class Uniform a

   MonadRandom	Control.Monad.Random.Strict

   The class of types for which a uniformly distributed value can be drawn from all possible values of the type.

8. class UniformRange a

   MonadRandom	Control.Monad.Random.Strict

   The class of types for which a uniformly distributed value can be drawn from a range.

9. type C_DataForeachFunc = Word32 -> Ptr () -> Ptr () -> IO ()

   gi-glib	GI.GLib.Callbacks

   Type for the callback on the (unwrapped) C side.

10. type C_NodeForeachFunc = Ptr Node -> Ptr () -> IO ()

    gi-glib	GI.GLib.Callbacks

    Type for the callback on the (unwrapped) C side.

Page 526 of many | Previous | Next