@@ -29,11 +29,11 @@ class Path:
29
29
The underlying storage is made up of two parallel numpy arrays:
30
30
31
31
- *vertices*: an Nx2 float array of vertices
32
- - *codes*: an N-length uint8 array of vertex types , or None
32
+ - *codes*: an N-length uint8 array of path codes , or None
33
33
34
34
These two arrays always have the same length in the first
35
35
dimension. For example, to represent a cubic curve, you must
36
- provide three vertices as well as three codes ``CURVE4``.
36
+ provide three vertices and three ``CURVE4`` codes .
37
37
38
38
The code types are:
39
39
@@ -109,7 +109,7 @@ def __init__(self, vertices, codes=None, _interpolation_steps=1,
109
109
handled correctly by the Agg PathIterator and other consumers of
110
110
path data, such as :meth:`iter_segments`.
111
111
codes : array-like or None, optional
112
- n -length array integers representing the codes of the path.
112
+ N -length array of integers representing the codes of the path.
113
113
If not None, codes must be the same length as vertices.
114
114
If None, *vertices* will be treated as a series of line segments.
115
115
_interpolation_steps : int, optional
@@ -288,7 +288,7 @@ def make_compound_path_from_polys(cls, XY):
288
288
Make a compound path object to draw a number
289
289
of polygons with equal numbers of sides XY is a (numpolys x
290
290
numsides x 2) numpy array of vertices. Return object is a
291
- :class:`Path`
291
+ :class:`Path`.
292
292
293
293
.. plot:: gallery/misc/histogram_path.py
294
294
@@ -314,8 +314,8 @@ def make_compound_path_from_polys(cls, XY):
314
314
@classmethod
315
315
def make_compound_path (cls , * args ):
316
316
"""
317
- Make a compound path from a list of Path objects. Blindly removes all
318
- Path.STOP control points.
317
+ Make a compound path from a list of ` Path` objects. Blindly removes
318
+ all ` Path.STOP` control points.
319
319
"""
320
320
# Handle an empty list in args (i.e. no args).
321
321
if not args :
@@ -917,8 +917,8 @@ def unit_circle_righthalf(cls):
917
917
@classmethod
918
918
def arc (cls , theta1 , theta2 , n = None , is_wedge = False ):
919
919
"""
920
- Return the unit circle arc from angles *theta1* to *theta2* (in
921
- degrees).
920
+ Return a `Path` for the unit circle arc from angles *theta1* to
921
+ *theta2* (in degrees).
922
922
923
923
*theta2* is unwrapped to produce the shortest arc within 360 degrees.
924
924
That is, if *theta2* > *theta1* + 360, the arc will be from *theta1* to
@@ -996,8 +996,8 @@ def arc(cls, theta1, theta2, n=None, is_wedge=False):
996
996
@classmethod
997
997
def wedge (cls , theta1 , theta2 , n = None ):
998
998
"""
999
- Return the unit circle wedge from angles *theta1* to *theta2* (in
1000
- degrees).
999
+ Return a `Path` for the unit circle wedge from angles *theta1* to
1000
+ *theta2* (in degrees).
1001
1001
1002
1002
*theta2* is unwrapped to produce the shortest wedge within 360 degrees.
1003
1003
That is, if *theta2* > *theta1* + 360, the wedge will be from *theta1*
0 commit comments