mrhavens/intellecton
1
0
Fork 0
mirror of http://forgejo.openclaw.svc.cluster.local:3000/mrhavens/intellecton.git synced 2026-06-18 01:17:35 +00:00
Code Issues Projects Packages Wiki Activity
intellecton/venv/lib/python3.12/site-packages/matplotlib/__pycache__/path.cpython-312.pyc

597 lines
48 KiB
Text
Raw Normal View History

feat: rigorous physics revision for Paper 1 based on adversarial review
2026-06-01 22:22:35 +00:00
<EFBFBD>
<00>Rj<05><00><00>~<00>dZddlZddlmZddlmZddlZddlZ ddl
m Z m Z ddl mZmZddlmZGd <09>d
<EFBFBD>Zd <0B>Zy) a<>
A module for dealing with the polylines used throughout Matplotlib.
The primary class for polyline handling in Matplotlib is `Path`. Almost all
vector drawing makes use of `Path`\s somewhere in the drawing pipeline.
Whilst a `Path` instance itself cannot be drawn, some `.Artist` subclasses,
such as `.PathPatch` and `.PathCollection`, can be used for convenient `Path`
visualisation.
<EFBFBD>N)<01> lru_cache)<01>WeakValueDictionary<72>)<02>_api<70>_path)<02>_to_unmasked_float_array<61>simple_linear_interpolation)<01> BezierSegmentc <00>\<00>eZdZdZej
Zed<02>Zed<03>Zed<04>Z ed<05>Z
ed<06>Z ed<07>Z edede de
de de diZ d9d
<EFBFBD>Zed:d <0B><01>Zed <0C><00>Zd <0A>Zed<0E><00>Zej*d<0F><00>Zed<10><00>Zej*d<11><00>Zed<12><00>Zej*d<13><00>Zed<14><00>Zej*d<15><00>Zed<16><00>Zd<17>Zd<18>Zd:d<19>Zed<1A><00>Zed<1B><00>Zd<1C>Zd<1D>Z d;d<1F>Z!d <20>Z"d!<21>Z#d<d d dd dd"<22>d#<23>Z$d$<24>Z%d=d%<25>Z&d=d&<26>Z'd:d'<27>Z(d:d(<28>Z)d>d)<29>Z*d>d*<2A>Z+d+<2B>Z,d?d,<2C>Z-dZ.ed-<2D><00>Z/e0<65>Z1ed.<2E><00>Z2e0<65>Z3ed@d/<2F><01>Z4ed0<64><00>Z5dZ6ed1<64><00>Z7edAd2<64><01>Z8dZ9ed3<64><00>Z:edBd4<64><01>Z;ed:d5<64><01>Z<e=e>d6<64>dCd7<64><01><00>Z?d>d8<64>Z@y)D<>Pathu<68>
A series of possibly disconnected, possibly closed, line and curve
segments.
The underlying storage is made up of two parallel numpy arrays:
- *vertices*: an (N, 2) float array of vertices
- *codes*: an N-length `numpy.uint8` array of path codes, or None
These two arrays always have the same length in the first
dimension. For example, to represent a cubic curve, you must
provide three vertices and three `CURVE4` codes.
The code types are:
- `STOP` : 1 vertex (ignored)
A marker for the end of the entire path (currently not required and
ignored)
- `MOVETO` : 1 vertex
Pick up the pen and move to the given vertex.
- `LINETO` : 1 vertex
Draw a line from the current position to the given vertex.
- `CURVE3` : 1 control point, 1 endpoint
Draw a quadratic Bézier curve from the current position, with the given
control point, to the given end point.
- `CURVE4` : 2 control points, 1 endpoint
Draw a cubic Bézier curve from the current position, with the given
control points, to the given end point.
- `CLOSEPOLY` : 1 vertex (ignored)
Draw a line segment to the start point of the current polyline.
If *codes* is None, it is interpreted as a `MOVETO` followed by a series
of `LINETO`.
Users of Path objects should not access the vertices and codes arrays
directly. Instead, they should use `iter_segments` or `cleaned` to get the
vertex/code pairs. This helps, in particular, to consistently handle the
case of *codes* being None.
Some behavior of Path objects can be controlled by rcParams. See the
rcParams whose keys start with 'path.'.
.. note::
The vertices and codes arrays should be treated as
immutable -- there are a number of optimizations and assumptions
made up front in the constructor that will not change when the
data changes.
rr<00><00><00><00>ONFc<00>f<00>t|<01>}tjd|<01><02>|<02><>t|<01>r<>t j
||j <00>}|jdk7st|<02>t|<01>k7r%td|j<00>d|j<00><00><04><00>t|<02>r<>|d|jk7r<>td|j<00>d |d<00><00><04><00>|rbt|<01>rWt jt|<01>|j <00>
<EFBFBD>}|j|d<|j|dd |j|d <||_||_||_|j#<00>|rJd |jj$_|j<00>d |jj$_d |_yd |_y)a<>
Create a new path with the given vertices and codes.
Parameters
----------
vertices : (N, 2) array-like
The path vertices, as an array, masked array or sequence of pairs.
Masked values, if any, will be converted to NaNs, which are then
handled correctly by the Agg PathIterator and other consumers of
path data, such as :meth:`iter_segments`.
codes : array-like or None, optional
N-length array of integers representing the codes of the path.
If not None, codes must be the same length as vertices.
If None, *vertices* will be treated as a series of line segments.
_interpolation_steps : int, optional
Used as a hint to certain projections, such as Polar, that this
path should be linearly interpolated immediately before drawing.
This attribute is primarily an implementation detail and is not
intended for public use.
closed : bool, optional
If *codes* is None and closed is True, vertices will be treated as
line segments of a closed polygon. Note that the last vertex will
then be ignored (as the corresponding code will be set to
`CLOSEPOLY`).
readonly : bool, optional
Makes the path behave in an immutable way and sets the vertices
and codes as read-only arrays.
)Nr )<01>verticesNrz`'codes' must be a 1D list or array with the same length of 'vertices'. Your vertices have shape z but your codes have shape rz7The first element of 'code' must be equal to 'MOVETO' (z). Your first code is <20><01>dtype<70><65><EFBFBD><EFBFBD><EFBFBD>FT)rr<00> check_shape<70>len<65>np<6E>asarray<61> code_type<70>ndim<69>
ValueError<EFBFBD>shape<70>MOVETO<54>empty<74>LINETO<54> CLOSEPOLY<4C> _vertices<65>_codes<65>_interpolation_steps<70>_update_values<65>flags<67> writeable<6C> _readonly)<06>selfr<00>codesr$<00>closed<65>readonlys <20>R/home/antigravity/intellecton/venv/lib/python3.12/site-packages/matplotlib/path.py<70>__init__z Path.__init__cs<><00><00><,<2C>H<EFBFBD>5<><08> <0C><18><18><19>X<EFBFBD>6<> <10> <1C><13>X<EFBFBD><1D><16>J<EFBFBD>J<EFBFBD>u<EFBFBD>d<EFBFBD>n<EFBFBD>n<EFBFBD>5<>E<EFBFBD><14>z<EFBFBD>z<EFBFBD>Q<EFBFBD><EFBFBD>#<23>e<EFBFBD>*<2A><03>H<EFBFBD> <0A>"=<3D> <20>"=<3D>=E<>^<5E>^<5E><L<>M><3E>>C<>k<EFBFBD>k<EFBFBD>]<5D>"L<01>M<01>M<01><13>5<EFBFBD>z<EFBFBD>e<EFBFBD>A<EFBFBD>h<EFBFBD>$<24>+<2B>+<2B>5<> <20>"1<>15<31><1B><1B> <0A>>7<>7<<3C>Q<EFBFBD>x<EFBFBD>j<EFBFBD>"B<01>C<01>C<01><14><03>H<EFBFBD> <0A><16>H<EFBFBD>H<EFBFBD>S<EFBFBD><18>]<5D>$<24>.<2E>.<2E>A<>E<EFBFBD><1B>{<7B>{<7B>E<EFBFBD>!<21>H<EFBFBD><1E>+<2B>+<2B>E<EFBFBD>!<21>B<EFBFBD>K<EFBFBD><1C><0E><0E>E<EFBFBD>"<22>I<EFBFBD>!<21><04><0E><1B><04> <0B>$8<><04>!<21> <0C><1B><1B><1D> <13>-2<>D<EFBFBD>N<EFBFBD>N<EFBFBD> <20> <20> *<2A><13>{<7B>{<7B>&<26>.3<EFBFBD><04> <0B> <0B>!<21>!<21>+<2B>!<21>D<EFBFBD>N<EFBFBD>"<22>D<EFBFBD>N<EFBFBD>c<00><00>|j|<00>}t|<01>|_||_d|_|<03>5|j
|_|j |_|j|_|Sd|_tjd|_d|_|S)a<>
Create a Path instance without the expense of calling the constructor.
Parameters
----------
verts : array-like
codes : array
internals_from : Path or None
If not None, another `Path` from which the attributes
``should_simplify``, ``simplify_threshold``, and
``interpolation_steps`` will be copied. Note that ``readonly`` is
never copied, and always set to ``False`` by this constructor.
FT<46>path.simplify_thresholdr)
<EFBFBD>__new__rr"r#r(<00>_should_simplify<66>_simplify_thresholdr$<00>mpl<70>rcParams)<05>cls<6C>vertsr*<00>internals_from<6F>pths r-<00>_fast_from_codes_and_vertszPath._fast_from_codes_and_verts<74>s<><00><00><12>k<EFBFBD>k<EFBFBD>#<23><1E><03>0<><15>7<><03> <0A><1A><03>
<EFBFBD><1D><03> <0A> <19> %<25>#1<>#B<>#B<>C<EFBFBD> <20>&4<>&H<>&H<>C<EFBFBD> #<23>'5<>'J<>'J<>C<EFBFBD> $<24>
<13>
<EFBFBD>$(<28>C<EFBFBD> <20>&)<29>l<EFBFBD>l<EFBFBD>3L<33>&M<>C<EFBFBD> #<23>'(<28>C<EFBFBD> $<24><12>
r/c<00>\<00>t|<01>}|tj||ddg<02>d<03><04>S)z<>
Create a closed polygonal path going through *vertices*.
Unlike ``Path(..., closed=True)``, *vertices* should **not** end with
an entry for the CLOSEPATH; this entry is added by `._create_closed`.
NrT)r+)rr<00> concatenate)r7r<00>vs r-<00>_create_closedzPath._create_closed<65>s.<00><00> %<25>X<EFBFBD> .<2E><01><12>2<EFBFBD>><3E>><3E>1<EFBFBD>a<EFBFBD><02><11>e<EFBFBD>*<2A>-<2D>d<EFBFBD>;<3B>;r/c<00>><00>tjd|_|jdkDxrotjdxrZt|j<00>dk\xr@|j
duxs0t j|j
tjk<00>|_
y)Nr1rz path.simplify<66><79>) r5r6r4rr"r#r<00>allr r r3<00>r)s r-r%zPath._update_values<65>s<><00><00>#&<26><<3C><<3C>0I<30>#J<><04> <20> <10> $<24> $<24>q<EFBFBD> (<28> H<01> <0F>L<EFBFBD>L<EFBFBD><1F> )<29> H<01> <0F><04><0E><0E> <1F>3<EFBFBD> &<26> H<01><12>[<5B>[<5B>D<EFBFBD> <20> F<>B<EFBFBD>F<EFBFBD>F<EFBFBD>4<EFBFBD>;<3B>;<3B>$<24>+<2B>+<2B>+E<>$F<> <0A>r/c<00><00>|jS)z.The vertices of the `Path` as an (N, 2) array.)r"rCs r-rz Path.vertices<65>s<00><00><14>~<7E>~<7E>r/c<00>`<00>|jr td<01><00>||_|j<00>y)Nz%Can't set vertices on a readonly Path)r(<00>AttributeErrorr"r%)r)rs r-rz Path.vertices<65>s(<00><00> <0F>><3E>><3E> <20>!H<>I<> I<>!<21><04><0E> <0C><1B><1B>r/c<00><00>|jS)a\
The list of codes in the `Path` as a 1D array.
Each code is one of `STOP`, `MOVETO`, `LINETO`, `CURVE3`, `CURVE4` or
`CLOSEPOLY`. For codes that correspond to more than one vertex
(`CURVE3` and `CURVE4`), that code will be repeated so that the length
of `vertices` and `codes` is always the same.
)r#rCs r-r*z
Path.codes<65>s<00><00><14>{<7B>{<7B>r/c<00>`<00>|jr td<01><00>||_|j<00>y)Nz"Can't set codes on a readonly Path)r(rFr#r%)r)r*s r-r*z
Path.codes<65>s(<00><00> <0F>><3E>><3E> <20>!E<>F<> F<><1B><04> <0B> <0C><1B><1B>r/c<00><00>|jS)zi
The fraction of a pixel difference below which vertices will
be simplified out.
<20>r4rCs r-<00>simplify_thresholdzPath.simplify_threshold<6C>s<00><00> <14>'<27>'<27>'r/c<00><00>||_y<00>NrJ)r)<00> thresholds r-rKzPath.simplify_threshold<6C>s
<00><00>#,<2C><04> r/c<00><00>|jS)zD
`True` if the vertices array should be simplified.
<20>r3rCs r-<00>should_simplifyzPath.should_simplify<66>s<00><00>
<14>$<24>$<24>$r/c<00><00>||_yrMrP)r)rQs r-rQzPath.should_simplifys
<00><00> /<2F><04>r/c<00><00>|jS)z4
`True` if the `Path` is read-only.
)r(rCs r-r,z Path.readonly s<00><00>
<14>~<7E>~<7E>r/c<00>,<00>tj|<00>S)z~
Return a shallow copy of the `Path`, which will share the
vertices and codes with the source `Path`.
)<01>copyrCs r-rUz Path.copys<00><00>
<14>y<EFBFBD>y<EFBFBD><14><EFBFBD>r/c <00><><00>t|<00>}|j|<02>x|t|<00><}|jj <00>D]&\}}t ||t j||<01><00><00>(d|_|S)zz
Return a deepcopy of the `Path`. The `Path` will not be
readonly, even if the source `Path` is.
F) <09>typer2<00>id<69>__dict__<5F>items<6D>setattrrU<00>deepcopyr()r)<00>memor7<00>p<>kr>s r-<00> __deepcopy__zPath.__deepcopy__sm<00><00> <13>4<EFBFBD>j<EFBFBD><03> <20>[<5B>[<5B><13>-<2D>-<2D><04>R<EFBFBD><04>X<EFBFBD><0E><11><18>M<EFBFBD>M<EFBFBD>'<27>'<27>)<29> 2<>D<EFBFBD>A<EFBFBD>q<EFBFBD> <13>A<EFBFBD>q<EFBFBD>$<24>-<2D>-<2D><01>4<EFBFBD>0<> 1<> 2<><1C><01> <0B><10>r/c<00>.<00>tj||<01>S)aq
Return a deep copy of the `Path`. The `Path` will not be readonly,
even if the source `Path` is.
Parameters
----------
memo : dict, optional
A dictionary to use for memoizing, passed to `copy.deepcopy`.
Returns
-------
Path
A deep copy of the `Path`, but not readonly.
)rUr\)r)r]s r-r\z Path.deepcopy&s<00><00><14>}<7D>}<7D>T<EFBFBD>4<EFBFBD>(<28>(r/c<00>t<00>|j\}}}|dk7r td<02><00>|dz}||z}tj|df<02>}tj||j
|j <00><04>}|j|dd|<05><|j||d|<05><t|<03>D]} |dd<06>| f|| d|<05><<00>|||<08>S)z<>
Make a compound `Path` object to draw a number of polygons with equal
numbers of sides.
.. plot:: gallery/misc/histogram_path.py
Parameters
----------
XY : (numpolys, numsides, 2) array
r z%The third dimension of 'XY' must be 2rrrN)
rrr<00>zeros<6F>fullr rrr!<00>range)
r7<00>XY<58>numpolys<79>numsides<65>two<77>stride<64>nvertsr8r*<00>is
r-<00>make_compound_path_from_polysz"Path.make_compound_path_from_polys7s<><00><00>#%<25>(<28>(<28><1F><08>(<28>C<EFBFBD> <0E>!<21>8<EFBFBD><1C>D<>E<> E<><19>A<EFBFBD><1C><06><19>F<EFBFBD>"<22><06><12><08><08>&<26>!<21><1B>%<25><05><12><07><07><06><03>
<EFBFBD>
<EFBFBD>#<23>-<2D>-<2D>@<40><05><1E>:<3A>:<3A><05>a<EFBFBD>i<EFBFBD><16>i<EFBFBD><18>"%<25>-<2D>-<2D><05>h<EFBFBD><1E><06><1E><1F><16>x<EFBFBD><1F> (<28>A<EFBFBD>!<21>!<21>Q<EFBFBD>$<24>x<EFBFBD>E<EFBFBD>!<21>)<29>V<EFBFBD>)<29> <1C> (<28><12>5<EFBFBD>%<25> <20> r/c<00>*<00>|s0ttjddgtj<00><03><00>Stj|D<00>cgc]}|j
<00><02>c}<02>}tjt |<03>|j<00><03>}d}|D]a}t |j
<00>}|j<00>'|r7|j||<|j||dz||zn|j||||z||z }<05>c||jk7}|||||<00>Scc}w)z]
Concatenate a list of `Path`\s into a single `Path`, removing all `STOP`\s.
rr rr) r rr<00>float32r=rrrr*rr <00>STOP)r7<00>args<67>pathrr*rl<00>size<7A> not_stop_masks r-<00>make_compound_pathzPath.make_compound_pathSs<><00><00>
<14><17><02><08><08>!<21>Q<EFBFBD><16>r<EFBFBD>z<EFBFBD>z<EFBFBD>:<3A>;<3B> ;<3B><15>><3E>><3E>T<EFBFBD>"B<>T<EFBFBD>4<EFBFBD>=<3D>=<3D>"B<>C<><08><12><08><08><13>X<EFBFBD><1D>c<EFBFBD>m<EFBFBD>m<EFBFBD><<3C><05> <0A><01><18> <16>D<EFBFBD><16>t<EFBFBD>}<7D>}<7D>%<25>D<EFBFBD><13>z<EFBFBD>z<EFBFBD>!<21><17>"<22>z<EFBFBD>z<EFBFBD>E<EFBFBD>!<21>H<EFBFBD>(+<2B>
<EFBFBD>
<EFBFBD>E<EFBFBD>!<21>A<EFBFBD>#<23>a<EFBFBD><04>f<EFBFBD>%<25>"&<26>*<2A>*<2A><05>a<EFBFBD><01>$<24><06><0F> <0A><14>I<EFBFBD>A<EFBFBD> <16><1E><13><18><18>)<29> <0A><12>8<EFBFBD>M<EFBFBD>*<2A>E<EFBFBD>-<2D>,@<40>A<>A<><41>#Cs<00>Dc<00><<00>d|j<00>d|j<00>d<03>S)NzPath(z, <20>))rr*rCs r-<00>__repr__z Path.__repr__is <00><00><16>t<EFBFBD>}<7D>}<7D>'<27>r<EFBFBD>$<24>*<2A>*<2A><1E>q<EFBFBD>9<>9r/c<00>,<00>t|j<00>SrM)rrrCs r-<00>__len__z Path.__len__ls<00><00><12>4<EFBFBD>=<3D>=<3D>!<21>!r/<00><00>?c
#<00><>K<00>t|<00>sy|j||||||||<08><02>} |j}
|j} t | j
<00>} t | j <00>} t| | <0A>D]V\}}|| k(ry|
|dz
}|r:t|<10>D],}t| <0A>tj|t| <0C><00>}<0E>.||f<02><01><00>Xy<01>w)aN
Iterate over all curve segments in the path.
Each iteration returns a pair ``(vertices, code)``, where ``vertices``
is a sequence of 1-3 coordinate pairs, and ``code`` is a `Path` code.
Additionally, this method can provide a number of standard cleanups and
conversions to the path.
Parameters
----------
transform : None or :class:`~matplotlib.transforms.Transform`
If not None, the given affine transformation will be applied to the
path.
remove_nans : bool, optional
Whether to remove all NaNs from the path and skip over them using
MOVETO commands.
clip : None or (float, float, float, float), optional
If not None, must be a four-tuple (x1, y1, x2, y2)
defining a rectangle in which to clip the path.
snap : None or bool, optional
If True, snap all nodes to pixels; if False, don't snap them.
If None, snap if the path contains only segments
parallel to the x or y axes, and no more than 1024 of them.
stroke_width : float, optional
The width of the stroke being drawn (used for path snapping).
simplify : None or bool, optional
Whether to simplify the path by removing vertices
that do not affect its appearance. If None, use the
:attr:`should_simplify` attribute. See also :rc:`path.simplify`
and :rc:`path.simplify_threshold`.
curves : bool, optional
If True, curve segments will be returned as curve segments.
If False, all curves will be converted to line segments.
sketch : None or sequence, optional
If not None, must be a 3-tuple of the form
(scale, length, randomness), representing the sketch parameters.
N)<08> transform<72> remove_nans<6E>clip<69>snap<61> stroke_width<74>simplify<66>curves<65>sketchr) r<00>cleaned<65>NUM_VERTICES_FOR_CODErp<00>iterrr*<00>zipre<00>nextr<00>append)r)r}r~rr<>r<>r<>r<>r<>r<>r<>rprr*<00> curr_vertices<65>code<64>extra_verticesrls r-<00> iter_segmentszPath.iter_segmentsos<><00><00><><00>R<13>4<EFBFBD>y<EFBFBD> <12><16>,<2C>,<2C><19>+6<>T<EFBFBD>$(<28>|<7C>(0<><16>&,<2C> <1F>.<2E><07>!%<25> :<3A> :<3A><1D><13>y<EFBFBD>y<EFBFBD><04><17><07>(<28>(<28>)<29><08><14>W<EFBFBD>]<5D>]<5D>#<23><05>#&<26>x<EFBFBD><15>#7<> &<26> <1F>M<EFBFBD>4<EFBFBD><13>t<EFBFBD>|<7C><15>2<>4<EFBFBD>8<>1<EFBFBD><<3C>N<EFBFBD><1D><1E>~<7E>.<2E>M<01>A<EFBFBD><18><15>K<EFBFBD>$&<26>I<EFBFBD>I<EFBFBD>m<EFBFBD>T<EFBFBD>(<28>^<5E>$L<>M<EFBFBD>M<01> <20><14>%<25> %<25> &<26>s<00>CCc +<00>4K<00>d}d}|jdi|<01><01>D<00>]z\}}|<02>|tjk7r td<02><00>|tjk(r'|}t t j |g<01><00>|f<02><01><00>n|tjk(r%t t j ||g<02><00>|f<02><01>n<>|tjk(r,t t j ||dd|ddg<03><00>|f<02><01>n<>|tjk(r0t t j ||dd|dd|ddg<04><00>|f<02><01>n[|tjk(r%t t j ||g<02><00>|f<02><01>n#|tjk(rytd|<05><00><02><00>|dd}<03><01>}y<01>w)u~
Iterate over each Bézier curve (lines included) in a `Path`.
Parameters
----------
**kwargs
Forwarded to `.iter_segments`.
Yields
------
B : `~matplotlib.bezier.BezierSegment`
The Bézier curves that make up the current path. Note in particular
that freestanding points are Bézier curves of order 0, and lines
are Bézier curves of order 1 (with two control points).
code : `~matplotlib.path.Path.code_type`
The code describing what kind of curve is being returned.
`MOVETO`, `LINETO`, `CURVE3`, and `CURVE4` correspond to
Bézier curves with 1, 2, 3, and 4 control points (respectively).
`CLOSEPOLY` is a `LINETO` with the control points correctly
chosen based on the start/end points of the current stroke.
Nz'Malformed path, must start with MOVETO.r rzInvalid Path.code_type: <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>) r<>r rrr
r<00>arrayr <00>CURVE3<45>CURVE4r!rp)r)<00>kwargs<67>
first_vert<EFBFBD> prev_vertr8r<>s r-<00> iter_bezierzPath.iter_bezier<65>s<><00><00><><00>,<1A>
<EFBFBD><18> <09>-<2D>4<EFBFBD>-<2D>-<2D>7<><06>7<> #<23>K<EFBFBD>E<EFBFBD>4<EFBFBD><19>!<21><17>4<EFBFBD>;<3B>;<3B>&<26>$<24>%N<>O<>O<><13>t<EFBFBD>{<7B>{<7B>"<22>"<22>
<EFBFBD>#<23>B<EFBFBD>H<EFBFBD>H<EFBFBD>j<EFBFBD>\<5C>$:<3A>;<3B>T<EFBFBD>A<>A<><15><14><1B><1B>$<24>#<23>B<EFBFBD>H<EFBFBD>H<EFBFBD>i<EFBFBD><15>-?<3F>$@<40>A<>4<EFBFBD>G<>G<><15><14><1B><1B>$<24>#<23>B<EFBFBD>H<EFBFBD>H<EFBFBD>i<EFBFBD><15>r<EFBFBD><01><19>.3<EFBFBD>A<EFBFBD>B<EFBFBD>i<EFBFBD>.9<EFBFBD>%:<3A>;<3B><@<40>A<01>A<01><15><14><1B><1B>$<24>#<23>B<EFBFBD>H<EFBFBD>H<EFBFBD>i<EFBFBD><15>r<EFBFBD><01><19>.3<EFBFBD>A<EFBFBD>a<EFBFBD>j<EFBFBD>%<25><01><02>)<29>.E<01>%F<01>G<01>HL<48>M<01>M<01><15><14><1E><1E>'<27>#<23>B<EFBFBD>H<EFBFBD>H<EFBFBD>i<EFBFBD><1A>-D<>$E<>F<><04>L<>L<><15><14><19><19>"<22><16> <20>#;<3B>D<EFBFBD>6<EFBFBD>!B<>C<>C<><1D>b<EFBFBD>c<EFBFBD>
<EFBFBD>I<EFBFBD>+ #<23>s<00>FFc#<00>pK<00>|j<00>|<00><01>ytj|jtjk(j <00>dt |j<00><00>}tt||dd<00>D]5}tj|j||j||<00><00><01><00>7y<01>w)z!Return subpaths split at MOVETOs.Nrr) r*rr<>r r<00>nonzeror<00>map<61>slicer;r)r)<00>idxs<78>sls r-<00>_iter_connected_componentszPath._iter_connected_components<74>s<><00><00><><00> <0F>:<3A>:<3A> <1D><16>J<EFBFBD><15>9<EFBFBD>9<EFBFBD>d<EFBFBD>j<EFBFBD>j<EFBFBD>D<EFBFBD>K<EFBFBD>K<EFBFBD>7<>@<40>@<40>B<>1<EFBFBD>E<>s<EFBFBD>4<EFBFBD>:<3A>:<3A><EFBFBD>W<>D<EFBFBD><19>%<25><14>t<EFBFBD>A<EFBFBD>B<EFBFBD>x<EFBFBD>0<> =<3D><02><1A>5<>5<><18>M<EFBFBD>M<EFBFBD>"<22>%<25>t<EFBFBD>z<EFBFBD>z<EFBFBD>"<22>~<7E>t<EFBFBD>=<3D>=<3D> =<3D>s<00>B4B6)r<>r<>r<>r<>r<>c <00><><00>tj|||||||||<08> \} }
tj| |
|<00>} |sd| _| S)z<>
Return a new `Path` with vertices and codes cleaned according to the
parameters.
See Also
--------
Path.iter_segments : for details of the keyword arguments.
F)r<00> cleanup_pathr r;r3) r)r}r~rr<>r<>r<>r<>r<>rr*r:s r-r<>z Path.cleaned<65>sR<00><00> <20>,<2C>,<2C> <10>)<29>[<5B>$<24><04>l<EFBFBD>H<EFBFBD> <12>F<EFBFBD><1C><0F><08>%<25><13>-<2D>-<2D>h<EFBFBD><05>t<EFBFBD>D<><03><17>#(<28>C<EFBFBD> <20><12>
r/c<00>v<00>t|j|j<00>|j|j<00>S)a
Return a transformed copy of the path.
See Also
--------
matplotlib.transforms.TransformedPath
A specialized path class that will cache the transformed result and
automatically update when the transform changes.
)r r}rr*r$)r)r}s r-<00> transformedzPath.transformed<65>s1<00><00><14>I<EFBFBD>'<27>'<27><04> <0A> <0A>6<><04>
<EFBFBD>
<EFBFBD><18>-<2D>-<2D>/<2F> /r/c<00><><00>|<02>|j<00>}|r|js|j|<00>}d}tj|d|d|||<02>S)aZ
Return whether the area enclosed by the path contains the given point.
The path is always treated as closed; i.e. if the last code is not
`CLOSEPOLY` an implicit segment connecting the last vertex to the first
vertex is assumed.
Parameters
----------
point : (float, float)
The point (x, y) to check.
transform : `~matplotlib.transforms.Transform`, optional
If not ``None``, *point* will be compared to ``self`` transformed
by *transform*; i.e. for a correct check, *transform* should
transform the path into the coordinate system of *point*.
radius : float, default: 0
Additional margin on the path in coordinates of *point*.
The path is extended tangentially by *radius/2*; i.e. if you would
draw the path with a linewidth of *radius*, all points on the line
would still be considered to be contained in the area. Conversely,
negative values shrink the area: Points on the imaginary line
will be considered outside the area.
Returns
-------
bool
Notes
-----
The current algorithm has some limitations:
- The result is undefined for points exactly at the boundary
(i.e. at the path shifted by *radius/2*).
- The result is undefined if there is no enclosed area, i.e. all
vertices are on a straight line.
- If bounding lines start to cross each other due to *radius* shift,
the result is not guaranteed to be correct.
Nrr)<05>frozen<65> is_affine<6E>transform_pathr<00> point_in_path)r)<00>pointr}<00>radiuss r-<00>contains_pointzPath.contains_point
s\<00><00>N <15> <20>!<21>(<28>(<28>*<2A>I<EFBFBD>
<15>Y<EFBFBD>0<>0<><1C>+<2B>+<2B>D<EFBFBD>1<>D<EFBFBD><1C>I<EFBFBD><14>"<22>"<22>5<EFBFBD><11>8<EFBFBD>U<EFBFBD>1<EFBFBD>X<EFBFBD>v<EFBFBD>t<EFBFBD>Y<EFBFBD>O<>Or/c<00>x<00>|<02>|j<00>}tj||||<02>}|jd<01>S)a<>
Return whether the area enclosed by the path contains the given points.
The path is always treated as closed; i.e. if the last code is not
`CLOSEPOLY` an implicit segment connecting the last vertex to the first
vertex is assumed.
Parameters
----------
points : (N, 2) array
The points to check. Columns contain x and y values.
transform : `~matplotlib.transforms.Transform`, optional
If not ``None``, *points* will be compared to ``self`` transformed
by *transform*; i.e. for a correct check, *transform* should
transform the path into the coordinate system of *points*.
radius : float, default: 0
Additional margin on the path in coordinates of *points*.
The path is extended tangentially by *radius/2*; i.e. if you would
draw the path with a linewidth of *radius*, all points on the line
would still be considered to be contained in the area. Conversely,
negative values shrink the area: Points on the imaginary line
will be considered outside the area.
Returns
-------
length-N bool array
Notes
-----
The current algorithm has some limitations:
- The result is undefined for points exactly at the boundary
(i.e. at the path shifted by *radius/2*).
- The result is undefined if there is no enclosed area, i.e. all
vertices are on a straight line.
- If bounding lines start to cross each other due to *radius* shift,
the result is not guaranteed to be correct.
<20>bool)r<>r<00>points_in_path<74>astype)r)<00>pointsr}r<><00>results r-<00>contains_pointszPath.contains_points<s><00><00>N <15> <20>!<21>(<28>(<28>*<2A>I<EFBFBD><16>%<25>%<25>f<EFBFBD>f<EFBFBD>d<EFBFBD>I<EFBFBD>F<><06><15>}<7D>}<7D>V<EFBFBD>$<24>$r/c<00>V<00>|<02>|j<00>}tj|d||<02>S)z<>
Return whether this (closed) path completely contains the given path.
If *transform* is not ``None``, the path will be transformed before
checking for containment.
N)r<>r<00> path_in_path)r)rrr}s r-<00> contains_pathzPath.contains_pathhs/<00><00> <15> <20>!<21>(<28>(<28>*<2A>I<EFBFBD><14>!<21>!<21>$<24><04>d<EFBFBD>I<EFBFBD>><3E>>r/c <00><><00>ddlm}|<01>|j|<00>}|j<00> |j}n<>t t j|jtjtjg<02><00>dk(rL|jt j|jtjtjg<02>}n`g}|jdi|<02><01>D]4\}}|j<00>\}}|j!|dg|<08>d<01><01><00><00>6t j"|<04>}t |<04>r*||j%d<03><04>|j'd<03><04>g<02>S|j)<00>S)a<>
Get Bbox of the path.
Parameters
----------
transform : `~matplotlib.transforms.Transform`, optional
Transform to apply to path before computing extents, if any.
**kwargs
Forwarded to `.iter_bezier`.
Returns
-------
matplotlib.transforms.Bbox
The extents of the path Bbox([[xmin, ymin], [xmax, ymax]])
r<00><01>Bboxr)<01>axisr<73>)<15>
transformsr<EFBFBD>r<>r*rrr<00> intersect1dr r<>r<><00>isinrr r<><00>axis_aligned_extremar<61>r=<00>min<69>max<61>null) r)r}r<>r<><00>xys<79>curver<65><00>_<>dzeross r-<00> get_extentszPath.get_extentsss*<00><00> %<25> <14> <20><1C>+<2B>+<2B>D<EFBFBD>1<>D<EFBFBD> <0F>:<3A>:<3A> <1D><16>-<2D>-<2D>C<EFBFBD> <10><12><1E><1E><04>
<EFBFBD>
<EFBFBD>T<EFBFBD>[<5B>[<5B>$<24>+<2B>+<2B>,F<>G<> H<>A<EFBFBD> M<>
<17>-<2D>-<2D><02><07><07><04>
<EFBFBD>
<EFBFBD>)-<2D><1B><1B>d<EFBFBD>k<EFBFBD>k<EFBFBD>(B<>!D<01>E<01>C<EFBFBD><15>C<EFBFBD>/<2F>t<EFBFBD>/<2F>/<2F>9<>&<26>9<> 3<> <0B><05>t<EFBFBD>!<21>6<>6<>8<> <09><01>6<EFBFBD><13>
<EFBFBD>
<EFBFBD>5<EFBFBD>!<21><1F>f<EFBFBD><1F>a<EFBFBD><1F>1<>2<>  3<>
<15>.<2E>.<2E><13>%<25>C<EFBFBD> <0E>s<EFBFBD>8<EFBFBD><17><13><17><17>a<EFBFBD><17><1F>#<23>'<27>'<27>q<EFBFBD>'<27>/<2F>:<3A>;<3B> ;<3B><17>9<EFBFBD>9<EFBFBD>;<3B> r/c<00>0<00>tj|||<02>S)z<>
Return whether if this path intersects another given path.
If *filled* is True, then this also returns True if one path completely
encloses the other (i.e., the paths are treated as filled).
)r<00>path_intersects_path)r)<00>other<65>filleds r-<00>intersects_pathzPath.intersects_path<74>s<00><00><15>)<29>)<29>$<24><05>v<EFBFBD>><3E>>r/c<00><><00>tj||j|j|j|j
|<02>S)a
Return whether this path intersects a given `~.transforms.Bbox`.
If *filled* is True, then this also returns True if the path completely
encloses the `.Bbox` (i.e., the path is treated as filled).
The bounding box is always considered filled.
)r<00>path_intersects_rectangle<6C>x0<78>y0<79>x1<78>y1)r)<00>bboxr<78>s r-<00>intersects_bboxzPath.intersects_bbox<6F>s4<00><00><15>.<2E>.<2E> <10>$<24>'<27>'<27>4<EFBFBD>7<EFBFBD>7<EFBFBD>D<EFBFBD>G<EFBFBD>G<EFBFBD>T<EFBFBD>W<EFBFBD>W<EFBFBD>f<EFBFBD>><3E> >r/c<00><00><01><00>dk(st|<00>dk(r|S|j<00>A|j|jddvr&|j<00>fd<04>|j <00>D<00><00>S|j<00><>|j
|jvr<>t j|j|j|j
k(|jdk(<00>s:|jj<00>}|d||j|j
k(<n |j}t|<02><01>}|j}|<03>Kt jt|<03>dz
<00>zdztj|j<00><05>}||dd<03><01><nd}t||<04>S)a<>
Return a new path with each segment divided into *steps* parts.
Codes other than `LINETO`, `MOVETO`, and `CLOSEPOLY` are not handled correctly.
Parameters
----------
steps : int
The number of segments in the new path for each in the original.
Returns
-------
Path
The interpolated path.
rrNc3<00>@<00>K<00>|]}|j<00><02><00><01><00>y<00>wrM)<01> interpolated)<03>.0r^<00>stepss <20>r-<00> <genexpr>z$Path.interpolated.<locals>.<genexpr><3E>s<00><><00><><00>S<>A<EFBFBD>!<21>.<2E>.<2E><15>'<27>S<>s<00>r)rr*rrur<>r!rrBrrUr rdr r r)r)r<>rr*<00> new_codess ` r-r<>zPath.interpolated<65>sS<00><><00> <11>A<EFBFBD>:<3A><13>T<EFBFBD><19>a<EFBFBD><1E><17>K<EFBFBD> <0F>:<3A>:<3A> !<21>d<EFBFBD>k<EFBFBD>k<EFBFBD>T<EFBFBD>Z<EFBFBD>Z<EFBFBD><01><02>^<5E>&C<>*<2A>4<EFBFBD>*<2A>*<2A>S<><14>1P<31>1P<31>1R<31>S<>U<01> U<01> <10>:<3A>:<3A> !<21>d<EFBFBD>n<EFBFBD>n<EFBFBD><04>
<EFBFBD>
<EFBFBD>&B<>2<EFBFBD>6<EFBFBD>6<EFBFBD><14> <0A> <0A>d<EFBFBD>j<EFBFBD>j<EFBFBD>D<EFBFBD>N<EFBFBD>N<EFBFBD>:<3A>;<3B>t<EFBFBD>}<7D>}<7D>Q<EFBFBD>?O<>O<>LQ<01><1B>}<7D>}<7D>)<29>)<29>+<2B>H<EFBFBD>5=<3D>a<EFBFBD>[<5B>H<EFBFBD>T<EFBFBD>Z<EFBFBD>Z<EFBFBD>4<EFBFBD>><3E>><3E>1<> 2<><1B>}<7D>}<7D>H<EFBFBD>.<2E>x<EFBFBD><15>?<3F><08><14>
<EFBFBD>
<EFBFBD><05> <10> <1C><1A><07><07><13>U<EFBFBD><1A>a<EFBFBD><1E>5<EFBFBD> 8<>1<EFBFBD> <<3C>d<EFBFBD>k<EFBFBD>k<EFBFBD>&*<2A>n<EFBFBD>n<EFBFBD>6<>I<EFBFBD>"'<27>I<EFBFBD>a<EFBFBD>h<EFBFBD><15>h<EFBFBD> <1F><1C>I<EFBFBD><13>H<EFBFBD>i<EFBFBD>(<28>(r/c<00>p<00>t|j<00>dk(rgS|<01>|j<00>}|j<00>f|dk(s|dk(r\|j}|r7t|<05>dkrgSt j
|d|dk7<00>r g|<05>|d<00>}|<01>|gS|j |<05>gStj|||||<04>S)uH
Convert this path to a list of polygons or polylines. Each
polygon/polyline is an (N, 2) array of vertices. In other words,
each polygon has no `MOVETO` instructions or curves. This
is useful for displaying in backends that do not support
compound paths or Bézier curves.
If *width* and *height* are both non-zero then the lines will
be simplified so that vertices outside of (0, 0), (width,
height) will be clipped.
The resulting polygons will be simplified if the
:attr:`Path.should_simplify` attribute of the path is `True`.
If *closed_only* is `True` (default), only closed polygons,
with the last point being the same as the first point, will be
returned. Any unclosed polylines in the path will be
explicitly closed. If *closed_only* is `False`, any unclosed
polygons in the path will be returned as unclosed polygons,
and the closed polygons will be returned explicitly closed by
setting the last point to the same as the first point.
rrr) rrr<>r*r<00>anyr}r<00>convert_path_to_polygons)r)r}<00>width<74>height<68> closed_onlyrs r-<00> to_polygonszPath.to_polygons<6E>s<><00><00>. <0F>t<EFBFBD>}<7D>}<7D> <1D><11> "<22><15>I<EFBFBD> <14> <20>!<21>(<28>(<28>*<2A>I<EFBFBD> <0F>:<3A>:<3A> <1D>5<EFBFBD>A<EFBFBD>:<3A><16>1<EFBFBD><1B><1B>}<7D>}<7D>H<EFBFBD><1A><16>x<EFBFBD>=<3D>1<EFBFBD>$<24><1D>I<EFBFBD><17>V<EFBFBD>V<EFBFBD>H<EFBFBD>Q<EFBFBD>K<EFBFBD>8<EFBFBD>B<EFBFBD><<3C>7<>8<>7<><18>7<>8<EFBFBD>A<EFBFBD>;<3B>7<>H<EFBFBD><18> <20> <20>z<EFBFBD>!<21>!<21>+<2B>+<2B>H<EFBFBD>5<>6<>6<><15>-<2D>-<2D> <10>)<29>U<EFBFBD>F<EFBFBD>K<EFBFBD>9<> 9r/c<00>p<00>|j<00>|ddgddgddgddgddggdd<03><04>|_|jS)zW
Return a `Path` instance of the unit rectangle from (0, 0) to (1, 1).
rrT<>r+r,)<01>_unit_rectangle<6C>r7s r-<00>unit_rectanglezPath.unit_rectangle
sP<00><00>
<0F> <1E> <1E> &<26>"%<25><01>1<EFBFBD>v<EFBFBD><01>1<EFBFBD>v<EFBFBD><01>1<EFBFBD>v<EFBFBD><01>1<EFBFBD>v<EFBFBD><01>1<EFBFBD>v<EFBFBD>&N<>-1<>D<EFBFBD>#B<01>C<EFBFBD> <1F><12>"<22>"<22>"r/c<00><><00>|dkr|jj|<01>}nd}|<02><>dtjz|z tj|dz<00>ztjdz z}tj
tj |<03>tj|<03>f<02>}||dd<05><06>}|dkr||j|<|S)z<>
Return a :class:`Path` instance for a unit regular polygon with the
given *numVertices* such that the circumscribing circle has radius 1.0,
centered at (0, 0).
<20>Nr rTr<54>)<08>_unit_regular_polygons<6E>getr<00>pi<70>arange<67> column_stack<63>cos<6F>sin)r7<00> numVerticesrr<00>thetar8s r-<00>unit_regular_polygonzPath.unit_regular_polygons<><00><00> <17>"<22> <1C><16>-<2D>-<2D>1<>1<>+<2B>><3E>D<EFBFBD><17>D<EFBFBD> <0F><<3C><17>"<22>%<25>%<25>i<EFBFBD>+<2B>-<2D><12><19><19>;<3B><11>?<3F>1K<31>K<><1A>u<EFBFBD>u<EFBFBD>q<EFBFBD>y<EFBFBD>!<21>E<EFBFBD><17>O<EFBFBD>O<EFBFBD>R<EFBFBD>V<EFBFBD>V<EFBFBD>E<EFBFBD>]<5D>B<EFBFBD>F<EFBFBD>F<EFBFBD>5<EFBFBD>M<EFBFBD>$B<>C<>E<EFBFBD><16>u<EFBFBD>T<EFBFBD>D<EFBFBD>9<>D<EFBFBD><1A>b<EFBFBD> <20>:><3E><03>*<2A>*<2A>;<3B>7<><13> r/c<00><><00>|dkr|jj||f<02>}nd}|<03><>|dz}dtjz|z tj|dz<00>z}|tjdz z }tj
|dz<00>}||ddd<03><|tj tj|<05>tj|<05>f<02>zj}||dd<06><07>}|dkr||j||f<|S)z<>
Return a :class:`Path` for a unit regular star with the given
numVertices and radius of 1.0, centered at (0, 0).
r<>Nr rg@Tr<54>)
<EFBFBD>_unit_regular_starsr<73>rr<>r<><00>ones<65>vstackr<6B>r<><00>T)r7r<><00> innerCirclerr<00>ns2r<32><00>rr8s r-<00>unit_regular_starzPath.unit_regular_star.s<><00><00> <17>"<22> <1C><16>*<2A>*<2A>.<2E>.<2E> <0B>[<5B>/I<>J<>D<EFBFBD><17>D<EFBFBD> <0F><<3C><1D><01>/<2F>C<EFBFBD><16>r<EFBFBD>u<EFBFBD>u<EFBFBD>W<EFBFBD>S<EFBFBD>[<5B>2<EFBFBD>9<EFBFBD>9<EFBFBD>S<EFBFBD>1<EFBFBD>W<EFBFBD>#5<>5<>E<EFBFBD> <12>R<EFBFBD>U<EFBFBD>U<EFBFBD>S<EFBFBD>[<5B> <20>E<EFBFBD><12><07><07><03>a<EFBFBD><07> <20>A<EFBFBD>!<21>A<EFBFBD>a<EFBFBD>d<EFBFBD><11>d<EFBFBD>G<EFBFBD><16><12><19><19>B<EFBFBD>F<EFBFBD>F<EFBFBD>5<EFBFBD>M<EFBFBD>2<EFBFBD>6<EFBFBD>6<EFBFBD>%<25>=<3D>#A<>B<>B<>E<>E<>E<EFBFBD><16>u<EFBFBD>T<EFBFBD>D<EFBFBD>9<>D<EFBFBD><1A>b<EFBFBD> <20>FJ<46><03>'<27>'<27><1B>k<EFBFBD>(B<>C<><13> r/c<00>&<00>|j|d<01>S)z<>
Return a :class:`Path` for a unit regular asterisk with the given
numVertices and radius of 1.0, centered at (0, 0).
<20>)r<>)r7r<>s r-<00>unit_regular_asteriskzPath.unit_regular_asteriskFs<00><00> <13>$<24>$<24>[<5B>#<23>6<>6r/c<00>d<00>|j<00>|jddd<03><04>|_|jS)z<>
Return the readonly :class:`Path` of the unit circle.
For most cases, :func:`Path.circle` will be what you want.
)rrrT)<03>centerr<72>r,)<02> _unit_circle<6C>circler<65>s r-<00> unit_circlezPath.unit_circlePs9<00><00> <0F> <1B> <1B> #<23>"<22>z<EFBFBD>z<EFBFBD><16><01>37<33> *<2A> 9<>C<EFBFBD> <1C><12><1F><1F>r/c<00><00>d}tjd<02>}||z}tjddg|dg||z
| |z
g|| g||z| |zgd| gddgd|g||z||z
g||g||z
||zg|dgddg| dg| |z||zg| |g| |z
||z
gd|gddgd| g| |z
| |zg| | g| |z| |z
g| dgddgddggt<00><06>}|jgdz}|j
|d<|j |d <t||z|z||<03>
<EFBFBD>S) u<>
Return a `Path` representing a circle of a given radius and center.
Parameters
----------
center : (float, float), default: (0, 0)
The center of the circle.
radius : float, default: 1
The radius of the circle.
readonly : bool
Whether the created path should have the "readonly" argument
set when creating the Path instance.
Notes
-----
The circle is approximated using 8 cubic Bézier curves, as described in
Lancaster, Don. `Approximating a Circle or an Ellipse Using Four
Bezier Cubic Splines <https://www.tinaja.com/glib/ellipse4.pdf>`_.
<20>rSl<16><>?<3F><00>?r<><00><00><>r{r<00>rr<00>r,)r<00>sqrtr<74><00>floatr<74>rr!r ) r7r<>r<>r,<00>MAGIC<49>SQRTHALF<4C>MAGIC45rr*s r-rz Path.circle\s<><00><00>,<1A><05><15>7<EFBFBD>7<EFBFBD>3<EFBFBD><<3C><08><1A>U<EFBFBD>"<22><07><15>8<EFBFBD>8<EFBFBD>c<EFBFBD>4<EFBFBD>[<5B>#<23>T<EFBFBD>]<5D>&<26>w<EFBFBD>.<2E><18> <09>'<27>0A<30>B<>&<26><18> <09>2<>&<26>w<EFBFBD>.<2E><18> <09>'<27>0A<30>B<>!<21>E<EFBFBD>6<EFBFBD>]<5D>!<21>3<EFBFBD>Z<EFBFBD>!<21>5<EFBFBD>\<5C>&<26>w<EFBFBD>.<2E><08><17>0@<40>A<>&<26><08>1<>&<26>w<EFBFBD>.<2E><08><17>0@<40>A<>#<23>S<EFBFBD>\<5C>!<21>3<EFBFBD>Z<EFBFBD>$<24>f<EFBFBD>c<EFBFBD>]<5D>'<27>i<EFBFBD><07>/<2F><18>'<27>1A<31>B<>'<27>i<EFBFBD><18>2<>'<27>i<EFBFBD><07>/<2F><18>'<27>1A<31>B<>"<22>E<EFBFBD>]<5D>"<22>C<EFBFBD>[<5B>"<22>U<EFBFBD>F<EFBFBD>^<5E>'<27>i<EFBFBD><07>/<2F>(<28><19>7<EFBFBD>1B<31>C<>'<27>i<EFBFBD>(<28><19>3<>'<27>i<EFBFBD><07>/<2F>(<28><19>7<EFBFBD>1B<31>C<>$<24>f<EFBFBD>d<EFBFBD>^<5E>!<21>4<EFBFBD>[<5B>!<21>4<EFBFBD>[<5B>E"*<2A>F#(<28>G#)<29><08>J<15><1A><1A> <0C>r<EFBFBD>!<21><05><16>:<3A>:<3A><05>a<EFBFBD><08><17>M<EFBFBD>M<EFBFBD><05>b<EFBFBD> <09><13>H<EFBFBD>v<EFBFBD>%<25><06>.<2E><05><08>I<>Ir/c<00><><00>|j<00><>d}tjd<02>}||z}tjddg|dg||z
| |z
g|| g||z| |zgd| gddgd|g||z||z
g||g||z
||zg|dgddgddggt<00>}tj
d|j |j<00><07>}|j|d<|j|d <|||d
<EFBFBD> <0B>|_|jS) z<>
Return a `Path` of the right half of a unit circle.
See `Path.circle` for the reference on the approximation used.
rrr<>rr{<00>rrrTr)
<EFBFBD>_unit_circle_righthalfrr r<>r
rdr<>rrr!)r7r r r rr*s r-<00>unit_circle_righthalfzPath.unit_circle_righthalf<6C>s/<00><00> <0F> %<25> %<25> -<2D><1D>E<EFBFBD><19>w<EFBFBD>w<EFBFBD>s<EFBFBD>|<7C>H<EFBFBD><1E><15>&<26>G<EFBFBD><19>x<EFBFBD>x<EFBFBD><15>t<EFBFBD><1B><17><14><1D><1A>7<EFBFBD>"<22>X<EFBFBD>I<EFBFBD>g<EFBFBD>$5<>6<><1A>X<EFBFBD>I<EFBFBD>&<26><1A>7<EFBFBD>"<22>X<EFBFBD>I<EFBFBD>g<EFBFBD>$5<>6<><15><05>v<EFBFBD><1D><15>s<EFBFBD><1A><15>u<EFBFBD><1C><1A>7<EFBFBD>"<22>H<EFBFBD>W<EFBFBD>$4<>5<><1A>H<EFBFBD>%<25><1A>7<EFBFBD>"<22>H<EFBFBD>W<EFBFBD>$4<>5<><17><13><1C><15>s<EFBFBD><1A><15>t<EFBFBD><1B>%<1E>(<16>+<17>H<EFBFBD>.<17>G<EFBFBD>G<EFBFBD>B<EFBFBD><03>
<EFBFBD>
<EFBFBD>#<23>-<2D>-<2D>@<40>E<EFBFBD><1A>z<EFBFBD>z<EFBFBD>E<EFBFBD>!<21>H<EFBFBD><1B> <0A> <0A>E<EFBFBD>"<22>I<EFBFBD>),<2C>X<EFBFBD>u<EFBFBD>t<EFBFBD>)L<>C<EFBFBD> &<26><12>)<29>)<29>)r/c<00><><00>tjdz}|}|dtj||z
dz <00>zz
}||k7r
||kr|dz }tj||g<02>\}}|<03>'t dtj
||z
|z <00>z<00>}|dkr t d<06><00>||z
|z }tjd|z<00>} tj|<08>tjdd| z| zz<00>dz
zdz }
tj|||dzd <09>} tj| <0B>} tj| <0B>} | dd
}| dd
}| }|}| dd}| dd}| }|}|r<>|d zd z}tj|dft<00>}tj||j|j <00> <0A>}|d|dg|d<|j"|j$g|dd|j$|j&g|ddd}|dz
}np|d zdz}tj(|dft<00>}tj||j|j <00> <0A>}|d|dg|d<|j"|d<d}|}||
|zz|||d <0B>df<||
|zz|||d <0B>df<||
|zz
||dz|d <0B>df<||
|zz
||dz|d <0B>df<|||dz|d <0B>df<|||dz|d <0B>df<|||d <09><10>S)a
Return a `Path` for the unit circle arc from angles *theta1* to
*theta2* (in degrees).
*theta2* is unwrapped to produce the shortest arc within 360 degrees.
That is, if *theta2* > *theta1* + 360, the arc will be from *theta1* to
*theta2* - 360 and not a full circle plus some extra overlap.
If *n* is provided, it is the number of spline segments to make.
If *n* is not provided, the number of spline segments is
determined based on the delta between *theta1* and *theta2*.
Masionobe, L. 2003. `Drawing an elliptical arc using
polylines, quadratic or cubic Bezier curves
<https://web.archive.org/web/20190318044212/http://www.spaceroots.org/documents/ellipse/index.html>`_.
rihNr rzn must be >= 1 or Noneg@g@Trrrrrr<>r)rr<><00>floor<6F>deg2rad<61>int<6E>ceilr<00>tanr<6E>r <00>linspacer<65>rcr
rdr<>rrr r!r)r7<00>theta1<61>theta2<61>n<>is_wedge<67>halfpi<70>eta1<61>eta2<61>deta<74>t<>alphar<61><00>cos_eta<74>sin_eta<74>xA<78>yA<79>xA_dot<6F>yA_dot<6F>xB<78>yB<79>xB_dot<6F>yB_dot<6F>lengthrr*<00> vertex_offset<65>ends r-<00>arczPath.arc<72>s(<00><00>$<14><15><15><13><1B><06><15><04><15><03>b<EFBFBD>h<EFBFBD>h<EFBFBD><06><16><0F>3<EFBFBD>'><3E>?<3F>?<3F>?<3F><04> <12>V<EFBFBD> <1B><04><04> <0C> <10>C<EFBFBD>K<EFBFBD>D<EFBFBD><17>Z<EFBFBD>Z<EFBFBD><14>t<EFBFBD> <0C>-<2D>
<EFBFBD><04>d<EFBFBD> <0A>9<EFBFBD><13>A<EFBFBD><12><17><17>$<24><14>+<2B><16>!7<>8<>8<>9<>A<EFBFBD> <0C>q<EFBFBD>5<EFBFBD><1C>5<>6<> 6<><14>t<EFBFBD> <0B>q<EFBFBD> <20><04> <0E>F<EFBFBD>F<EFBFBD>3<EFBFBD><14>:<3A> <1E><01><12><06><06>t<EFBFBD> <0C><02><07><07><03>c<EFBFBD>A<EFBFBD>g<EFBFBD><01>k<EFBFBD>(9<> :<3A>Q<EFBFBD> ><3E>?<3F>#<23>E<><05><12> <0B> <0B>D<EFBFBD>$<24><01>A<EFBFBD><05>t<EFBFBD>4<><05><14>&<26>&<26><15>-<2D><07><14>&<26>&<26><15>-<2D><07> <14>S<EFBFBD>b<EFBFBD>\<5C><02> <14>S<EFBFBD>b<EFBFBD>\<5C><02><14><13><06><13><06> <14>Q<EFBFBD>R<EFBFBD>[<5B><02> <14>Q<EFBFBD>R<EFBFBD>[<5B><02><14><13><06><13><06> <13><16><11>U<EFBFBD>Q<EFBFBD>Y<EFBFBD>F<EFBFBD><19>x<EFBFBD>x<EFBFBD><16><11> <0B>U<EFBFBD>3<>H<EFBFBD><16>G<EFBFBD>G<EFBFBD>F<EFBFBD>C<EFBFBD>J<EFBFBD>J<EFBFBD>c<EFBFBD>m<EFBFBD>m<EFBFBD>D<>E<EFBFBD><1D>a<EFBFBD>5<EFBFBD>"<22>Q<EFBFBD>%<25>.<2E>H<EFBFBD>Q<EFBFBD>K<EFBFBD><1D>*<2A>*<2A>c<EFBFBD>j<EFBFBD>j<EFBFBD>1<>E<EFBFBD>!<21>A<EFBFBD>J<EFBFBD><1D>*<2A>*<2A>c<EFBFBD>m<EFBFBD>m<EFBFBD>4<>E<EFBFBD>"<22>#<23>J<EFBFBD><1D>M<EFBFBD><18>1<EFBFBD>*<2A>C<EFBFBD><16><11>U<EFBFBD>Q<EFBFBD>Y<EFBFBD>F<EFBFBD><19>x<EFBFBD>x<EFBFBD><16><11> <0B>U<EFBFBD>3<>H<EFBFBD><16>G<EFBFBD>G<EFBFBD>F<EFBFBD>C<EFBFBD>J<EFBFBD>J<EFBFBD>c<EFBFBD>m<EFBFBD>m<EFBFBD>D<>E<EFBFBD><1D>a<EFBFBD>5<EFBFBD>"<22>Q<EFBFBD>%<25>.<2E>H<EFBFBD>Q<EFBFBD>K<EFBFBD><1A>z<EFBFBD>z<EFBFBD>E<EFBFBD>!<21>H<EFBFBD><1D>M<EFBFBD><18>C<EFBFBD>+-<2D><05><06><0E>+><3E><08><1D>s<EFBFBD>1<EFBFBD>$<24>a<EFBFBD>'<27>(<28>+-<2D><05><06><0E>+><3E><08><1D>s<EFBFBD>1<EFBFBD>$<24>a<EFBFBD>'<27>(<28>-/<2F>%<25>&<26>.<2E>-@<40><08><1D>q<EFBFBD><1F><13>Q<EFBFBD>&<26><01>)<29>*<2A>-/<2F>%<25>&<26>.<2E>-@<40><08><1D>q<EFBFBD><1F><13>Q<EFBFBD>&<26><01>)<29>*<2A>-/<2F><08><1D>q<EFBFBD><1F><13>Q<EFBFBD>&<26><01>)<29>*<2A>-/<2F><08><1D>q<EFBFBD><1F><13>Q<EFBFBD>&<26><01>)<29>*<2A><12>8<EFBFBD>U<EFBFBD>T<EFBFBD>2<>2r/c<00>*<00>|j|||d<01>S)ap
Return a `Path` for the unit circle wedge from angles *theta1* to
*theta2* (in degrees).
*theta2* is unwrapped to produce the shortest wedge within 360 degrees.
That is, if *theta2* > *theta1* + 360, the wedge will be from *theta1*
to *theta2* - 360 and not a full circle plus some extra overlap.
If *n* is provided, it is the number of spline segments to make.
If *n* is not provided, the number of spline segments is
determined based on the delta between *theta1* and *theta2*.
See `Path.arc` for the reference on the approximation used.
T)r0)r7rrrs r-<00>wedgez
Path.wedges<00><00> <13>w<EFBFBD>w<EFBFBD>v<EFBFBD>v<EFBFBD>q<EFBFBD>$<24>/<2F>/r/<00>c<00>(<00>ddlm}|<00> |||<01>SdS)z<>
Given a hatch specifier, *hatchpattern*, generates a `Path` that
can be used in a repeated hatching pattern. *density* is the
number of lines per unit square.
r)<01>get_pathN)<02>matplotlib.hatchr5)<03> hatchpattern<72>densityr5s r-<00>hatchz
Path.hatch-s&<00><00> .<2E><1F>+<2B><19><1C>w<EFBFBD>/<2F> 7<>15<31> 7r/c<00><><00>tj|||<02>}|D<00>cgc] }t|<04><00><02>}}|j|<05>Scc}w)a.
Clip the path to the given bounding box.
The path must be made up of one or more closed polygons. This
algorithm will not behave correctly for unclosed paths.
If *inside* is `True`, clip to the inside of the box, otherwise
to the outside of the box.
)r<00>clip_path_to_rectr ru)r)r<><00>insider8<00>poly<6C>pathss r-<00> clip_to_bboxzPath.clip_to_bbox9sG<00><00><16>'<27>'<27><04>d<EFBFBD>F<EFBFBD>;<3B><05>(-<2D>.<2E><04><14>d<EFBFBD><1A>.<2E><05>.<2E>&<26>t<EFBFBD>&<26>&<26><05>.<2E>.<2E><>/s<00>?)NrFFrM)NTNFr{NTN)NFN)Nr<4E>)T)NrrT)r))r<>r<>r{F)NF)<01>)A<>__name__<5F>
__module__<EFBFBD> __qualname__<5F>__doc__r<00>uint8rrprr r<>r<>r!r<>r.<00> classmethodr;r?r%<00>propertyr<00>setterr*rKrQr,rUr`r\rmrurxrzr<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>rr<>r<>r<>r<>r<>rrrrrr0r2<00> staticmethodrr9r?r<>r/r-r r s'<00><00>5<08>n<13><08><08>I<EFBFBD> <15>Q<EFBFBD><<3C>D<EFBFBD> <16>q<EFBFBD>\<5C>F<EFBFBD> <16>q<EFBFBD>\<5C>F<EFBFBD> <16>q<EFBFBD>\<5C>F<EFBFBD> <16>q<EFBFBD>\<5C>F<EFBFBD><19>"<22> <0A>I<EFBFBD>"<22>1<EFBFBD>#<23>Q<EFBFBD>#<23>Q<EFBFBD>#<23>Q<EFBFBD>#<23>Q<EFBFBD>&<26><01> +<2B><19>CD<01>(-<2D>=#<23>~<11><13><11><13>8<11><<3C><11><<3C>
<EFBFBD><0E><1E><0E><1E><0E>_<EFBFBD>_<EFBFBD><1E><15><1E> <0E> <1B><0E> <1B> <0B>\<5C>\<5C><1E><12><1E> <0E>(<28><0E>(<28><18><1E><1E>-<2D><1F>-<2D><0E>%<25><0E>%<25> <15><1B><1B>0<><1C>0<><0E><1E><0E><1E> <1F> <11>)<29>"<11>!<21><11>!<21>6<11>B<01><11>B<01>*:<3A>"<22>DH<01>=A<>*.<2E>@&<26>D-#<23>^=<3D><13>!<21>%<25> <20>u<EFBFBD>T<EFBFBD><13>& /<2F>0P<01>d*%<25>X ?<3F>'<1F>R?<3F>
><3E>&)<29>P-9<>^<1B>O<EFBFBD><10>#<23><11>#<23>1<>2<><1A><10><14><11><14>*.<2E>/<2F><17><10><14><11><14>.<11>7<><11>7<><18>L<EFBFBD><10>  <20><11>  <20><11>AJ<01><11>AJ<01>F"<22><1A><10>'*<2A><11>'*<2A>R<11>L3<><11>L3<>\<11>0<><11>0<>"<12><0E>q<EFBFBD>\<5C>7<><12><12>7<> /r/r c<00><><00>ddlm}t|<01>dk(r td<04><00>t|<03>dk(r td<05><00>t j
||t j|<02>||<04>\}}|j|d|i<01>S)u 
Get bounding box of a `.PathCollection`\s internal objects.
That is, given a sequence of `Path`\s, `.Transform`\s objects, and offsets, as found
in a `.PathCollection`, return the bounding box that encapsulates all of them.
Parameters
----------
master_transform : `~matplotlib.transforms.Transform`
Global transformation applied to all paths.
paths : list of `Path`
transforms : list of `~matplotlib.transforms.Affine2DBase`
If non-empty, this overrides *master_transform*.
offsets : (N, 2) array-like
offset_transform : `~matplotlib.transforms.Affine2DBase`
Transform applied to the offsets before offsetting the path.
Notes
-----
The way that *paths*, *transforms* and *offsets* are combined follows the same
method as for collections: each is iterated over independently, so if you have 3
paths (A, B, C), 2 transforms (α, β) and 1 offset (O), their combinations are as
follows:
- (A, α, O)
- (B, β, O)
- (C, α, O)
rr<>rzNo paths providedzNo offsets provided<65>minpos) r<>r<>rrr<00>get_path_collection_extentsr<00>
atleast_3d<EFBFBD> from_extents)<08>master_transformr>r<><00>offsets<74>offset_transformr<6D><00>extentsrKs r-rLrLHsz<00><00><!<21>
<EFBFBD>5<EFBFBD>z<EFBFBD>Q<EFBFBD><EFBFBD><18>,<2C>-<2D>-<2D>
<EFBFBD>7<EFBFBD>|<7C>q<EFBFBD><18><18>.<2E>/<2F>/<2F><1B>7<>7<><18>%<25><12><1D><1D>z<EFBFBD>!:<3A><0F>!<21>#<23>O<EFBFBD>G<EFBFBD>V<EFBFBD> <1D>4<EFBFBD> <1C> <1C>g<EFBFBD> 5<>f<EFBFBD> 5<>5r/)rDrU<00> functoolsr<00>weakrefr<00>numpyr<00>
matplotlibr5<00>rr<00>cbookrr <00>bezierr
r rLr<>r/r-<00><module>rZs6<00><01> <04> <0C><1F>'<27><12><18><19>H<>!<21>m/<2F>m/<2F>`!&6r/
Reference in a new issue Copy permalink