Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

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

Exact lookup

1. cancelMany :: [Async a] -> IO ()

   async	Control.Concurrent.Async.Internal

   Cancel multiple asynchronous actions by throwing the AsyncCancelled exception to each of them in turn, then waiting for all the Async threads to complete.

2. waitAny :: [Async a] -> IO (Async a, a)

   async	Control.Concurrent.Async.Internal

   Wait for any of the supplied Asyncs to complete. If the first to complete throws an exception, then that exception is re-thrown by waitAny. The input list must be non-empty. If multiple Asyncs complete or have completed, then the value returned corresponds to the first completed Async in the list.

3. waitAnyCancel :: [Async a] -> IO (Async a, a)

   async	Control.Concurrent.Async.Internal

   Like waitAny, but also cancels the other asynchronous operations as soon as one has completed.

4. waitAnyCatch :: [Async a] -> IO (Async a, Either SomeException a)

   async	Control.Concurrent.Async.Internal

   Wait for any of the supplied asynchronous operations to complete. The value returned is a pair of the Async that completed, and the result that would be returned by wait on that Async. The input list must be non-empty. If multiple Asyncs complete or have completed, then the value returned corresponds to the first completed Async in the list.

5. waitAnyCatchCancel :: [Async a] -> IO (Async a, Either SomeException a)

   async	Control.Concurrent.Async.Internal

   Like waitAnyCatch, but also cancels the other asynchronous operations as soon as one has completed.

6. waitAnyCatchSTM :: [Async a] -> STM (Async a, Either SomeException a)

   async	Control.Concurrent.Async.Internal

   A version of waitAnyCatch that can be used inside an STM transaction.

7. waitAnySTM :: [Async a] -> STM (Async a, a)

   async	Control.Concurrent.Async.Internal

   A version of waitAny that can be used inside an STM transaction.

8. iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool

   lens	Control.Lens.Combinators

   Return whether or not any element in a container satisfies a predicate, with access to the index i. When you don't need access to the index then any is more flexible in what it accepts.

   any ≡ iany . const
   

9. ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool

   lens	Control.Lens.Combinators

   Return whether or not any element viewed through an IndexedFold or IndexedTraversal satisfy a predicate, with access to the i. When you don't need access to the index then anyOf is more flexible in what it accepts.

   anyOf l ≡ ianyOf l . const
   

   ianyOf :: IndexedGetter i s a     -> (i -> a -> Bool) -> s -> Bool
   ianyOf :: IndexedFold i s a       -> (i -> a -> Bool) -> s -> Bool
   ianyOf :: IndexedLens' i s a      -> (i -> a -> Bool) -> s -> Bool
   ianyOf :: IndexedTraversal' i s a -> (i -> a -> Bool) -> s -> Bool
   

10. ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool

    lens	Control.Lens.Fold

    Return whether or not any element viewed through an IndexedFold or IndexedTraversal satisfy a predicate, with access to the i. When you don't need access to the index then anyOf is more flexible in what it accepts.

    anyOf l ≡ ianyOf l . const
    

    ianyOf :: IndexedGetter i s a     -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedFold i s a       -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedLens' i s a      -> (i -> a -> Bool) -> s -> Bool
    ianyOf :: IndexedTraversal' i s a -> (i -> a -> Bool) -> s -> Bool
    

Page 103 of many | Previous | Next