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.

Exact lookup

1. asDeformation :: forall (v :: Type -> Type) n . (Additive v, Num n) => Transformation v n -> Deformation v v n

   diagrams-lib	Diagrams.Deform

   asDeformation converts a Transformation to a Deformation by discarding the inverse transform. This allows reusing Transformations in the construction of Deformations.

2. deform :: Deformable a b => Deformation (V a) (V b) (N a) -> a -> b

   diagrams-lib	Diagrams.Deform

   deform d a transforms a by the deformation d. If the type of a is not closed under projection, deform should call deform' with some reasonable default value of epsilon.

3. deform' :: Deformable a b => N a -> Deformation (V a) (V b) (N a) -> a -> b

   diagrams-lib	Diagrams.Deform

   deform' epsilon d a transforms a by the deformation d. If the type of a is not closed under projection, approximate to accuracy epsilon.

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

   diagrams-lib	Diagrams.Prelude

   Similar to makeClassyFor, but takes a declaration quote.

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

   diagrams-lib	Diagrams.Prelude

   Similar to makeLensesFor, but takes a declaration quote.

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

   diagrams-lib	Diagrams.Prelude

   Traverse with an index (and the arguments flipped).

   for a ≡ ifor a . const
   ifor ≡ flip itraverse
   

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

   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 ()
   

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

    diagrams-lib	Diagrams.Prelude

    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
    

Page 552 of many | Previous | Next