OwlCyberSecurity - MANAGER
Edit File: path.cpython-38.pyc
U ��]ʍ � @ s~ d Z ddlmZ ddlmZ ddlZddlmZm Z m Z ddl m Z m Z G dd � d e �Zd d � Ze jd d d�g fdd��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. � )� lru_cache)�WeakValueDictionaryN� )�_path�cbook�rcParams)�_to_unmasked_float_array�simple_linear_interpolationc @ sh e Zd ZdZejZed�Zed�Zed�Z ed�Z ed�Z ed�Z edede de de de diZ dbd d �Zedcd d ��Zdd� Zedd� �Zejdd� �Zedd� �Zejdd� �Zedd� �Zejdd� �Zejddd�ed d � ��Zed d � �Zejd d � �Zed!d"� �Zd#d$� Z e Z ddd%d&�Z e Z ed'd(� �Z ed)d*� �Z!d+d,� Z"d-d.� Z#ded1d2�Z$dfd3d4�Z%d5d6� Z&dgd8d9�Z'dhd:d;�Z(did<d=�Z)djd>d?�Z*dkd@dA�Z+dldBdC�Z,dDdE� Z-dmdFdG�Z.dZ/edHdI� �Z0e1� Z2edJdK� �Z3e1� Z4edndMdN��Z5edOdP� �Z6dZ7edQdR� �Z8edodTdU��Z9dZ:edVdW� �Z;edpdXdY��Z<edqdZd[��Z=e>e?d\�drd^d_���Z@dsd`da�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 � � � �O NFc C s t |�}|jdks |jd dkr(td��|dk r�t�|| j�}|jdksXt|�t|�kr`td��t|�r�|d | jkr�td� | j���nB|r�t|�r�tj t|�| jd�}| j|d< | j |dd �< | j |d < || _ || _|| _| �� |�rd | j j_| jdk �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. r r z4'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' ({})�Zdtype���FT)r �ndim�shape� ValueError�npZasarray� code_type�len�MOVETO�format�empty�LINETO� CLOSEPOLY� _vertices�_codes�_interpolation_steps�_update_values�flagsZ writeable� _readonly)�self�vertices�codesr �closed�readonly� r' �1/usr/lib/python3/dist-packages/matplotlib/path.py�__init__` s8 �� z Path.__init__c C s\ | � | �}t|�|_||_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. FNT�path.simplify_thresholdr ) �__new__r r r r! �_should_simplify�_simplify_thresholdr r )�cls�vertsr$ Zinternals_from�pthr' r' r( �_fast_from_codes_and_verts� s z Path._fast_from_codes_and_vertsc C sL t d | _| jdkoDt d oDt| j�dkoD| jd kpDt�| jtjk�| _ d S )Nr* r z path.simplify� ) r r- r r r r �allr r r, �r" r' r' r( r � s � ��zPath._update_valuesc C s | j S )zK The list of vertices in the `Path` as an Nx2 numpy array. )r r4 r' r' r( r# � s z Path.verticesc C s | j rtd��|| _| �� d S )Nz%Can't set vertices on a readonly Path)r! �AttributeErrorr r )r" r# r' r' r( r# � s c C s | j S )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 r4 r' r' r( r$ � s z Path.codesc C s | j rtd��|| _| �� d S )Nz"Can't set codes on a readonly Path)r! r5 r r )r" r$ r' r' r( r$ � s c C s | j S )zi The fraction of a pixel difference below which vertices will be simplified out. �r- r4 r' r' r( �simplify_threshold� s zPath.simplify_thresholdc C s || _ d S �Nr6 )r" Z thresholdr' r' r( r7 � s �3.1z$not np.isfinite(self.vertices).all()�Z alternativec C s t �| j��� S )zD `True` if the vertices array has nonfinite values. )r Zisfiniter r3 r4 r' r' r( � has_nonfinite� s zPath.has_nonfinitec C s | j S )zD `True` if the vertices array should be simplified. �r, r4 r' r' r( �should_simplify� s zPath.should_simplifyc C s || _ d S r8 r< )r" r= r' r' r( r= s c C s | j S )z4 `True` if the `Path` is read-only. )r! r4 r' r' r( r& s z Path.readonlyc C s ddl }|� | �S )z Returns a shallow copy of the `Path`, which will share the vertices and codes with the source `Path`. r N)�copy)r" r> r' r' r( �__copy__ s z Path.__copy__c C s@ z| j �� }W n tk r& d}Y nX | j| j�� || jd�S )z{ Returns a deepcopy of the `Path`. The `Path` will not be readonly, even if the source `Path` is. N)r )r$ r> r5 � __class__r# r )r" �memor$ r' r' r( � __deepcopy__ s �zPath.__deepcopy__c C s� |j \}}}|dkr td��|d }|| }t�|df�}tj|| j| jd�}| j|dd|�< | j||d|�< t |�D ] } |dd�| f || d|�< qv| ||�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 r z%The third dimension of 'XY' must be 2r r r N) r r r �zeros�fullr r r r �range) r. ZXYZnumpolysZnumsidesZtwoZstrideZnvertsr/ r$ �ir' r' r( � make_compound_path_from_polys& s z"Path.make_compound_path_from_polysc G s� |s t tjddgtjd��S dd� |D �}t|�}t�dd� |D ��}|�|df� tj|| jd�}d}|D ]\}|jdkr�| j ||< | j ||d |t |j � �< n|j|||t |j� �< |t |j �7 }ql| ||�S ) z1Make a compound path from a list of Path objects.r r r c S s g | ] }t |��qS r' )r ��.0�xr' r' r( � <listcomp>J s z+Path.make_compound_path.<locals>.<listcomp>c S s g | ] }|j �qS r' )r# rH r' r' r( rK M s Nr ) r r r Zfloat32�sum�vstackZreshaper r$ r r r r# )r. �argsZlengthsZ total_lengthr# r$ rF �pathr' r' r( �make_compound_pathC s zPath.make_compound_pathc C s d| j | jf S )Nz Path(%r, %r))r# r$ r4 r' r' r( �__repr__\ s z Path.__repr__c C s t | j�S r8 )r r# r4 r' r' r( �__len___ s z Path.__len__T� �?c c s� t | �s dS | j||||||||d�} | j} | j} t| j�} t| j�} t| | �D ]T\}}|| krd q�| | d }|r�t|�D ] }t | � t � |t | ��}q|||fV qPdS )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)� transform� remove_nans�clip�snap� stroke_width�simplify�curves�sketchr ) r �cleaned�NUM_VERTICES_FOR_CODE�STOP�iterr# r$ �ziprE �nextr �append)r" rT rU rV rW rX rY rZ r[ r\ r] r^ r# r$ Z curr_vertices�codeZextra_verticesrF r' r' r( � iter_segmentsb s0 ( � zPath.iter_segmentsc C s: t �| |||||||| � \} } t�| | | �} |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)r Z cleanup_pathr r1 r, ) r" rT rU rV ZquantizerY rZ rX rW r[ r# r$ r0 r' r' r( r\ � s �z Path.cleanedc C s t |�| j�| j| j�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 rT r# r$ r )r" rT r' r' r( � transformed� s �zPath.transformed� c C sB |dk r|� � }|r(|js(|�| �} d}t�|d |d || |�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 )�frozen� is_affineZtransform_pathr Z point_in_path)r" ZpointrT �radiusr' r' r( �contains_point� s zPath.contains_pointc C s* |dk r|� � }t�||| |�}|�d�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)rg r Zpoints_in_pathZastype)r" ZpointsrT ri �resultr' r' r( �contains_points� s zPath.contains_pointsc C s |dk r|� � }t�| d||�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)rg r Z path_in_path)r" rO rT r' r' r( � contains_path� s zPath.contains_pathc C sD ddl m} | }|dk r4|�� }|js4| �|�}d}|t�||��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 ��BboxN)� transformsrp rg rh re r Zget_path_extents)r" rT rp rO r' r' r( � get_extents� s zPath.get_extentsc C s t �| ||�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. )r Zpath_intersects_path)r" �other�filledr' r' r( �intersects_path s zPath.intersects_pathc C s t �| |j|j|j|j|�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. )r Zpath_intersects_rectangleZx0Zy0Zx1Zy1)r" �bboxrt r' r' r( �intersects_bbox s �zPath.intersects_bboxc C sh |dkr | S t | j|�}| j}|dk rZtjt|�d | d tj| jd�}||dd|�< nd}t||�S )z| Returns a new path resampled to length N x steps. Does not currently handle interpolating curves. r Nr r ) r r# r$ r rD r r r r )r" �stepsr# r$ Z new_codesr' r' r( � interpolated s �zPath.interpolatedc C s� t | j�dkrg S |dk r"|�� }| jdkr�|dks<|dkr�| j}|rzt |�dk rVg S t�|d |d k�rz||d f�}|dkr�|gS |�|�gS t�| ||||�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 ) r r# rg r$ r �anyrT r Zconvert_path_to_polygons)r" rT �widthZheightZ closed_onlyr# r' r' r( � to_polygons- s* �zPath.to_polygonsc C sR | j dkrL| ddgddgddgddgddgg| j| j| j| j| jgdd�| _ | j S )zW Return a `Path` instance of the unit rectangle from (0, 0) to (1, 1). Nrf rS T�r& )�_unit_rectangler r r �r. r' r' r( �unit_rectangle[ s ����zPath.unit_rectanglec C s� |dkr| j �|�}nd}|dkr�dtj | t�|d � tjd }t�t�|�t�|�f�}t�|d �}| j |d< | j |dd�< | j |d< | ||dd�}|dkr�|| 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). � Nr r r r Tr} ) �_unit_regular_polygons�getr �pi�arangeZ column_stack�cos�sinr r r r )r. � numVerticesrO �thetar/ r$ r' r' r( �unit_regular_polygonk s � zPath.unit_regular_polygon� �?c C s� |dkr| j �||f�}nd}|dkr�|d }dtj | t�|d � }|tjd 7 }t�|d �}||ddd�< t�|t�|� |t�|� f�� � }t� |d f�}| j |d< | j |dd�< | j |d< | ||dd �}|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 r g @r r Tr} )�_unit_regular_starsr� r r� r� ZonesrM r� r� Z transposer r r r ) r. r� Z innerCirclerO Zns2r� �rr/ r$ r' r' r( �unit_regular_star� s$ & zPath.unit_regular_starc C s | � |d�S )z� Return a :class:`Path` for a unit regular asterisk with the given numVertices and radius of 1.0, centered at (0, 0). rf )r� )r. r� r' r' r( �unit_regular_asterisk� s zPath.unit_regular_asteriskc C s" | j dkr | jdddd�| _ | j S )z� Return the readonly :class:`Path` of the unit circle. For most cases, :func:`Path.circle` will be what you want. N)r r r T)�centerri r& )� _unit_circle�circler r' r' r( � unit_circle� s �zPath.unit_circle�rf rf c C sV d}t �d�}|| }t jddg|dg|| | | g|| g|| | | gd| gddgd|g|| || g||g|| || g|dgddg| dg| | || g| |g| | || gd|gddgd| g| | | | g| | g| | | | g| dgddgddggtd�}| jgd }| j|d< | j|d < t|| | ||d �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>`_. �rSl��?r� rf � �rS r � r r r} )r �sqrt�array�float�CURVE4r r r ) r. r� ri r& �MAGIC�SQRTHALF�MAGIC45r# r$ r' r' r( r� � sH �#�% z Path.circlec C s� | j dkr�d}t�d�}|| }t�ddg|dg|| | | g|| g|| | | gd| gddgd|g|| || g||g|| || g|dgddgddggt�}tjd| j| jd�}| j|d < | j |d < | ||d d �| _ | j S ) z� Return a `Path` of the right half of a unit circle. See `Path.circle` for the reference on the approximation used. Nr� r� rf r� rS � r r r Tr} ) �_unit_circle_righthalfr r� r� r� rD r� r r r )r. r� r� r� r# r$ r' r' r( �unit_circle_righthalf� s6 �� zPath.unit_circle_righthalfc C s� t jd }|}|dt �|| d � }||kr@||kr@|d7 }t �||g�\}}|dkrttdt �|| | � �}|dk r�td��|| | }t �d| �} t �|�t � dd| | �d d } t � |||d d �} t � | �} t �| �} | dd � }| dd � }| }|}| dd� }| dd� }| }|}|�r�|d d }t � |dft �}t j|| j| jd �}|d |d g|d< | j| jg|dd�< | j| jg|dd�< d}|d }nV|d d }t �|dft �}t j|| j| jd �}|d |d g|d< | j|d< d}|}|| | |||d �df< || | |||d �df< || | ||d |d �df< || | ||d |d �df< |||d |d �df< |||d |d �df< | ||d d�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>`_. r� ih Nr r zn must be >= 1 or Noneg @g @Tr r r r r ���r} )r r� ZfloorZdeg2rad�intZceilr Ztanr� r� Zlinspacer� rC r� rD r� r r r r r )r. �theta1�theta2�nZis_wedgeZhalfpiZeta1Zeta2Zdeta�tZalpharx Zcos_etaZsin_etaZxAZyAZxA_dotZyA_dotZxBZyBZxB_dotZyB_dotZlengthr# r$ Z vertex_offset�endr' r' r( �arc( s^ ( zPath.arcc C s | � |||d�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( �wedgew s z Path.wedge� � c C s" ddl m} | dk r || |�S dS )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 )�get_pathN)Zmatplotlib.hatchr� )Z hatchpatternZdensityr� r' r' r( �hatch� s � �z Path.hatchc C s& t �| ||�}dd� |D �}| j|� 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 S s g | ] }t |��qS r' )r )rI Zpolyr' r' r( rK � s z%Path.clip_to_bbox.<locals>.<listcomp>)r Zclip_path_to_rectrP )r" rv Zinsider/ �pathsr' r' r( � clip_to_bbox� s zPath.clip_to_bbox)Nr FF)N)N)NTNFrS NTN) NFNFFFrS FN)Nrf )Nrf )N)N)T)T)Nr r T)r� )r� rS F)NF)N)r� )T)B�__name__� __module__� __qualname__�__doc__r Zuint8r r^ r r ZCURVE3r� r r] r) � classmethodr1 r �propertyr# �setterr$ r7 r � deprecatedr; r= r& r? r> rB �deepcopyrG rP rQ rR rd r\ re rj rm rn rr ru rw ry r| r~ r� r r� r� r� r� r� r� r� r� r� r� r� r� � staticmethodr r� r� r' r' r' r( r s� 7 � � ? � � A � , C ) N r c C s> ddl m} t|�dkr td��|jt�| |t�|�||�� 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 ro r �No paths provided) rq rp r r � from_extentsr �get_path_collection_extentsr Z atleast_3d)Zmaster_transformr� rq ZoffsetsZoffset_transformrp r' r' r( r� � s �r� r9 Z get_paths_collection_extentsr: c C s@ ddl m}m} t| �dkr$td��|jt�|� | |g |� �� 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 )rp �Affine2Dr r� )rq rp r� r r r� r r� )r� rq rp r� r' r' r( �get_paths_extents� s �r� )r� � functoolsr �weakrefr Znumpyr � r r r r r �objectr r� r� r� r' r' r' r( �<module> s "