Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

  1. midnightblue :: (Ord a, Floating a) => Colour a

    diagrams-lib Diagrams.Prelude

    No documentation available.

  2. orchid :: (Ord a, Floating a) => Colour a

    diagrams-lib Diagrams.Prelude

    No documentation available.

  3. runIdentity :: Identity a -> a

    diagrams-lib Diagrams.Prelude

    No documentation available.

  4. _orthoWidth :: OrthoLens n -> n

    diagrams-lib Diagrams.ThreeD.Camera

    Width

  5. mm50Wide :: Floating n => PerspectiveLens n

    diagrams-lib Diagrams.ThreeD.Camera

    mm50blWide has the same vertical field of view as mm50, but an aspect ratio of 1.6, suitable for wide screen computer monitors.

  6. orthoWidth :: forall n f . Functor f => (n -> f n) -> OrthoLens n -> f (OrthoLens n)

    diagrams-lib Diagrams.ThreeD.Camera

    No documentation available.

  7. CsgEllipsoid :: Ellipsoid n -> CSG n

    diagrams-lib Diagrams.ThreeD.Shapes

    No documentation available.

  8. data Ellipsoid n

    diagrams-lib Diagrams.ThreeD.Shapes

    No documentation available.

  9. Ellipsoid :: Transformation V3 n -> Ellipsoid n

    diagrams-lib Diagrams.ThreeD.Shapes

    No documentation available.

  10. PolySides :: [Angle n] -> [n] -> PolyType n

    diagrams-lib Diagrams.TwoD

    A polygon determined by the distance between successive vertices and the external angles formed by each three successive vertices. In other words, a polygon specified by "turtle graphics": go straight ahead x1 units; turn by external angle a1; go straight ahead x2 units; turn by external angle a2; etc. The polygon will be centered at the centroid of its vertices.

    • The first argument is a list of vertex angles, giving the external angle at each vertex from the previous vertex to the next. The first angle in the list is the external angle at the second vertex; the first edge always starts out heading in the positive y direction from the first vertex.
    • The second argument is a list of distances between successive vertices.
    To construct an n-gon, use a list of n-2 angles and n-1 edge lengths. Extra angles or lengths are ignored.

Page 473 of many | Previous | Next