Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. forMArrayM_ :: (MArray a e m, Ix i) => a i e -> (e -> m b) -> m ()

    array Data.Array.MArray.Safe

    forMArrayM_ is mapMArrayM_ with its arguments flipped.

  2. fork# :: (State# RealWorld -> (# State# RealWorld, a_reppoly #)) -> State# RealWorld -> (# State# RealWorld, ThreadId# #)

    ghc-prim GHC.PrimopWrappers

    No documentation available.

  3. forkOn# :: Int# -> (State# RealWorld -> (# State# RealWorld, a_reppoly #)) -> State# RealWorld -> (# State# RealWorld, ThreadId# #)

    ghc-prim GHC.PrimopWrappers

    No documentation available.

  4. forbidden403 :: Status

    http-types Network.HTTP.Types

    Forbidden 403

  5. forbidden403 :: Status

    http-types Network.HTTP.Types.Status

    Forbidden 403

  6. for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f ()

    lens Control.Lens.Combinators

    See forOf_ and traverse1Of_. 

    >>> for1Of_ both1 ("abc", "bcd") (\ks -> Map.fromList [ (k, ()) | k <- ks ])
fromList [('b',()),('c',())]

    for1Of_ :: Apply f => Fold1 s a -> s -> (a -> f r) -> f ()

  7. forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m t

    lens Control.Lens.Combinators

    forMOf is a flipped version of mapMOf, consistent with the definition of forM. 

    >>> forMOf both (1,3) $ \x -> [x, x + 1]
[(1,3),(1,4),(2,3),(2,4)]

    forM ≡ forMOf traverse
forMOf l ≡ flip (mapMOf l)
iforMOf l s ≡ forM l s . Indexed

    forMOf :: Monad m => Iso s t a b       -> s -> (a -> m b) -> m t
forMOf :: Monad m => Lens s t a b      -> s -> (a -> m b) -> m t
forMOf :: Monad m => Traversal s t a b -> s -> (a -> m b) -> m t

  8. forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m ()

    lens Control.Lens.Combinators

    forMOf_ is mapMOf_ with two of its arguments flipped. 

    >>> forMOf_ both ("hello","world") putStrLn
hello
world

    forM_ ≡ forMOf_ folded

    forMOf_ :: Monad m => Getter s a     -> s -> (a -> m r) -> m ()
forMOf_ :: Monad m => Fold s a       -> s -> (a -> m r) -> m ()
forMOf_ :: Monad m => Lens' s a      -> s -> (a -> m r) -> m ()
forMOf_ :: Monad m => Iso' s a       -> s -> (a -> m r) -> m ()
forMOf_ :: Monad m => Traversal' s a -> s -> (a -> m r) -> m ()
forMOf_ :: Monad m => Prism' s a     -> s -> (a -> m r) -> m ()

  9. forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t

    lens Control.Lens.Combinators

    A version of traverseOf with the arguments flipped, such that: 

    >>> forOf each (1,2,3) print
1
2
3
((),(),())
    This function is only provided for consistency, flip is strictly more general. 
    forOf ≡ flip
forOf ≡ flip . traverseOf

    for ≡ forOf traverse
ifor l s ≡ for l s . Indexed

    forOf :: Functor f => Iso s t a b -> s -> (a -> f b) -> f t
forOf :: Functor f => Lens s t a b -> s -> (a -> f b) -> f t
forOf :: Applicative f => Traversal s t a b -> s -> (a -> f b) -> f t

  10. forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()

    lens Control.Lens.Combinators

    Traverse over all of the targets of a Fold (or Getter), computing an Applicative (or Functor)-based answer, but unlike forOf do not construct a new structure. forOf_ generalizes for_ to work over any Fold. When passed a Getter, forOf_ can work over any Functor, but when passed a Fold, forOf_ requires an Applicative. 

    for_ ≡ forOf_ folded

    >>> forOf_ both ("hello","world") putStrLn
hello
world
    The rather specific signature of forOf_ allows it to be used as if the signature was any of: 
    iforOf_ l s ≡ forOf_ l s . Indexed

    forOf_ :: Functor f     => Getter s a     -> s -> (a -> f r) -> f ()
forOf_ :: Applicative f => Fold s a       -> s -> (a -> f r) -> f ()
forOf_ :: Functor f     => Lens' s a      -> s -> (a -> f r) -> f ()
forOf_ :: Functor f     => Iso' s a       -> s -> (a -> f r) -> f ()
forOf_ :: Applicative f => Traversal' s a -> s -> (a -> f r) -> f ()
forOf_ :: Applicative f => Prism' s a     -> s -> (a -> f r) -> f ()

Page 15 of many | Previous | Next