Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. BlockedIndefinitelyOnSTM :: BlockedIndefinitelyOnSTM

   base	GHC.IO.Exception

   No documentation available.

2. blockedIndefinitelyOnSTM :: SomeException

   base	GHC.IO.Exception

   No documentation available.

3. unfoldForestM :: Monad m => (b -> m (a, [b])) -> [b] -> m [Tree a]

   containers	Data.Tree

   Monadic forest builder, in depth-first order

4. unfoldForestM_BF :: Monad m => (b -> m (a, [b])) -> [b] -> m [Tree a]

   containers	Data.Tree

   Monadic forest builder, in breadth-first order See unfoldForest for more info. Implemented using an algorithm adapted from Breadth-First Numbering: Lessons from a Small Exercise in Algorithm Design, by Chris Okasaki, ICFP'00.

5. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

   transformers	Control.Monad.Trans.Maybe

   Convert a Maybe computation to MaybeT.

6. TestManager :: [OptionDescription] -> (OptionSet -> TestTree -> Maybe (IO Bool)) -> Ingredient

   tasty	Test.Tasty.Ingredients

   No documentation available.

7. TestManager :: [OptionDescription] -> (OptionSet -> TestTree -> Maybe (IO Bool)) -> Ingredient

   tasty	Test.Tasty.Runners

   No documentation available.

8. FirstMostWeek :: FirstWeekType

   time	Data.Time.Calendar.WeekDate

   first week is the first week with four days in the year

9. pastMidnight :: DiffTime -> TimeOfDay

   time	Data.Time.LocalTime

   Same as timeToTimeOfDay.

10. uniformListM :: (StatefulGen g m, Uniform a) => Int -> g -> m [a]

    random	System.Random.Stateful

    Generates a list of pseudo-random values.

    Examples

    >>> import System.Random.Stateful
    
    >>> let pureGen = mkStdGen 137
    
    >>> g <- newIOGenM pureGen
    
    >>> uniformListM 10 g :: IO [Bool]
    [True,True,True,True,False,True,True,False,False,False]
    

Page 18 of many | Previous | Next