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.
-
optics-core Optics.Traversal Transform every element in a tree using a user supplied Traversal in a bottom-up manner with a monadic effect.
uniform :: (Foldable t, MonadRandom m) => t a -> m aMonadRandom Control.Monad.Random.Class Sample a value uniformly from a nonempty collection of elements.
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.
-
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.
-
MonadRandom Control.Monad.Random.Lazy The class of types for which a uniformly distributed value can be drawn from a range.
-
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.
-
MonadRandom Control.Monad.Random.Strict The class of types for which a uniformly distributed value can be drawn from a range.
type
C_DataForeachFunc = Word32 -> Ptr () -> Ptr () -> IO ()gi-glib GI.GLib.Callbacks Type for the callback on the (unwrapped) C side.
type
C_NodeForeachFunc = Ptr Node -> Ptr () -> IO ()gi-glib GI.GLib.Callbacks Type for the callback on the (unwrapped) C side.
type
DataForeachFunc = Word32 -> Ptr () -> IO ()gi-glib GI.GLib.Callbacks Specifies the type of function passed to datasetForeach. It is called with each GQuark id and associated data element, together with the userData parameter supplied to datasetForeach.