old-parkingkoncept/parkingkonceptvenv/lib/python3.7/site-packages/matplotlib/__pycache__/path.cpython-37.pyc

B
U<>]ʍ<00>@s~dZd
dl
mZ
d
dlmZ
d
dlZddlmZm	Z	m
Z

ddl	mZmZ
Gdd	<09>d	e
<0A>Zd
d<0B>Ze	jdd
d<0E>gf
dd<10>
<01>
ZdS)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>)
<01>	lru_cache)
<01>WeakValueDictionaryN<79>
)<03>_path<74>cbook<6F>rcParams)<02>_to_unmasked_float_array<61>simple_linear_interpolationc@sheZ
dZd
ZejZed<02>
Zed<03>
Zed<04>
Z	ed<05>
Z
ed<06>
Zed<07>
Zedede	de
dedediZ
dbd
d<0B>
Zedcdd
<0A>
<01>
Zdd<0F>Zedd<11><00>
Zejdd<11><00>
Zedd<14><00>
Zejdd<14><00>
Zedd<17><00>
Zejdd<17><00>
Zejddd<1B>edd<1D><00>
<01>
Zedd<1F><00>
Zejd d<1F><00>
Zed!d"<22><00>
Zd#d$<24>ZeZddd%d&<26>
ZeZed'd(<28><00>
Z ed)d*<2A><00>
Z!d+d,<2C>Z"d-d.<2E>Z#ded1d2<64>
Z$dfd3d4<64>
Z%d5d6<64>Z&dgd8d9<64>
Z'dhd:d;<3B>
Z(did<d=<3D>
Z)djd>d?<3F>
Z*dkd@dA<64>
Z+dldBdC<64>
Z,dDdE<64>Z-dmdFdG<64>
Z.dZ/edHdI<64><00>
Z0e1<65>Z2edJdK<64><00>
Z3e1<65>Z4edndMdN<64>
<01>
Z5edOdP<64><00>
Z6dZ7edQdR<64><00>
Z8edodTdU<64>
<01>
Z9dZ:edVdW<64><00>
Z;edpdXdY<64>
<01>
Z<edqdZd[<5B>
<01>
Z=e>e?d\<5C>
drd^d_<64>
<01>
<01>
Z@dsd`da<64>
ZAdS)t<>Patha
    :class:`Path` represents a series of possibly disconnected,
    possibly closed, line and curve segments.

    The underlying storage is made up of two parallel numpy arrays:
      - *vertices*: an Nx2 float array of vertices
      - *codes*: an N-length uint8 array of vertex types

    These two arrays always have the same length in the first
    dimension.  For example, to represent a cubic curve, you must
    provide three vertices as well as three codes ``CURVE3``.

    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 Bezier curve from the current position,
          with the given control point, to the given end point.

       - ``CURVE4`` :  2 control points, 1 endpoint
          Draw a cubic Bezier 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.

    Users of Path objects should not access the vertices and codes
    arrays directly.  Instead, they should use :meth:`iter_segments`
    or :meth:`cleaned` to get the vertex/code pairs.  This is important,
    since many :class:`Path` objects, as an optimization, do not store a
    *codes* at all, but have a default one provided for them by
    :meth:`iter_segments`.

    Some behavior of Path objects can be controlled by rcParams. See
    the rcParams whose keys contain '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.

    r
r<00><00><00><00>ONFcCs
t|
<01>
}
|
j
d
ks |
jdd
kr(td<03>
<01>
|dk	r<>t<04>||j<06>}|j
dksXt|<02>
t|
<01>
kr`td<05>
<01>
t|<02>
r<>|d|jkr<>td<07>	|j<08>
<01>
<01>
nB|r<>t|
<01>
r<>tj
t|
<01>
|jd<08>}|j|d<|j|dd	<09><|j|d	<|
|_
||_||_|<00><10>
|<05>
rd
|j
j_|jdk	<09>
r
d
|jj_d|_nd
|_dS)am
        Create a new path with the given vertices and codes.

        Parameters
        ----------
        vertices : array_like
            The ``(n, 2)`` float array, masked array or sequence of pairs
            representing the vertices of the path.

            If *vertices* contains masked values, they 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 : {None, array_like}, optional
            n-length array 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.
        readonly : bool, optional
            Makes the path behave in an immutable way and sets the vertices
            and codes as read-only arrays.
        rrz4'vertices' must be a 2D list or array with shape Nx2NzE'codes' must be a 1D list or array with the same length of 'vertices'r
z:The first element of 'code' must be equal to 'MOVETO' ({}))
<01>dtype<70><65><EFBFBD><EFBFBD><EFBFBD>FT)r<00>ndim<69>shape<70>
ValueError<EFBFBD>npZasarray<61>	code_type<70>len<65>MOVETO<54>format<61>empty<74>LINETO<54>	CLOSEPOLY<4C>	_vertices<65>_codes<65>_interpolation_steps<70>_update_values<65>flagsZ	writeable<6C>	_readonly)<06>self<6C>vertices<65>codesr<00>closed<65>readonly<6C>r'<00>7/tmp/pip-install-i8dhxrtk/matplotlib/matplotlib/path.py<70>__init__`s4























z
Path.__init__cCs\|<00>|<00>
}t
|
<01>
|_||_d
|_|dk	rB|j|_|j|_|j|_nd|_td|_d|_|S)a<>

        Creates a Path instance without the expense of calling the constructor.

        Parameters
        ----------
        verts : numpy array
        codes : numpy 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.
        FNTzpath.simplify_thresholdr)	<09>__new__rrrr!<00>_should_simplify<66>_simplify_thresholdrr)<05>cls<6C>vertsr$Zinternals_from<6F>pthr'r'r(<00>_fast_from_codes_and_verts<74>s













zPath._fast_from_codes_and_vertsc

CsLtd
|_
|j
dkoDtdoDt|j<03>
dkoD|jdkpDt<05>|jtjk
<01>
|_	dS)Nzpath.simplify_thresholdr
z
path.simplify<66><79>)
rr,rrrr<00>allr
rr+)
r"r'r'r(r<00>s






zPath._update_valuesc


Cs|jS)
zK
        The list of vertices in the `Path` as an Nx2 numpy array.
        )
r)
r"r'r'r(r#<00>sz
Path.verticescCs |jrt
d
<01>
<01>
|
|_|<00><03>
dS)Nz%Can't set vertices on a readonly Path)r!<00>AttributeErrorrr)r"r#r'r'r(r#<00>s


c


Cs|jS)
au

        The list of codes in the `Path` as a 1-D numpy 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 `self.vertices` and `self.codes` is always
        the same.
        )
r)
r"r'r'r(r$<00>s
z
Path.codescCs |jrt
d
<01>
<01>
|
|_|<00><03>
dS)Nz"Can't set codes on a readonly Path)r!r3rr)r"r$r'r'r(r$<00>s


c


Cs|jS)
zi
        The fraction of a pixel difference below which vertices will
        be simplified out.
        )
r,)
r"r'r'r(<00>simplify_threshold<6C>szPath.simplify_thresholdcCs
|
|_dS)
N)
r,)r"<00>	thresholdr'r'r(r4<00>sz3.1z$not np.isfinite(self.vertices).all())
<01>alternativec

Cst<00>
|j<02>
<01><03>S)
zD
        `True` if the vertices array has nonfinite values.
        )r<00>isfiniterr2)
r"r'r'r(<00>
has_nonfinite<74>szPath.has_nonfinitec


Cs|jS)
zD
        `True` if the vertices array should be simplified.
        )
r+)
r"r'r'r(<00>should_simplify<66>szPath.should_simplifycCs
|
|_dS)
N)
r+)r"r9r'r'r(r9
sc


Cs|jS)
z4
        `True` if the `Path` is read-only.
        )
r!)
r"r'r'r(r&
sz
Path.readonlyc
Csd
dl}
|
<01>|<00>
S)z
        Returns a shallow copy of the `Path`, which will share the
        vertices and codes with the source `Path`.
        r
N)
<01>copy)r"r:r'r'r(<00>__copy__

s
z
Path.__copy__cCs@y|j<00>
<01>}Wntk
r&


d
}YnX|j|j<04>
<01>||jd<02>S)z{
        Returns a deepcopy of the `Path`.  The `Path` will not be
        readonly, even if the source `Path` is.
        N)
r)r$r:r3<00>	__class__r#r)r"<00>memor$r'r'r(<00>__deepcopy__
s







zPath.__deepcopy__c
Cs<>|
j\}}}|d
krt
d<02>
<01>
|d}||}t<02>|d
f<02>
}tj||j|jd<04>}|j|dd|<05><|j||d|<05><x*t	|<03>
D]}	|
dd<06>|	f||	d|<05><qxW|||<08>S)a

        Make a compound path object to draw a number
        of polygons with equal numbers of sides XY is a (numpolys x
        numsides x 2) numpy array of vertices.  Return object is a
        :class:`Path`

        .. plot:: gallery/misc/histogram_path.py

        rz%The third dimension of 'XY' must be 2r)
rr
N)
rrr<00>zeros<6F>fullrrrr<00>range)
r-ZXYZnumpolysZnumsidesZtwoZstrideZnvertsr.r$<00>
ir'r'r(<00>make_compound_path_from_polys&
s









z"Path.make_compound_path_from_polysc
Gs<>|
stt
jd
dgt
jd<03><02>
Sdd<05>|
D<00>
}t|<02>
}t
<01>dd<05>|
D<00>
<01>
}|<04>|df<02>

t
j||jd<03>}d
}xd|
D]\}|jdkr<>|j	||<|j
||d|t|j<0C>
<00><n|j|||t|j<08>
<00><|t|j<0C>
7}qnW|||<05>S)	z1Make a compound path from a list of Path objects.r
r)
rc
Ssg|]}
t|
<01>
<01>qSr')
r)<02>.0<EFBFBD>
xr'r'r(<00>
<listcomp>J
sz+Path.make_compound_path.<locals>.<listcomp>c
Ssg|]
}
|
j<00>qSr')
r#)rDrEr'r'r(rFM
sNr)
r
rrZfloat32<33>sum<75>vstackZreshaperr$rrrr#)r-<00>args<67>lengths<68>total_lengthr#r$rB<00>pathr'r'r(<00>make_compound_pathC
s











zPath.make_compound_pathc

Csd
|j|j
fS)NzPath(%r, %r))r#r$)
r"r'r'r(<00>__repr__\
s
z
Path.__repr__c

Cs
t|j
<01>
S)
N)rr#)
r"r'r'r(<00>__len___
s
zPath.__len__T<5F><00>?c	
cs<>t|<00>
sd
S|j
|
|||||||d<02>}	|j}
|j}t|	j<05>
}t|	j<06>
}
xdt||
<0A>D]V\}}||krdP|
|d}|r<>x(t|<10>
D]}t	|
<0A>

t
<EFBFBD>|t	|<0C>
<01>}q~W||fV
qRWd
S)ae
        Iterates over all of the curve segments in the path.  Each iteration
        returns a 2-tuple ``(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, perform snapping 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_CODE<44>STOP<4F>iterr#r$<00>ziprA<00>nextr<00>append)r"rQrRrSrTrUrVrWrXrYrZr[r#r$Z
curr_vertices<65>codeZextra_verticesrBr'r'r(<00>
iter_segmentsb
s((

















zPath.iter_segmentsc

Cs:t<00>
||
|||||||	<09>	\}
}t<02>|
||<00>}|s6d
|_|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)rZcleanup_pathr
r0r+)
r"rQrRrS<00>quantizerVrWrUrTrXr#r$r/r'r'r(rY<00>
s





zPath.cleanedcCst|
<01>
|j<02>
|j|j<04>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
rQr#r$r)r"rQr'r'r(<00>transformed<65>
s

zPath.transformed<65>cCsB|d
k	r|<02><00>}|r(|j
s(|<02>|<00>
}d
}t<03>|
d|
d|||<02>S)a

        Returns whether the (closed) path contains the given point.

        If *transform* is not ``None``, the path will be transformed before
        performing the test.

        *radius* allows the path to be made slightly larger or smaller.
        Nr
r)<05>frozen<65>	is_affineZtransform_pathrZ
point_in_path)r"ZpointrQ<00>radiusr'r'r(<00>contains_point<6E>
s	





zPath.contains_pointcCs*|d
k	r|<02><00>}t
<01>|
|||<02>}|<04>d<02>
S)a*

        Returns a bool array which is ``True`` if the (closed) path contains
        the corresponding point.

        If *transform* is not ``None``, the path will be transformed before
        performing the test.

        *radius* allows the path to be made slightly larger or smaller.
        N<>bool)rerZpoints_in_pathZastype)r"ZpointsrQrg<00>resultr'r'r(<00>contains_points<74>
s



zPath.contains_pointscCs |d
k	r|<02><00>}t
<01>|d
|
|<02>S)z<>
        Returns whether this (closed) path completely contains the given path.

        If *transform* is not ``None``, the path will be transformed before
        performing the test.
        N)rerZpath_in_path)r"rLrQr'r'r(<00>
contains_path<74>
s

zPath.contains_pathcCsDd
dlm
}
|}|
dk	r4|
<01><02>}
|
js4|<00>|
<01>
}d}
|t<05>||
<01><02>
S)a

        Returns the extents (*xmin*, *ymin*, *xmax*, *ymax*) of the
        path.

        Unlike computing the extents on the *vertices* alone, this
        algorithm will take into account the curves and deal with
        control points appropriately.
        r)
<01>BboxN)<07>
transformsrmrerfrcrZget_path_extents)r"rQrmrLr'r'r(<00>get_extents<74>
s	







zPath.get_extentscCst<00>
||
|<02>S)
a


        Returns *True* if this path intersects another given path.

        *filled*, when True, treats the paths as if they were filled.
        That is, if one path completely encloses the other,
        :meth:`intersects_path` will return True.
        )rZpath_intersects_path)r"<00>other<65>filledr'r'r(<00>intersects_pathszPath.intersects_pathcCst<00>
||
j|
j|
j|
j|<02>S)
a]

        Returns *True* if this path intersects a given
        :class:`~matplotlib.transforms.Bbox`.

        *filled*, when True, treats the path as if it was filled.
        That is, if the path completely encloses the bounding box,
        :meth:`intersects_bbox` will return True.

        The bounding box is always considered filled.
        )rZpath_intersects_rectangleZx0Zy0<79>x1<78>y1)r"<00>bboxrqr'r'r(<00>intersects_bbox
s
zPath.intersects_bboxcCsh|
d
kr|St|j
|
<01>}|j}|dk	rZtjt|<03>
d
|
d
tj|jd<03>}||dd|
<01><nd}t||<04>S)z|
        Returns a new path resampled to length N x steps.  Does not
        currently handle interpolating curves.
        rN)
rr
)	r	r#r$rr@rr
rr)r"<00>stepsr#r$Z	new_codesr'r'r(<00>interpolateds







zPath.interpolatedcCs<>t|j
<01>
d
krgS|
dk	r"|
<01><02>}
|jdkr<>|d
ks<|d
kr<>|j
}|rzt|<05>
dkrVgSt<04>|d
|dk<03>
rz||d
f
<01>}|
dkr<>|g
S|
<01>|<05>
g
St<07>||
|||<04>S)a<>
        Convert this path to a list of polygons or polylines.  Each
        polygon/polyline is an Nx2 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 Bezier 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.

        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.
        r
Nrr)	rr#rer$r<00>anyrQrZconvert_path_to_polygons)r"rQ<00>width<74>heightZclosed_onlyr#r'r'r(<00>to_polygons-s 









zPath.to_polygonsc

CsR|jd
krL|ddgddgddgddgddgg|j
|j|j|j|jgdd<05>|_|jS)zW
        Return a `Path` instance of the unit rectangle from (0, 0) to (1, 1).
        Ngg<00>?T)
r&)<04>_unit_rectanglerrr)
r-r'r'r(<00>unit_rectangle[s






zPath.unit_rectanglecCs<>|
d
k
r|j<00>
|
<01>
}nd}|dkr<>dtj|
t<02>|
d<00>
tjd}t<02>t<02>|<03>
t<02>|<03>
f<02>
}t<02>|
d<00>
}|j	|d<|j
|dd<06><|j|d<|||dd<08>}|
d
k
r<>||j|
<|S)	z<>
        Return a :class:`Path` instance for a unit regular polygon with the
        given *numVertices* and radius of 1.0, centered at (0, 0).
        <20>Nrrr
rT)
r&)<0C>_unit_regular_polygons<6E>getr<00>pi<70>arangeZcolumn_stack<63>cos<6F>sinrrrr)r-<00>numVerticesrL<00>thetar.r$r'r'r(<00>unit_regular_polygonks














zPath.unit_regular_polygon<6F><00>?c	Cs<>|
d
k
r|j<00>
|
|f<02>
}nd}|dkr<>|
d}dtj|t<02>|d<00>
}|tjd7}t<02>|d<00>
}||ddd<03><t<02>|t<02>|<05>
|t<02>|<05>
f<02>
<01>	<09>}t<02>
|df
<01>
}|j|d<|j|dd<07><|j
|d<|||dd	<09>}|
d
k
r<>||j|
|f<|S)
z<EFBFBD>
        Return a :class:`Path` for a unit regular star with the given
        numVertices and radius of 1.0, centered at (0, 0).
        rNrrg@r
rT)
r&)<0E>_unit_regular_starsr<73>rr<>r<>ZonesrHr<>r<>Z	transposerrrr)	r-r<>ZinnerCirclerLZns2r<32><00>
rr.r$r'r'r(<00>unit_regular_star<61>s$






&









zPath.unit_regular_starcCs|<00>|
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).
        g)
r<>)r-r<>r'r'r(<00>unit_regular_asterisk<73>szPath.unit_regular_asteriskc

Cs"|jd
kr|j
dddd<05>|_|jS)z<>
        Return the readonly :class:`Path` of the unit circle.

        For most cases, :func:`Path.circle` will be what you want.
        N)r
r
rT)<03>centerrgr&)<02>_unit_circle<6C>circle)
r-r'r'r(<00>unit_circle<6C>s




zPath.unit_circle<6C>ggc	CsV
d
}t<00>
d<02>
}||}tjddg|dg||||g||g||||gd|gddgd|g||||g||g||||g|dgddg|dg||||g||g||||gd|gddgd|g||||g||g||||g|dgddgddggtd<06>}|jg
d}|j|d<|j|d	<t|||
||d
<EFBFBD>S)a<>
        Return a `Path` representing a circle of a given radius and center.

        Parameters
        ----------
        center : pair of floats
            The center of the circle. Default ``(0, 0)``.
        radius : float
            The radius of the circle. Default is 1.
        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 Bezier curves, as described in

          Lancaster, Don.  `Approximating a Circle or an Ellipse Using Four
          Bezier Cubic Splines <http://www.tinaja.com/glib/ellipse4.pdf>`_.
        grSl<16><>?g<00>?gg<00><>g<00>?)
r<00>r
r)
r&)r<00>sqrt<72>array<61>float<61>CURVE4rrr
)	r-r<>rgr&<00>MAGIC<49>SQRTHALF<4C>MAGIC45r#r$r'r'r(r<><00>sD


























zPath.circlec
Cs<>|jd
kr<>d}
t
<01>d<03>
}||
}t
<01>ddg|
dg||||g||g||||gd|
gddgd|
g||||g||g||||g|
dgddgddggt<04>}t
jd|j|jd<08>}|j|d	<|j	|d
<|||dd<0C>|_|jS)
z<>
        Return a `Path` of the right half of a unit circle.

        See `Path.circle` for the reference on the approximation used.
        NgrSl<16><>?g<00>?gg<00><>g<00>?<3F>)
rr
rT)
r&)
<EFBFBD>_unit_circle_righthalfrr<>r<>r<>r@r<>rrr)r-r<>r<>r<>r#r$r'r'r(<00>unit_circle_righthalf<6C>s2


















zPath.unit_circle_righthalfcCs<>tj
d
}|
}|dt<00>||
d<00>
}||
kr@||k
r@|d7}t<00>||g<02>
\}}|dkrttdt<00>|||<00>
<00>
}|dkr<>td<06>
<01>
|||}t<00>d
|<00>
}	t<00>|<08>
t<00>	dd|	|	<00>
dd}
t<00>
|||dd	<09>}t<00>|<0B>
}t<00>|<0B>
}
|dd
<EFBFBD>}|
dd
<EFBFBD>}|}|}|dd<03>}|
dd<03>}|}|}|<04>
r<>|dd}t<00>|dft
<0A>}tj||j|jd
<0A>}|d|dg|d<|j|jg|dd<04><|j|jg|dd<03><d}|d}nV|dd}t<00>|dft
<0A>}tj||j|jd
<0A>}|d|dg|d<|j|d<d}|}||
||||d<0B>df<||
||||d<0B>df<||
|||d|d<0B>df<||
|||d|d<0B>df<|||d|d<0B>df<|||d|d<0B>df<|||d	d<10>S)a<>
        Return 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
           <http://www.spaceroots.org/documents/ellipse/index.html>`_.
        g<00>?ih
Nrrzn must be >= 1 or Noneg@g@Trrr
)
rr
<00><><EFBFBD><EFBFBD><EFBFBD>)
r&)rr<><00>floorZdeg2rad<61>int<6E>ceilr<00>tanr<6E>r<>Zlinspacer<65>r?r<>r@r<>rrrrr)r-<00>theta1<61>theta2<61>
nZis_wedgeZhalfpiZeta1Zeta2Zdeta<74>
t<>alpharwZcos_etaZsin_etaZxAZyAZxA_dotZyA_dotZxBZyBZxB_dotZyB_dot<6F>lengthr#r$Z
vertex_offset<65>endr'r'r(<00>arc(s^








(






























zPath.arccCs|<00>|
||d
<01>S)ac
        Return 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)
r<>)r-r<>r<>r<>r'r'r(<00>wedgewsz
Path.wedge<67><00>cCs"d
dlm
}
|dk	r|||
<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)Zmatplotlib.hatchr<68>)ZhatchpatternZdensityr<79>r'r'r(<00>hatch<63>sz
Path.hatchcCs&t<00>
||
|<02>}d
d<02>|D<00>
}|j|<04>S)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.
        c
Ssg|]}
t|
<01>
<01>qSr')
r
)rDZpolyr'r'r(rF<00>sz%Path.clip_to_bbox.<locals>.<listcomp>)rZclip_path_to_rectrM)r"ruZinsider.<00>pathsr'r'r(<00>clip_to_bbox<6F>s

zPath.clip_to_bbox)NrFF)
N)
N)NTNFrPNTN)	NFNFFFrPFN)Nrd)Nrd)
N)
N)
T)
T)Nr
r
T)
r<>)r<>rPF)NF)
N)
r<>)
T)B<>__name__<5F>
__module__<EFBFBD>__qualname__<5F>__doc__rZuint8rr[rrZCURVE3r<33>rrZr)<00>classmethodr0r<00>propertyr#<00>setterr$r4r<00>
deprecatedr8r9r&r;r:r><00>deepcopyrCrMrNrOrarYrcrhrkrlrorrrvrxr|r}r~rr<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<>r<><00>staticmethodrr<>r<>r'r'r'r(r
s<>6











>
	






?










,

C*
N



r
cCs>d
dlm
}
t|
<01>
dkr td<04>
<01>
|jt<05>||
t<07>|<02>
||<04><05>S)a$
    Given a sequence of `Path`\s, `~.Transform`\s objects, and offsets, as
    found in a `~.PathCollection`, returns the bounding box that encapsulates
    all of them.

    Parameters
    ----------
    master_transform : `~.Transform`
        Global transformation applied to all paths.
    paths : list of `Path`
    transform : list of `~.Affine2D`
    offsets : (N, 2) array-like
    offset_transform : `~.Affine2D`
        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, 2 transforms and 1 offset,
    their combinations are as follows:

        (A, A, A), (B, B, A), (C, A, A)
    r)
rmr
zNo paths provided)	rnrmrr<00>from_extentsr<00>get_path_collection_extentsrZ
atleast_3d)Zmaster_transformr<6D>rn<00>offsetsZoffset_transformrmr'r'r(r<><00>s




r<>z3.1Zget_paths_collection_extents)
r6cCs@d
dlm
}m}
t|<00>
dkr$td<04>
<01>
|jt<06>|<03>||
g|<03><00><05>S)ai

    Given a sequence of :class:`Path` objects and optional
    :class:`~matplotlib.transforms.Transform` objects, returns the
    bounding box that encapsulates all of them.

    *paths* is a sequence of :class:`Path` instances.

    *transforms* is an optional sequence of
    :class:`~matplotlib.transforms.Affine2D` instances to apply to
    each path.
    r)rm<00>Affine2Dr
zNo paths provided)rnrmr<>rrr<>rr<>)r<>rnrmr<>r'r'r(<00>get_paths_extents<74>s





r<>)r<><00>	functoolsr<00>weakrefrZnumpyr<00>rrrrr	<00>objectr
r<>r<>r<>r'r'r'r(<00><module>
s 

"