Convert a ToPath object into a diagram. The resulting diagram has the names 0, 1, ... assigned to each of the path's vertices.

See also stroke', which takes an extra options record allowing its behaviour to be customized.

stroke :: Path V2 Double                  -> Diagram b
stroke :: Located (Trail V2 Double)       -> Diagram b
stroke :: Located (Trail' Loop V2 Double) -> Diagram b
stroke :: Located (Trail' Line V2 Double) -> Diagram b

A variant of stroke that takes an extra record of options to customize its behaviour. In particular:

• Names can be assigned to the path's vertices

StrokeOpts is an instance of Default, so stroke' (with & ... ) syntax may be used.

stroke specialised to Path.

stroke specialised to Path.

stroke' specialised to Path.

stroke' specialised to Path.

stroke specialised to Trail.

stroke specialised to Trail.

A composition of stroke' and pathFromTrail for conveniently converting a trail directly into a diagram.

Deprecated synonym for strokeTrail'.

A composition of strokeT and wrapLine for conveniently converting a line directly into a diagram.

A composition of strokeT and wrapLoop for conveniently converting a loop directly into a diagram.

A convenience function for converting a Located Trail directly into a diagram; strokeLocTrail = stroke . trailLike.

Deprecated synonym for strokeLocTrail.

A convenience function for converting a Located line directly into a diagram; strokeLocLine = stroke . trailLike . mapLoc wrapLine.

A convenience function for converting a Located loop directly into a diagram; strokeLocLoop = stroke . trailLike . mapLoc wrapLoop.

Enumeration of algorithms or "rules" for determining which points lie in the interior of a (possibly self-intersecting) path.

Extract the fill rule from a FillRuleA attribute.

Specify the fill rule that should be used for determining which points are inside a path.

Lens onto the fill rule of a style.

A record of options that control how a path is stroked. StrokeOpts is an instance of Default, so a StrokeOpts records can be created using with { ... } notation.

Atomic names that should be assigned to the vertices of the path so that they can be referenced later. If there are not enough names, the extra vertices are not assigned names; if there are too many, the extra names are ignored. Note that this is a list of lists of names, since paths can consist of multiple trails. The first list of names are assigned to the vertices of the first trail, the second list to the second trail, and so on.

The default value is the empty list.

The fill rule used for determining which points are inside the path. The default is Winding. NOTE: for now, this only affects the resulting diagram's Query, not how it will be drawn! To set the fill rule determining how it is to be drawn, use the fillRule function.

The sum of signed crossings of a path as we travel in the positive x direction from a given point.

• A point is filled according to the Winding fill rule, if the number of Crossings is non-zero (see isInsideWinding).
• A point is filled according to the EvenOdd fill rule, if the number of Crossings is odd (see isInsideEvenOdd).

This is the HasQuery result for Paths, Located Trails and Located Loops.

sample :: Path V2 Double                  -> Point V2 Double -> Crossings
sample :: Located (Trail V2 Double)       -> Point V2 Double -> Crossings
sample :: Located (Trail' Loop V2 Double) -> Point V2 Double -> Crossings

Note that Lines have no inside or outside, so don't contribute crossings

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

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

Clip tracks the accumulated clipping paths applied to a diagram. Note that the semigroup structure on Clip is list concatenation, so applying multiple clipping paths is sensible. The clipping region is the intersection of all the applied clipping paths.

Lens onto the Clip in a style. An empty list means no clipping.

Clip a diagram by the given path:

• Only the parts of the diagram which lie in the interior of the path will be drawn.
• The envelope of the diagram is unaffected.

Clip a diagram to the given path setting its envelope to the pointwise minimum of the envelopes of the diagram and path. The trace consists of those parts of the original diagram's trace which fall within the clipping path, or parts of the path's trace within the original diagram.

Clip a diagram to the clip path taking the envelope and trace of the clip path.

Find the intersect points of two objects that can be converted to a path.

Find the intersect points of two objects that can be converted to a path within the given tolerance.

Compute the intersect points between two paths.

Compute the intersect points between two paths within given tolerance.

Compute the intersect points between two located trails.

Compute the intersect points between two located trails within the given tolerance.