Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. mutableByteArrayAsForeignPtr :: MutableByteArray RealWorld -> ForeignPtr Word8

   primitive	Data.Primitive.ByteArray

   Variant of byteArrayAsForeignPtr for mutable byte arrays. Similarly, this is only safe on pinned mutable byte arrays. This function differs from the variant for immutable arrays in that it is safe to write to the array though the foreign pointer.

2. declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ

   lens	Control.Lens.Combinators

   Similar to makeClassyFor, but takes a declaration quote.

3. declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ

   lens	Control.Lens.Combinators

   Similar to makeLensesFor, but takes a declaration quote.

4. ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)

   lens	Control.Lens.Combinators

   Traverse with an index (and the arguments flipped).

   for a ≡ ifor a . const
   ifor ≡ flip itraverse
   

5. iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b)

   lens	Control.Lens.Combinators

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results, with access its position (and the arguments flipped).

   forM a ≡ iforM a . const
   iforM ≡ flip imapM
   

6. iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m t

   lens	Control.Lens.Combinators

   Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results, with access its position (and the arguments flipped).

   forMOf l a ≡ iforMOf l a . const
   iforMOf ≡ flip . imapMOf
   

   iforMOf :: Monad m => IndexedLens i s t a b      -> s -> (i -> a -> m b) -> m t
   iforMOf :: Monad m => IndexedTraversal i s t a b -> s -> (i -> a -> m b) -> m t
   

7. iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m ()

   lens	Control.Lens.Combinators

   Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

   iforMOf_ ≡ flip . imapMOf_
   

   When you don't need access to the index then forMOf_ is more flexible in what it accepts.

   forMOf_ l a ≡ iforMOf l a . const
   

   iforMOf_ :: Monad m => IndexedGetter i s a     -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedFold i s a       -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedLens' i s a      -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedTraversal' i s a -> s -> (i -> a -> m r) -> m ()
   

8. iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m ()

   lens	Control.Lens.Combinators

   Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

   iforM_ ≡ flip imapM_
   

   When you don't need access to the index then forM_ is more flexible in what it accepts.

   forM_ a ≡ iforM a . const
   

9. iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t

   lens	Control.Lens.Combinators

   Traverse with an index (and the arguments flipped).

   forOf l a ≡ iforOf l a . const
   iforOf ≡ flip . itraverseOf
   

   iforOf :: Functor f     => IndexedLens i s t a b       -> s -> (i -> a -> f b) -> f t
   iforOf :: Applicative f => IndexedTraversal i s t a b  -> s -> (i -> a -> f b) -> f t
   iforOf :: Apply f       => IndexedTraversal1 i s t a b -> s -> (i -> a -> f b) -> f t
   

10. iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f ()

    lens	Control.Lens.Combinators

    Traverse the targets of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

    iforOf_ ≡ flip . itraverseOf_
    

    When you don't need access to the index then forOf_ is more flexible in what it accepts.

    forOf_ l a ≡ iforOf_ l a . const
    

    iforOf_ :: Functor f     => IndexedGetter i s a     -> s -> (i -> a -> f r) -> f ()
    iforOf_ :: Applicative f => IndexedFold i s a       -> s -> (i -> a -> f r) -> f ()
    iforOf_ :: Functor f     => IndexedLens' i s a      -> s -> (i -> a -> f r) -> f ()
    iforOf_ :: Applicative f => IndexedTraversal' i s a -> s -> (i -> a -> f r) -> f ()
    

Page 415 of many | Previous | Next