Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. class Deformable a b

   diagrams-lib	Diagrams.Deform

   No documentation available.

2. newtype Deformation (v :: Type -> Type) (u :: Type -> Type) n

   diagrams-lib	Diagrams.Deform

   Deformations are a superset of the affine transformations represented by the Transformation type. In general they are not invertible. Deformations include projective transformations. Deformation can represent other functions from points to points which are "well-behaved", in that they do not introduce small wiggles.

3. Deformation :: (Point v n -> Point u n) -> Deformation (v :: Type -> Type) (u :: Type -> Type) n

   diagrams-lib	Diagrams.Deform

   No documentation available.

4. 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.

5. 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.

6. 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.

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

   diagrams-lib	Diagrams.Prelude

   Similar to makeClassyFor, but takes a declaration quote.

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

   diagrams-lib	Diagrams.Prelude

   Similar to makeLensesFor, but takes a declaration quote.

9. 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
   

10. 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
    

Page 551 of many | Previous | Next