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. PolyRegular :: Int -> n -> PolyType n

   diagrams-lib	Diagrams.TwoD

   A regular polygon with the given number of sides (first argument) and the given radius (second argument).

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

3. data PolyType n

   diagrams-lib	Diagrams.TwoD

   Method used to determine the vertices of a polygon.

4. data PolygonOpts n

   diagrams-lib	Diagrams.TwoD

   Options for specifying a polygon.

5. PolygonOpts :: PolyType n -> PolyOrientation n -> Point V2 n -> PolygonOpts n

   diagrams-lib	Diagrams.TwoD

   No documentation available.

6. module Diagrams.TwoD.Path

   Paths in two dimensions are special since we may stroke them to create a 2D diagram, and (eventually) perform operations such as intersection and union. They also have a trace, whereas paths in higher dimensions do not.

7. module Diagrams.TwoD.Points

   Special functions for points in R2.

8. module Diagrams.TwoD.Polygons

   This module defines a general API for creating various types of polygons.

9. data PolyOrientation n

   diagrams-lib	Diagrams.TwoD.Polygons

   Determine how a polygon should be oriented.

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

    diagrams-lib	Diagrams.TwoD.Polygons

    A "polar" polygon.

    • The first argument is a list of central angles from each vertex to the next.
    • The second argument is a list of radii from the origin to each successive vertex.
    To construct an n-gon, use a list of n-1 angles and n radii. Extra angles or radii are ignored. Cyclic polygons (with all vertices lying on a circle) can be constructed using a second argument of (repeat r).

Page 292 of many | Previous | Next