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.

  1. bifor_ :: (Bifoldable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()

    relude Relude.Foldable.Reexport

    As bitraverse_, but with the structure as the primary argument. For a version that doesn't ignore the results, see bifor.

    Examples

    Basic usage: 
    >>> bifor_ ("Hello", True) print (print . show)
"Hello"
"True"

    >>> bifor_ (Right True) print (print . show)
"True"

    >>> bifor_ (Left "Hello") print (print . show)
"Hello"

  2. class Transformable t

    diagrams-core Diagrams.Core

    Type class for things t which can be transformed.

  3. data Transformation (v :: Type -> Type) n

    diagrams-core Diagrams.Core

    General (affine) transformations, represented by an invertible linear map, its transpose, and a vector representing a translation component. By the transpose of a linear map we mean simply the linear map corresponding to the transpose of the map's matrix representation. For example, any scale is its own transpose, since scales are represented by matrices with zeros everywhere except the diagonal. The transpose of a rotation is the same as its inverse. The reason we need to keep track of transposes is because it turns out that when transforming a shape according to some linear map L, the shape's normal vectors transform according to L's inverse transpose. (For a more detailed explanation and proof, see https://wiki.haskell.org/Diagrams/Dev/Transformations.) This is exactly what we need when transforming bounding functions, which are defined in terms of perpendicular (i.e. normal) hyperplanes. For more general, non-invertible transformations, see Diagrams.Deform (in diagrams-lib).

  4. transform :: Transformable t => Transformation (V t) (N t) -> t -> t

    diagrams-core Diagrams.Core

    Apply a transformation to an object.

  5. module Diagrams.Core.Transform

    Diagrams defines the core library of primitives forming the basis of an embedded domain-specific language for describing and rendering diagrams. The Transform module defines generic transformations parameterized by any vector space.

  6. class Transformable t

    diagrams-core Diagrams.Core.Transform

    Type class for things t which can be transformed.

  7. data Transformation (v :: Type -> Type) n

    diagrams-core Diagrams.Core.Transform

    General (affine) transformations, represented by an invertible linear map, its transpose, and a vector representing a translation component. By the transpose of a linear map we mean simply the linear map corresponding to the transpose of the map's matrix representation. For example, any scale is its own transpose, since scales are represented by matrices with zeros everywhere except the diagonal. The transpose of a rotation is the same as its inverse. The reason we need to keep track of transposes is because it turns out that when transforming a shape according to some linear map L, the shape's normal vectors transform according to L's inverse transpose. (For a more detailed explanation and proof, see https://wiki.haskell.org/Diagrams/Dev/Transformations.) This is exactly what we need when transforming bounding functions, which are defined in terms of perpendicular (i.e. normal) hyperplanes. For more general, non-invertible transformations, see Diagrams.Deform (in diagrams-lib).

  8. Transformation :: (v n :-: v n) -> (v n :-: v n) -> v n -> Transformation (v :: Type -> Type) n

    diagrams-core Diagrams.Core.Transform

    No documentation available.

  9. transform :: Transformable t => Transformation (V t) (N t) -> t -> t

    diagrams-core Diagrams.Core.Transform

    Apply a transformation to an object.

  10. DTransform :: Transformation v n -> DNode b (v :: Type -> Type) n a

    diagrams-core Diagrams.Core.Types

    No documentation available.

Page 573 of many | Previous | Next