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. _eLineWidth :: EnvelopeOpts n -> Measure n

    diagrams-lib Diagrams.TwoD.Model

    No documentation available.

  2. eLineWidth :: forall n1 n2 f . Functor f => (Measure n1 -> f (Measure n2)) -> EnvelopeOpts n1 -> f (EnvelopeOpts n2)

    diagrams-lib Diagrams.TwoD.Model

    No documentation available.

  3. isInsideEvenOdd :: HasQuery t Crossings => t -> Point (V t) (N t) -> Bool

    diagrams-lib Diagrams.TwoD.Path

    Test whether the given point is inside the given path, by testing whether a ray extending from the point in the positive x direction crosses the path an even (outside) or odd (inside) number of times. Note that False is always returned for paths consisting of lines (as opposed to loops), regardless of the number of crossings. 

    isInsideEvenOdd :: Path V2 Double                  -> Point V2 Double -> Bool
isInsideEvenOdd :: Located (Trail V2 Double)       -> Point V2 Double -> Bool
isInsideEvenOdd :: Located (Trail' Loop V2 Double) -> Point V2 Double -> Bool

  4. isInsideWinding :: HasQuery t Crossings => t -> Point (V t) (N t) -> Bool

    diagrams-lib Diagrams.TwoD.Path

    Test whether the given point is inside the given path, by testing whether the point's winding number is nonzero. Note that False is always returned for paths consisting of lines (as opposed to loops), regardless of the winding number. 

    isInsideWinding :: Path V2 Double                  -> Point V2 Double -> Bool
isInsideWinding :: Located (Trail V2 Double)       -> Point V2 Double -> Bool
isInsideWinding :: Located (Trail' Loop V2 Double) -> Point V2 Double -> Bool

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

    diagrams-lib Diagrams.TwoD.Polygons

    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.

  6. polySidesTrail :: OrderedField n => [Angle n] -> [n] -> Located (Trail V2 n)

    diagrams-lib Diagrams.TwoD.Polygons

    Generate the vertices of a polygon specified by side length and angles, and a starting point for the trail such that the origin is at the centroid of the vertices. See PolySides.

  7. mkWidth :: Num n => n -> SizeSpec V2 n

    diagrams-lib Diagrams.TwoD.Size

    Make a SizeSpec with only width defined.

  8. width :: (InSpace V2 n a, Enveloped a) => a -> n

    diagrams-lib Diagrams.TwoD.Size

    Compute the width of an enveloped object. Note this is just diameter unitX.

  9. package genvalidity-sydtest

    Standard properties for functions on `Validity` types for the sydtest framework Standard properties for functions on Validity types for the sydtest framework

  10. module Test.Syd.Validity

    To use the Spec functions in this module, you will need TypeApplications. The most interesting functions in this module for most uses are:

Page 475 of many | Previous | Next