OwlCyberSecurity - MANAGER
Edit File: transforms.cpython-38.pyc
U ��]} � @ s d Z ddlZddlZddlZddlmZ ddlmZ ddl m Z m Z m Z ddl mZ dZd d � ZG d d � d e�ZG d d� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG d d � d e�ZG d d � d e�Z G d!d"� d"e�Z G d#d$� d$e�Z d%d&� Z G d'd(� d(e�Z G d)d*� d*e�Z!d+d,� Z"G d-d.� d.e�Z#G d/d0� d0e�Z$G d1d2� d2e$�Z%G d3d4� d4e�Z&G d5d6� d6e�Z'G d7d8� d8e�Z(G d9d:� d:e(�Z)dKd>d?�Z*d@dA� Z+dLdCdD�Z,dEdF� Z-dMdIdJ�Z.dS )Na� matplotlib includes a framework for arbitrary geometric transformations that is used determine the final position of all elements drawn on the canvas. Transforms are composed into trees of :class:`TransformNode` objects whose actual value depends on their children. When the contents of children change, their parents are automatically invalidated. The next time an invalidated transform is accessed, it is recomputed to reflect those changes. This invalidation/caching approach prevents unnecessary recomputations of transforms, and contributes to better interactive performance. For example, here is a graph of the transform tree used to plot data to the graph: .. image:: ../_static/transforms.png The framework can be used for both affine and non-affine transformations. However, for speed, we want use the backend renderers to perform affine transformations whenever possible. Therefore, it is possible to perform just the affine or non-affine part of a transformation on a set of data. The affine is always assumed to occur after the non-affine. For any transform:: full transform == non-affine part + affine part The backends are not expected to handle non-affine transformations themselves. � N)�inv)�cbook)�affine_transform� count_bboxes_overlapping_bbox�update_path_extents� )�PathFc C s t �ddt| ��S )Nz(^| )z\1 )�re�sub�str)�obj� r �7/usr/lib/python3/dist-packages/matplotlib/transforms.py� _indent_str2 s r c @ s� e Zd ZdZdZdZdZeeB ZdZdZ dZ d dd�Z e rBd d � Z d d � Zd d� Zdd� ZeZdd� Zdd� Zdd� Ze r�eZdd� Zeje_dd� Ze r�g fdd�ZdS ) � TransformNodeaE :class:`TransformNode` is the base class for anything that participates in the transform tree and needs to invalidate its parents or be invalidated. This includes classes that are not really transforms, such as bounding boxes, since some transforms depend on bounding boxes to compute their values. r r � FNc C s i | _ d| _|pd| _dS )a@ Creates a new :class:`TransformNode`. Parameters ---------- shorthand_name : str A string representing the "name" of the transform. The name carries no significance other than to improve the readability of ``str(transform)`` when DEBUG=True. r � N)�_parents�_invalid�_shorthand_name)�self�shorthand_namer r r �__init__R s zTransformNode.__init__c C s | j p t| �S �N)r �repr�r r r r �__str__e s zTransformNode.__str__c C s | j ddd� | j�� D �i�S )Nr c S s i | ]\}}||� �qS r r ��.0�k�vr r r � <dictcomp>l s z.TransformNode.__getstate__.<locals>.<dictcomp>��__dict__r �itemsr r r r � __getstate__i s �zTransformNode.__getstate__c s$ |� _ � fdd�� j�� D �� _d S )Nc s2 i | ]*\}}|d k r|t �||� jfdd���qS )Nc S s |� |�S r ��pop��refZsid�targetr r r �<lambda>s s z7TransformNode.__setstate__.<locals>.<dictcomp>.<lambda>)�weakrefr) r r r r r r! s s � �z.TransformNode.__setstate__.<locals>.<dictcomp>r" )r Z data_dictr r r � __setstate__n s �zTransformNode.__setstate__c G s t d��d S )NzKTransformNode instances can not be copied. Consider using frozen() instead.��NotImplementedError)r �argsr r r �__copy__x s �zTransformNode.__copy__c C s | j }| jr| j}| j|| d�S )z� Invalidate this :class:`TransformNode` and triggers an invalidation of its ancestors. Should be called any time the transform changes. )�invalidating_node)�INVALID� is_affine�INVALID_AFFINE�_invalidate_internal�r �valuer r r � invalidate~ s zTransformNode.invalidatec C sN | j |k }| js|rJ|| _ t| j�� �D ] }|� }|dk r(|j|| d� q(dS )z� Called by :meth:`invalidate` and subsequently ascends the transform stack calling each TransformNode's _invalidate_internal method. N�r8 r2 )r � pass_through�listr �valuesr6 )r r8 r2 Zstatus_changed�parentr r r r6 � s �z"TransformNode._invalidate_internalc G s8 |D ].}t �| t| �|jfdd��}||jt| �< qdS )z� Set the children of the transform, to let the invalidation system know which transforms can invalidate this transform. Should be called from the constructor of any transforms that depend on other transforms. c S s |� |�S r r& r( r r r r+ � s z,TransformNode.set_children.<locals>.<lambda>N)r, r) �idr )r �children�childr) r r r � set_children� s � zTransformNode.set_childrenc G s | j |� || _d S r )� _set_children� _children)r r@ r r r rB � s c C s | S )a Returns a frozen copy of this transform node. The frozen copy will not update when its children change. Useful for storing a previously known state of a transform where ``copy.deepcopy()`` might normally be used. r r r r r �frozen� s zTransformNode.frozenc s8 t � �� ���fdd��� �d� �| � � �d� dS )a2 For debugging purposes. Writes the transform tree rooted at 'self' to a graphviz "dot" format file. This file can be run through the "dot" utility to produce a graph of the transform tree. Affine transforms are marked in blue. Bounding boxes are marked in yellow. *fobj*: A Python file-like object Once the "dot" file has been created, it can be turned into a png easily with:: $> dot -Tpng -o $OUTPUT_FILE $DOT_FILE c s� | �kr d S �� | � i }| jj}| jr0d| }| �kr@d|d< d|d< d| |d< d�td j|�� ��}��d t | �|f � t | d �r�| j D ]F� t � fd d �| j �� D �d�}��dt | �t � �|f � �� � q�d S )Nz[%s]ZboldZstyleZbox�shapez"%s"�label� z {0[0]}={0[1]}z %s [%s]; rD c 3 s | ]\}}|� kr|V qd S r r )r �key�val�rA r r � <genexpr>� s �z@TransformNode.write_graphviz.<locals>.recurse.<locals>.<genexpr>�?z("%s" -> "%s" [label="%s", fontsize=10]; )�add� __class__�__name__r �join�map�formatr$ �write�hash�hasattrrD �nextr# )�rootZpropsrG �name��fobj� highlight�recurse�seenrK r r] � s2 ���z-TransformNode.write_graphviz.<locals>.recursez digraph G { z} N)�setrT )r r[ r\ r rZ r �write_graphviz� s z TransformNode.write_graphviz)N)rP � __module__� __qualname__�__doc__Z_gid�INVALID_NON_AFFINEr5 r3 r4 �is_bboxr; r �DEBUGr r% r- r1 � __deepcopy__r9 r6 rB rC rE r` r r r r r 6 s2 r c @ s e Zd ZdZdZdZer(dd� Zee�Zdd� Z e je _dd� Z d d � Z e d d � �Ze d d� �Ze dd� �Ze dd� �Ze dd� �Ze dd� �Ze dd� �Ze dd� �Ze dd � �Ze d d � �Ze d d � �Ze d!d"� �Ze d#d$� �Ze d%d&� �Ze d'd(� �Z e d)d*� �Z e d+d,� �Z e d-d.� �Z e d/d0� �Z d1d2� Z!d3d4� Z"d5d6� Z#d7d8� Z$d9d:� Z%d;d<� Z&d=d>� Z'd?d@� Z(dAdB� Z)dCdD� Z*dEdF� Z+dGdHdIdJdKdLdMdNdOdP� Z,dodRdS�Z-dTdU� Z.dpdWdX�Z/dYdZ� Z0d[d\� Z1d]d^� Z2d_d`� Z3dadb� Z4dcdd� Z5dedf� Z6dgdh� Z7didj� Z8edkdl� �Z9edmdn� �Z:dQS )q�BboxBasea� This is the base class of all bounding boxes, and provides read-only access to its data. A mutable bounding box is provided by the :class:`Bbox` class. The canonical representation is as two points, with no restrictions on their ordering. Convenience properties are provided to get the left, bottom, right and top edges and width and height, but these are not stored explicitly. Tc C sX t | tjj�rt�d� t�| �} | d | d dksJ| d | d dkrTt�d� d S )Nz Bbox bounds are a masked array.�r r �r r r �r r �r r zSingular Bbox.)� isinstance�np�ma� MaskedArrayr �_warn_external�asarray)�pointsr r r �_check s �zBboxBase._checkc C s t | �� �� �S r )�Bbox� get_points�copyr r r r rE s zBboxBase.frozenc O s | � � S r �rv �r r0 �kwargsr r r � __array__ s zBboxBase.__array__c C s | � � �� ddgddggkS )z<Return whether this is the unit box (from (0, 0) to (1, 1)).� � �?)rv �tolistr r r r �is_unit s zBboxBase.is_unitc C s | � � d S )z� The first of the pair of *x* coordinates that define the bounding box. This is not guaranteed to be less than :attr:`x1` (for that, use :attr:`xmin`). rj rx r r r r �x0 s z BboxBase.x0c C s | � � d S )z� The first of the pair of *y* coordinates that define the bounding box. This is not guaranteed to be less than :attr:`y1` (for that, use :attr:`ymin`). rl rx r r r r �y0) s z BboxBase.y0c C s | � � d S )z� The second of the pair of *x* coordinates that define the bounding box. This is not guaranteed to be greater than :attr:`x0` (for that, use :attr:`xmax`). ri rx r r r r �x13 s z BboxBase.x1c C s | � � d S )z� The second of the pair of *y* coordinates that define the bounding box. This is not guaranteed to be greater than :attr:`y0` (for that, use :attr:`ymax`). rk rx r r r r �y1= s z BboxBase.y1c C s | � � d S )z� The first pair of (*x*, *y*) coordinates that define the bounding box. This is not guaranteed to be the bottom-left corner (for that, use :attr:`min`). r rx r r r r �p0G s z BboxBase.p0c C s | � � d S )z� The second pair of (*x*, *y*) coordinates that define the bounding box. This is not guaranteed to be the top-right corner (for that, use :attr:`max`). r rx r r r r �p1Q s z BboxBase.p1c C s t �| �� dd�df �S )z"The left edge of the bounding box.Nr �rn �minrv r r r r �xmin[ s z BboxBase.xminc C s t �| �� dd�df �S )z$The bottom edge of the bounding box.Nr r� r r r r �ymin` s z BboxBase.yminc C s t �| �� dd�df �S )z#The right edge of the bounding box.Nr �rn �maxrv r r r r �xmaxe s z BboxBase.xmaxc C s t �| �� dd�df �S )z!The top edge of the bounding box.Nr r� r r r r �ymaxj s z BboxBase.ymaxc C s t j| �� dd�S )z+The bottom-left corner of the bounding box.r �Zaxisr� r r r r r� o s z BboxBase.minc C s t j| �� dd�S )z)The top-right corner of the bounding box.r r� r� r r r r r� t s z BboxBase.maxc C s | � � dd�df S )z� The pair of *x* coordinates that define the bounding box. This is not guaranteed to be sorted from left to right. Nr rx r r r r � intervalxy s zBboxBase.intervalxc C s | � � dd�df S )z� The pair of *y* coordinates that define the bounding box. This is not guaranteed to be sorted from bottom to top. Nr rx r r r r � intervaly� s zBboxBase.intervalyc C s | � � }|d |d S )z'The (signed) width of the bounding box.ri rj rx �r rs r r r �width� s zBboxBase.widthc C s | � � }|d |d S )z(The (signed) height of the bounding box.rk rl rx r� r r r �height� s zBboxBase.heightc C s | � � }|d |d S )z2The (signed) width and height of the bounding box.r r rx r� r r r �size� s z BboxBase.sizec C s( | � � \\}}\}}|||| || fS )z?Return (:attr:`x0`, :attr:`y0`, :attr:`width`, :attr:`height`).rx �r r� r� r� r� r r r �bounds� s zBboxBase.boundsc C s | � � �� S )z8Return (:attr:`x0`, :attr:`y0`, :attr:`x1`, :attr:`y1`).)rv Zflattenr r r r �extents� s zBboxBase.extentsc C s t �d S r r. r r r r rv � s zBboxBase.get_pointsc C s: | j \}}|| ko |kn p8|| ko4|kS S )zX Return whether *x* is in the closed (:attr:`x0`, :attr:`x1`) interval. �r� �r �xr� r� r r r � containsx� s zBboxBase.containsxc C s: | j \}}|| ko |kn p8|| ko4|kS S )zX Return whether *y* is in the closed (:attr:`y0`, :attr:`y1`) interval. �r� �r �yr� r� r r r � containsy� s zBboxBase.containsyc C s | � |�o| �|�S )zR Return whether ``(x, y)`` is in the bounding box or on its edge. )r� r� �r r� r� r r r �contains� s zBboxBase.containsc C s� | j \}}}}|j \}}}} ||k r.|| }}||k r@|| }}||k rR|| }}| |k rd|| } }||ko�||ko�|| ko�||kS )z� Return whether this bounding box overlaps with the other bounding box. Parameters ---------- other : BboxBase �r� � r �otherZax1Zay1Zax2Zay2Zbx1Zby1Zbx2Zby2r r r �overlaps� s zBboxBase.overlapsc C s: | j \}}|| k o |k n p8|| ko4|kS S )zV Return whether *x* is in the open (:attr:`x0`, :attr:`x1`) interval. r� r� r r r �fully_containsx� s zBboxBase.fully_containsxc C s: | j \}}|| k o |k n p8|| ko4|kS S )zV Return whether *y* is in the open (:attr:`y0`, :attr:`y1`) interval. r� r� r r r �fully_containsy� s zBboxBase.fully_containsyc C s | � |�o| �|�S )zV Return whether ``x, y`` is in the bounding box, but not on its edge. )r� r� r� r r r �fully_contains� s zBboxBase.fully_containsc C s� | j \}}}}|j \}}}} ||k r.|| }}||k r@|| }}||k rR|| }}| |k rd|| } }||k o�||k o�|| k o�||k S )z� Return whether this bounding box overlaps with the other bounding box, not including the edges. Parameters ---------- other : BboxBase r� r� r r r �fully_overlaps� s zBboxBase.fully_overlapsc C sX | � � }|�t�|d |d |d g|d |d gg��\}}}t||d |d gg�S )zX Construct a `Bbox` by statically transforming this one by *transform*. r rj rk ri rl r )rv � transformrn �arrayru )r r� �ptsZllZulZlrr r r � transformed� s �zBboxBase.transformedc C s | � |�� �S )zo Construct a `Bbox` by statically transforming this one by the inverse of *transform*. )r� �inverted�r r� r r r �inverse_transformed s z BboxBase.inverse_transformed)� �?r� rj )r� r )r} r )r} r� )r} r} )r� r} )r r} )r r� ) �CZSW�SZSE�EZNE�NZNW�WNc C s| |dkr | }|j \}}}}t|t�r4| j| \}}n|\}}| j \} } } } t| j|||| | |||| | g �S )a� Return a copy of the :class:`Bbox`, shifted to position *c* within a container. Parameters ---------- c : (float, float) or str May be either: * A sequence (*cx*, *cy*) where *cx* and *cy* range from 0 to 1, where 0 is left or bottom and 1 is right or top * a string: - 'C' for centered - 'S' for bottom-center - 'SE' for bottom-left - 'E' for left - etc. container : Bbox, optional The box within which the :class:`Bbox` is positioned; it defaults to the initial :class:`Bbox`. N)r� rm r �coefsru �_points) r �c� container�l�b�w�hZcxZcy�L�Br� �Hr r r �anchored s ��zBboxBase.anchoredc C s2 | j \}}t| jd | jd || || g g�S )a! Return a copy of the :class:`Bbox`, shrunk by the factor *mx* in the *x* direction and the factor *my* in the *y* direction. The lower left corner of the box remains unchanged. Normally *mx* and *my* will be less than 1, but this is not enforced. r )r� ru r� )r ZmxZmyr� r� r r r �shrunk: s �zBboxBase.shrunkr} c C sx |dks|dkrt d��|dkr$| }|j\}}|| | }||krH|}n|| | }|}t| jd | jd ||f g�S )a� Return a copy of the :class:`Bbox`, shrunk so that it is as large as it can be while having the desired aspect ratio, *box_aspect*. If the box coordinates are relative---that is, fractions of a larger box such as a figure---then the physical aspect ratio of that figure is specified with *fig_aspect*, so that *box_aspect* can also be given as a ratio of the absolute dimensions, not the relative dimensions. r z.'box_aspect' and 'fig_aspect' must be positiveN)� ValueErrorr� ru r� )r Z box_aspectr� Z fig_aspectr� r� r� r� r r r �shrunk_to_aspectE s �zBboxBase.shrunk_to_aspectc sN d|d�}| j \��}�|� � � ���fdd�t|dd� |dd� �D �S ) z� Return a list of new `Bbox` objects formed by splitting the original one with vertical lines at fractional positions given by *args*. r r c s4 g | ],\}}t �|� �g�|� �gg��qS r �ru )r Zxf0Zxf1�r� r� r� r� r r � <listcomp>e s �z#BboxBase.splitx.<locals>.<listcomp>N���)r )r �r� �zip)r r0 Zxfr� r r� r �splitx] s �zBboxBase.splitxc sN d|d�}| j \���}|� � � ���fdd�t|dd� |dd� �D �S ) z� Return a list of new `Bbox` objects formed by splitting the original one with horizontal lines at fractional positions given by *args*. r r c s4 g | ],\}}t ��|� g��|� gg��qS r r� )r Zyf0Zyf1�r� r� r� r� r r r� p s �z#BboxBase.splity.<locals>.<listcomp>Nr� )r )r r� )r r0 Zyfr� r r� r �splityh s �zBboxBase.splityc C s^ t |�dkrdS t�|�}tjdd��. | j|k || jk @ jdd��� W 5 Q R � S Q R X dS )z� Count the number of vertices contained in the :class:`Bbox`. Any vertices with a non-finite x or y value are ignored. Parameters ---------- vertices : Nx2 Numpy array. r �ignore)Zinvalidr r� N)�lenrn rr Zerrstater� r� �all�sum)r �verticesr r r �count_containss s ��zBboxBase.count_containsc C s t | t�dd� |D ���S )z� Count the number of bounding boxes that overlap this one. Parameters ---------- bboxes : sequence of :class:`BboxBase` objects c S s g | ]}t �|��qS r )rn r� )r r� r r r r� � s z+BboxBase.count_overlaps.<locals>.<listcomp>)r rn Z atleast_3d)r �bboxesr r r �count_overlaps� s �zBboxBase.count_overlapsc C sT | j }| j}|| | d }|| | d }t�| | g||gg�}t| j| �S )zr Construct a `Bbox` by expanding this one around its center by the factors *sw* and *sh*. g @)r� r� rn r� ru r� )r �swZshr� r� ZdeltawZdeltah�ar r r �expanded� s zBboxBase.expandedc C s$ | � � }t|| | g||gg �S )z@Construct a `Bbox` by padding this one on all four sides by *p*.)rv ru )r �prs r r r �padded� s zBboxBase.paddedc C s t | j||f �S )z<Construct a `Bbox` by translating this one by *tx* and *ty*.)ru r� )r �tx�tyr r r � translated� s zBboxBase.translatedc C s6 | � � \\}}\}}t�||g||g||g||gg�S )z� Return the corners of this rectangle as an array of points. Specifically, this returns the array ``[[x0, y0], [x0, y1], [x1, y0], [x1, y1]]``. )rv rn r� r� r r r �corners� s zBboxBase.cornersc C s4 | � � }t� �|��|�}t�� }|j|dd� |S )z� Return a new bounding box that bounds a rotated version of this bounding box by the given radians. The new bounding box is still aligned with the axes, of course. T)r� )r� �Affine2D�rotater� ru �unit�update_from_data_xy)r �radiansr� Zcorners_rotated�bboxr r r �rotated� s zBboxBase.rotatedc C st t | �std��t�dd� | D ��}t�dd� | D ��}t�dd� | D ��}t�dd� | D ��}t||g||gg�S )z8Return a `Bbox` that contains all of the given *bboxes*.z'bboxes' cannot be emptyc S s g | ] }|j �qS r )r� �r r� r r r r� � s z"BboxBase.union.<locals>.<listcomp>c S s g | ] }|j �qS r )r� r� r r r r� � s c S s g | ] }|j �qS r )r� r� r r r r� � s c S s g | ] }|j �qS r )r� r� r r r r� � s )r� r� rn r� r� ru )r� r� r� r� r� r r r �union� s zBboxBase.unionc C sh t �| j|j�}t �| j|j�}t �| j|j�}t �| j|j�}||krd||krdt||g||gg�S dS )zr Return the intersection of *bbox1* and *bbox2* if they intersect, or None if they don't. N)rn Zmaximumr� Zminimumr� r� r� ru )Zbbox1Zbbox2r� r� r� r� r r r � intersection� s zBboxBase.intersection)N)Nr} );rP ra rb rc re r4 rf rt � staticmethodrE r r{ r �propertyr� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rv r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r rh � s� � $ rh c @ sx e Zd ZdZdd� Zer,eZdd� Zdd� Zedd� �Z ed d � �Z ed d � �Z ed d� �Z dd� Z dd� Zdd� Zdd� ZdAdd�ZdBdd �Zejjd d � �Zejjd d � �Zejjd!d"� �Zejjd#d$� �Zejjd%d&� �Zejjd'd(� �Zejjd)d*� �Zej jd+d,� �Z ej jd-d.� �Z e d/d0� �Z e d1d2� �Z e d3d4� �Z!d5d6� Z"d7d8� Z#d9d:� Z$d;d<� Z%d=d>� Z&d?d@� Z'dS )Cru z! A mutable bounding box. c K s\ t j| f|� t�|t�}|jdkr,td��|| _t�tj tj g�| _ d| _ | j� � | _ dS )aa Parameters ---------- points : ndarray A 2x2 numpy array of the form ``[[x0, y0], [x1, y1]]``. Notes ----- If you need to create a :class:`Bbox` object from another form of data, consider the static methods :meth:`unit`, :meth:`from_bounds` and :meth:`from_extents`. �r r z7Bbox points must be of the form "[[x0, y0], [x1, y1]]".TN)rh r rn rr �floatrF r� r� r� �inf�_minpos�_ignorerw � _points_orig�r rs rz r r r r � s z Bbox.__init__c K s | � |� | j|f|� d S r )rt � ___init__r� r r r r � s c C s | � | j� t�| � d S r )rt r� r r9 r r r r r9 � s zBbox.invalidatec C s t t�ddgddggt��S )z_ (staticmethod) Create a new unit :class:`Bbox` from (0, 0) to (1, 1). r| r} )ru rn r� r� r r r r r� � s z Bbox.unitc C s( t t�tjtjgtj tj ggt��S )zi (staticmethod) Create a new null :class:`Bbox` from (inf, inf) to (-inf, -inf). )ru rn r� r� r� r r r r �null s z Bbox.nullc C s t �| || | || �S )z� (staticmethod) Create a new :class:`Bbox` from *x0*, *y0*, *width* and *height*. *width* and *height* may be negative. )ru � from_extents)r� r� r� r� r r r � from_bounds s zBbox.from_boundsc G s t j| td��dd�}t|�S )z� (staticmethod) Create a new Bbox from *left*, *bottom*, *right* and *top*. The *y*-axis increases upwards. )Zdtyper )rn r� r� �reshaperu )r0 rs r r r r� s zBbox.from_extentsc C s d� | |�S )Nz@Bbox(x0={0.x0:{1}}, y0={0.y0:{1}}, x1={0.x1:{1}}, y1={0.y1:{1}})�rS )r Zfmtr r r � __format__ s ��zBbox.__format__c C s t | d�S )Nr r� r r r r r $ s z Bbox.__str__c C s d� | �S )Nz*Bbox([[{0.x0}, {0.y0}], [{0.x1}, {0.y1}]])r� r r r r �__repr__' s z Bbox.__repr__c C s || _ dS )a� Set whether the existing bounds of the box should be ignored by subsequent calls to :meth:`update_from_data_xy`. value : bool - When ``True``, subsequent calls to :meth:`update_from_data_xy` will ignore the existing bounds of the :class:`Bbox`. - When ``False``, subsequent calls to :meth:`update_from_data_xy` will include the existing bounds of the :class:`Bbox`. N)r� r7 r r r r� * s z Bbox.ignoreNTc C s� |dkr| j }|jjdkr dS t|d| j| j|�\}}}|r�| �� |rt|dd�df | jdd�df< |d | jd< |r�|dd�df | jdd�df< |d | jd< dS )a� Update the bounds of the :class:`Bbox` based on the passed in data. After updating, the bounds will have positive *width* and *height*; *x0* and *y0* will be the minimal values. Parameters ---------- path : :class:`~matplotlib.path.Path` ignore : bool, optional - when ``True``, ignore the existing bounds of the :class:`Bbox`. - when ``False``, include the existing bounds of the :class:`Bbox`. - when ``None``, use the last value passed to :meth:`ignore`. updatex, updatey : bool, optional When ``True``, update the x/y values. Nr r )r� r� r� r r� r� r9 )r �pathr� �updatex�updateyrs �minposZchangedr r r �update_from_path8 s& � zBbox.update_from_pathc C s. t |�dkrdS t|�}| j||||d� dS )a� Update the bounds of the :class:`Bbox` based on the passed in data. After updating, the bounds will have positive *width* and *height*; *x0* and *y0* will be the minimal values. Parameters ---------- xy : ndarray A numpy array of 2D points. ignore : bool, optional - When ``True``, ignore the existing bounds of the :class:`Bbox`. - When ``False``, include the existing bounds of the :class:`Bbox`. - When ``None``, use the last value passed to :meth:`ignore`. updatex, updatey : bool, optional When ``True``, update the x/y values. r N)r� r� r� )r� r r� )r Zxyr� r� r� r� r r r r� \ s �zBbox.update_from_data_xyc C s || j d< | �� d S �Nrj �r� r9 �r rJ r r r r� v s zBbox.x0c C s || j d< | �� d S �Nrl r r r r r r� { s zBbox.y0c C s || j d< | �� d S �Nri r r r r r r� � s zBbox.x1c C s || j d< | �� d S �Nrk r r r r r r� � s zBbox.y1c C s || j d< | �� d S �Nr r r r r r r� � s zBbox.p0c C s || j d< | �� d S �Nr r r r r r r� � s zBbox.p1c C s || j d d �df< | �� d S r r �r �intervalr r r r� � s zBbox.intervalxc C s || j d d �df< | �� d S r r r r r r r� � s zBbox.intervalyc C sN |\}}}}t �||g|| || ggt�}t �| j|k�rJ|| _| �� d S r )rn r� r� �anyr� r9 )r r� r� r� r� r� rs r r r r� � s z Bbox.boundsc C s | j S r �r� r r r r r� � s z Bbox.minposc C s | j d S r r r r r r �minposx� s z Bbox.minposxc C s | j d S r r r r r r �minposy� s z Bbox.minposyc C s d| _ | jS )z} Get the points of the bounding box directly as a numpy array of the form: ``[[x0, y0], [x1, y1]]``. r )r r� r r r r rv � s zBbox.get_pointsc C s" t �| j|k�r || _| �� dS )z� Set the points of the bounding box directly from a numpy array of the form: ``[[x0, y0], [x1, y1]]``. No error checking is performed, as this method is mainly for internal use. N)rn r r� r9 r� r r r � set_points� s zBbox.set_pointsc C s* t �| j|�� k�r&|�� | _| �� dS )zb Set this bounding box from the "frozen" bounds of another :class:`Bbox`. N)rn r r� rv r9 �r r� r r r r_ � s zBbox.setc C s | � � p| �� S )z/Return whether the bbox has changed since init.)�mutatedx�mutatedyr r r r �mutated� s z Bbox.mutatedc C s( | j d | jd kp&| j d | jd kS )z4Return whether the x-limits have changed since init.rj ri �r� r� r r r r r � s �z Bbox.mutatedxc C s( | j d | jd kp&| j d | jd kS )z4Return whether the y-limits have changed since init.rl rk r r r r r r � s �z Bbox.mutatedy)NTT)NTT)(rP ra rb rc r rf r� r9 r� r� r� r� r� r� r r� r� r� r� rh r� �setterr� r� r� r� r� r� r� r� r� r� r r rv r r_ r r r r r r r ru � sd $ ru c @ s8 e Zd ZdZdd� Zdd� Zdd� Zer4eZdd� Zd S ) �TransformedBboxz� A :class:`Bbox` that is automatically transformed by a given transform. When either the child bounding box or transform changes, the bounds of this bbox will update accordingly. c K sl |j std��t|t�s td��|jdks4|jdkr<td��tj| f|� || _|| _ | � ||� d| _ dS )zt Parameters ---------- bbox : :class:`Bbox` transform : :class:`Transform` �'bbox' is not a bbox�C'transform' must be an instance of 'matplotlib.transform.Transform'r z8The input and output dimensions of 'transform' must be 2N) re r� rm � Transform� input_dims� output_dimsrh r �_bbox� _transformrB r� )r r� r� rz r r r r � s � zTransformedBbox.__init__c C s d� t| �jt| j�t| j��S �Nz {}( {}, {}))rS �typerP r r r r r r r r � s �zTransformedBbox.__str__c C s$ | j �r | j�� }| j�|d |d g|d |d g|d |d g|d |d gg�}tj�|d�}t|d d �df �t |d d �df �f}|d |d kr�|d d d� }t|d d �df �t |d d �df �f}|d |d kr�|d d d� }t� |d |d g|d |d gg�| _ d| _ | j S ) Nrj rl ri rk r| r r� r ) r r rv r r� rn ro Zfilledr� r� r� r� )r r� rs ZxsZysr r r rv s, ��((�zTransformedBbox.get_pointsc C s | � � }| �|� |S r �� _get_pointsrt r� r r r rv " s N) rP ra rb rc r r rv rf r r r r r r � s r c @ s� e Zd ZdZddd�Zdd� Zdd� Zer6eZd d� Ze d d � �Z e j d d � �Z e d d� �Z e j dd� �Z e dd� �Z e j dd� �Z e dd� �Zej dd� �ZdS )� LockableBboxz� A :class:`Bbox` where some elements may be locked at certain values. When the child bounding box changes, the bounds of this bbox will update accordingly with the exception of the locked elements. Nc K sj |j std��tj| f|� || _| �|� d| _||||g}dd� |D �}tjj |t |d�� d�| _ dS )a� Parameters ---------- bbox : Bbox The child bounding box to wrap. x0 : float or None The locked value for x0, or None to leave unlocked. y0 : float or None The locked value for y0, or None to leave unlocked. x1 : float or None The locked value for x1, or None to leave unlocked. y1 : float or None The locked value for y1, or None to leave unlocked. r Nc S s g | ] }|d k�qS r r )r rJ r r r r� K s z)LockableBbox.__init__.<locals>.<listcomp>��maskr� ) re r� rh r r rB r� rn ro r� r� r� �_locked_points) r r� r� r� r� r� rz �fpr# r r r r / s zLockableBbox.__init__c C s d� t| �jt| j�t| j��S r )rS r rP r r r$ r r r r r N s �zLockableBbox.__str__c C s2 | j r,| j�� }t�| jj|| j�| _d| _ | jS r )r r rv rn �wherer$ r# r� r� r r r rv V s �zLockableBbox.get_pointsc C s | � � }| �|� |S r r r� r r r rv c s c C s | j jd rdS | j d S dS )zB float or None: The value used for the locked x0. rj N�r$ r# r r r r � locked_x0h s zLockableBbox.locked_x0c C s( |d k| j jd< || j jd< | �� d S r �r$ r# �datar9 )r r� r r r r( r s c C s | j jd rdS | j d S dS )zB float or None: The value used for the locked y0. rl Nr' r r r r � locked_y0x s zLockableBbox.locked_y0c C s( |d k| j jd< || j jd< | �� d S r r) )r r� r r r r+ � s c C s | j jd rdS | j d S dS )zB float or None: The value used for the locked x1. ri Nr' r r r r � locked_x1� s zLockableBbox.locked_x1c C s( |d k| j jd< || j jd< | �� d S r r) )r r� r r r r, � s c C s | j jd rdS | j d S dS )zB float or None: The value used for the locked y1. rk Nr' r r r r � locked_y1� s zLockableBbox.locked_y1c C s( |d k| j jd< || j jd< | �� d S r r) )r r� r r r r- � s )NNNN)rP ra rb rc r r rv rf r r� r( r r+ r, r- r r r r r! ( s. r! c @ s� e Zd ZdZdZdZdZdZdd� Zdd� Z dd � Z e d d � �Z d d � Z dd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd-d)d*�Zd+d,� Z dS ).r a� The base class of all :class:`TransformNode` instances that actually perform a transformation. All non-affine transformations should be subclasses of this class. New affine transformations should be subclasses of :class:`Affine2D`. Subclasses of this class should override the following members (at minimum): - :attr:`input_dims` - :attr:`output_dims` - :meth:`transform` - :attr:`is_separable` - :attr:`has_inverse` - :meth:`inverted` (if :attr:`has_inverse` is True) If the transform needs to do something non-standard with :class:`matplotlib.path.Path` objects, such as adding curves where there were once line segments, it should override: - :meth:`transform_path` NFc C s( t |t�rt| |�S tdt|� ��dS �zc Composes two transforms together such that *self* is followed by *other*. z,Can not add Transform to object of type '%s'N�rm r �composite_transform_factory� TypeErrorr r r r r �__add__� s �zTransform.__add__c C s( t |t�rt|| �S tdt|� ��dS r. r/ r r r r �__radd__� s �zTransform.__radd__c c s t � | fV dS )a� Returns an iterator breaking down this transform stack from left to right recursively. If self == ((A, N), A) then the result will be an iterator which yields I : ((A, N), A), followed by A : (N, A), followed by (A, N) : (A), but not ((A, N), A) : I. This is equivalent to flattening the stack then yielding ``flat_stack[:i], flat_stack[i:]`` where i=0..(n-1). N��IdentityTransformr r r r � _iter_break_from_left_to_right� s z(Transform._iter_break_from_left_to_rightc C s dS )a Returns the number of transforms which have been chained together to form this Transform instance. .. note:: For the special case of a Composite transform, the maximum depth of the two is returned. r r r r r r �depth� s zTransform.depthc C s4 | j |j k rdS | �� D ]\}}||kr dS qdS )aR Return whether the given transform is a sub-tree of this transform. This routine uses transform equality to identify sub-trees, therefore in many situations it is object id which will be used. For the case where the given transform represents the whole of this transform, returns True. FT)r7 r6 )r r� �_�sub_treer r r �contains_branch s zTransform.contains_branchc C s" | j dkrtd��| �|�gd S )aV Returns whether the given branch is a sub-tree of this transform on each separate dimension. A common use for this method is to identify if a transform is a blended transform containing an axes' data transform. e.g.:: x_isdata, y_isdata = trans.contains_branch_seperately(ax.transData) r zLcontains_branch_seperately only supports transforms with 2 output dimensions)r r� r: )r Zother_transformr r r �contains_branch_seperately s z$Transform.contains_branch_seperatelyc C s� t |t�stS | �� D ]\}}||kr| S q|�� D ]*\}}|| kr8|jsVtd��|�� S q8|jrv| |�� S td��dS )a� Returns a transform stack which goes all the way down self's transform stack, and then ascends back up other's stack. If it can, this is optimised:: # normally A - B == a + b.inverted() # sometimes, when A contains the tree B there is no need to # descend all the way down to the base of A (via B), instead we # can just stop at B. (A + B) - (B)^-1 == A # similarly, when B contains tree A, we can avoid descending A at # all, basically: A - (A + B) == ((B + A) - A).inverted() or B^-1 For clarity, the result of ``(A + B) - B + B == (A + B)``. zQThe shortcut cannot be computed since 'other' includes a non-invertible componentzpIt is not possible to compute transA - transB since transB cannot be inverted and there is no shortcut possible.N)rm r �NotImplementedr6 � has_inverser� r� )r r� Z remainderr9 r r r �__sub__- s � zTransform.__sub__c O s | � � �� S )zK Array interface to get at this Transform's affine matrix. �� get_affine� get_matrixry r r r r{ [ s zTransform.__array__c C s� t �|�}|j}|�d| jf�}| �| �|��}|dkrPt j�|�rHt �|d S |dkrb|�d�S |dkrn|S t dj | jd���dS ) a^ Performs the transformation on the given array of values. Accepts a numpy array of shape (N x :attr:`input_dims`) and returns a numpy array of shape (N x :attr:`output_dims`). Alternatively, accepts a numpy array of length :attr:`input_dims` and returns a numpy array of length :attr:`output_dims`. r� r rj r r z6Input values must have shape (N x {dims}) or ({dims}).)ZdimsN) rn � asanyarray�ndimr� r �transform_affine�transform_non_affinero Z is_masked�AssertionErrorr� rS )r r= rC �resr r r r� a s ��zTransform.transformc C s | � � �|�S )a� Performs only the affine part of this transformation on the given array of values. ``transform(values)`` is always equivalent to ``transform_affine(transform_non_affine(values))``. In non-affine transformations, this is generally a no-op. In affine transformations, this is equivalent to ``transform(values)``. Accepts a numpy array of shape (N x :attr:`input_dims`) and returns a numpy array of shape (N x :attr:`output_dims`). Alternatively, accepts a numpy array of length :attr:`input_dims` and returns a numpy array of length :attr:`output_dims`. �r@ r� �r r= r r r rD � s zTransform.transform_affinec C s |S )as Performs only the non-affine part of the transformation. ``transform(values)`` is always equivalent to ``transform_affine(transform_non_affine(values))``. In non-affine transformations, this is generally equivalent to ``transform(values)``. In affine transformations, this is always a no-op. Accepts a numpy array of shape (N x :attr:`input_dims`) and returns a numpy array of shape (N x :attr:`output_dims`). Alternatively, accepts a numpy array of length :attr:`input_dims` and returns a numpy array of length :attr:`output_dims`. r rI r r r rE � s z Transform.transform_non_affinec C s t | �|�� ��S )z� Transform the given bounding box. Note, for smarter transforms including caching (a common requirement for matplotlib figures), see :class:`TransformedBbox`. )ru r� rv )r r� r r r �transform_bbox� s zTransform.transform_bboxc C s t � S )z8 Get the affine part of this transform. r4 r r r r r@ � s zTransform.get_affinec C s | � � �� S )ze Get the Affine transformation array for the affine part of this transform. r? r r r r rA � s zTransform.get_matrixc C s, t |�| jkrtd��| �t�|g��d S )a A convenience function that returns the transformed copy of a single point. The point is given as a sequence of length :attr:`input_dims`. The transformed point is returned as a sequence of length :attr:`output_dims`. z/The length of 'point' must be 'self.input_dims'r )r� r r� r� rn rr )r �pointr r r �transform_point� s zTransform.transform_pointc C s | � | �|��S )z� Returns a transformed path. *path*: a :class:`~matplotlib.path.Path` instance. In some cases, this transform may insert curves into the path that began as line segments. )�transform_path_affine�transform_path_non_affine�r r� r r r �transform_path� s zTransform.transform_pathc C s | � � �|�S )a Returns a path, transformed only by the affine part of this transform. *path*: a :class:`~matplotlib.path.Path` instance. ``transform_path(path)`` is equivalent to ``transform_path_affine(transform_path_non_affine(values))``. )r@ rM rO r r r rM � s z Transform.transform_path_affinec C s | � |j�}t�||j|�S )a Returns a path, transformed only by the non-affine part of this transform. *path*: a :class:`~matplotlib.path.Path` instance. ``transform_path(path)`` is equivalent to ``transform_path_affine(transform_path_non_affine(values))``. )rE r� r �_fast_from_codes_and_verts�codes)r r� r� r r r rN � s z#Transform.transform_path_non_affine��h㈵��>c C s� | j dks| jdkr td��|jd dkr2td��|jdksP|jd |jd krXtd��|sj|d tj }||tjt� |�t� |�f }| � |�}| � |�}|| }t� |dd�df |dd�df �} |s�t� | �} | S ) a& Transforms a set of angles anchored at specific locations. Parameters ---------- angles : (N,) array-like The angles to transform. pts : (N, 2) array-like The points where the angles are anchored. radians : bool, default: False Whether *angles* are radians or degrees. pushoff : float For each point in *pts* and angle in *angles*, the transformed angle is computed by transforming a segment of length *pushoff* starting at that point and making that angle relative to the horizontal axis, and measuring the angle between the horizontal axis and the transformed segment. Returns ------- transformed_angles : (N,) array r zOnly defined in 2Dr z*'pts' must be array with 2 columns for x,yr zF'angles' must be a column vector and have same number of rows as 'pts'g �f@N)r r r/ rF r� rC rn ZpiZc_�cos�sinr� Zarctan2Zrad2deg) r Zanglesr� r� ZpushoffZpts2ZtptsZtpts2�dr� r r r �transform_angles� s " $ zTransform.transform_anglesc C s t � �dS )a, Return the corresponding inverse transformation. The return value of this method should be treated as temporary. An update to *self* does not cause a corresponding update to its inverted copy. ``x === self.inverted().transform(self.transform(x))`` Nr. r r r r r� & s zTransform.inverted)FrS ) rP ra rb rc r r r= � is_separabler2 r3 r6 r� r7 r: r; r> r{ r� rD rE rJ r@ rA rL rP rM rN rW r� r r r r r � s4 . 7r c @ sp e Zd ZdZdZdd� Zdd� Zdd� Zd d � Zd d � Z d d� Z dd� Z e dd� �Z e dd� �Ze dd� �ZdS )�TransformWrappera A helper class that holds a single child transform and acts equivalently to it. This is useful if a node of the transform tree must be replaced at run time with a transform of a different type. This class allows that replacement to correctly trigger invalidation. Note that :class:`TransformWrapper` instances must have the same input and output dimensions during their entire lifetime, so the child transform may only be replaced with another child transform of the same dimensions. Tc C s* t |t�std��| �|� | �|� dS )zt *child*: A class:`Transform` instance. This child may later be replaced with :meth:`set`. z?'child' must be an instance of 'matplotlib.transform.Transform'N)rm r r� �_initrB �r rA r r r r C s zTransformWrapper.__init__c C s. t �| � |j| _|j| _| �|� d| _d S r )r r r r �_setr r[ r r r rZ N s zTransformWrapper._initc C s | j �|�S r )�_child�__eq__r r r r r^ U s zTransformWrapper.__eq__c C s d� t| �jt| j��S �Nz{}( {}))rS r rP r r] r r r r r X s �zTransformWrapper.__str__c C s | j �� S r )r] rE r r r r rE ^ s zTransformWrapper.frozenc C sR || _ |j| _|j| _|j| _|j| _|j| _|j| _|j| _|j| _|j | _ d S r ) r] r� rD rE rP rM rN r@ r� rA r[ r r r r\ b s zTransformWrapper._setc C sL |j | j ks|j| jkr td��| �|� | �|� d| _| �� d| _dS )z� Replace the current child of this transform with another one. The new child must have the same number of input and output dimensions as the current child. z[The new child must have the same number of input and output dimensions as the current childr N)r r r� rB r\ r r9 r[ r r r r_ s s �� zTransformWrapper.setc C s | j jS r )r] r4 r r r r r+ � � zTransformWrapper.<lambda>c C s | j jS r )r] rX r r r r r+ � r` c C s | j jS r )r] r= r r r r r+ � r` N)rP ra rb rc r; r rZ r^ r rE r\ r_ r� r4 rX r= r r r r rY 3 s rY c @ sd e Zd ZdZdZdd� Zdd� Zdd� Zd d � Zd d � Z d d� Z dd� Z dd� Z dd� Z dd� ZdS )� AffineBasezW The base class of all affine transformations of any number of dimensions. Tc O s t j| f|�|� d | _d S r )r r � _invertedry r r r r � s zAffineBase.__init__c O s | � � S r �rA ry r r r r{ � s zAffineBase.__array__c C s& t |dd�r"t�| �� |�� k�S tS )Nr4 F)�getattrrn r� rA r< r r r r r^ � s zAffineBase.__eq__c C s | � |�S r )rD rI r r r r� � s zAffineBase.transformc C s t d��d S )Nz.Affine subclasses should override this method.r. rI r r r rD � s zAffineBase.transform_affinec C s |S r r r� r r r rE � s z AffineBase.transform_non_affinec C s | � |�S r )rM rO r r r rP � s zAffineBase.transform_pathc C s t | �|j�|j|j�S r )r rD r� rR Z_interpolation_stepsrO r r r rM � s �z AffineBase.transform_path_affinec C s |S r r rO r r r rN � s z$AffineBase.transform_path_non_affinec C s | S r r r r r r r@ � s zAffineBase.get_affineN)rP ra rb rc r4 r r{ r^ r� rD rE rP rM rN r@ r r r r ra � s ra c @ sl e Zd ZdZdZdZdZdd� Zedd� �Z dd � Z e d d � �Z d d � Z dd� Zer`e Zdd � Z dd� ZdS )� Affine2DBasea� The base class of all 2D affine transformations. 2D affine transformations are performed using a 3x3 numpy array:: a c e b d f 0 0 1 This class provides the read-only interface. For a mutable 2D affine transformation, use :class:`Affine2D`. Subclasses of this class will generally only need to override a constructor and :meth:`get_matrix` that generates a custom 3x3 matrix. Tr c C s t | �� �� �S r )r� rA rw r r r r rE � s zAffine2DBase.frozenc C s( | � � }|d |d ko"dkS S )Nrl ri r| rc �r �mtxr r r rX � s zAffine2DBase.is_separablec C s" | � � }t|dd� �dd�j�S )zU Return the values of the matrix as an ``(a, b, c, d, e, f)`` tuple. Nr r r )rA �tupleZswapaxesZflatrf r r r � to_values� s zAffine2DBase.to_valuesc C s$ t �| ||g|||gdddggt�S )z� (staticmethod) Create a new transformation matrix as a 3x3 numpy array of the form:: a c e b d f 0 0 1 r| r} )rn r� r� �r� r� r� rV �e�fr r r �matrix_from_values� s z Affine2DBase.matrix_from_valuesc C sD | � � }t|tjj�r:t|j|�}tjj|tj�|�d�S t||�S )Nr" )rA rm rn ro rp r r* Zgetmask)r rs rg Ztpointsr r r rD � s z Affine2DBase.transform_affinec C s | � � }t|g|�d S r )rA r )r rK rg r r r rL � s z Affine2DBase.transform_pointc C s4 t |tjjtjf�s*t�dt|�� d�� | �|�S )NzA non-numpy array of type zE was passed in for transformation, which results in poor performance.) rm rn ro rp Zndarrayr rq r �_transform_affiner� r r r rD � s �c C sJ | j d ks| jrD| �� }d }| jr,d| j }tt|�|d�| _ d| _| j S )Nz(%s)-1)r r )rb r rA r r� r )r rg r r r r r� s zAffine2DBase.invertedN)rP ra rb rc r= r r rE r� rX ri r� rm rD rL rf rn r� r r r r re � s re c @ s� e Zd ZdZd#dd�Zdd� Zedd� �Zd d � Zd d � Z d d� Z edd� �Z dd� Z dd� Z dd� Zdd� Zdd� Zdd � Zd$d d �Zd d � Zd!d"� ZdS )%r� z- A mutable 2D affine transformation. Nc K s0 t j| f|� |dkr tj�� }|| _d| _dS )z� Initialize an Affine transform from a 3x3 numpy float array:: a c e b d f 0 0 1 If *matrix* is None, initialize with the identity transform. Nr )re r r5 �_mtxrw r )r Zmatrixrz r r r r s zAffine2D.__init__c C s d� t| �jt| j��S r_ )rS r rP r ro r r r r r , s �zAffine2D.__str__c C s( t t�| |||||dddg t��d��S )z� (staticmethod) Create a new Affine2D instance from the given values:: a c e b d f 0 0 1 . r| r} )� rp )r� rn r� r� r� rj r r r � from_values2 s "�zAffine2D.from_valuesc C s d| _ | jS )z� Get the underlying transformation matrix as a 3x3 numpy array:: a c e b d f 0 0 1 . r )r ro r r r r rA A s zAffine2D.get_matrixc C s || _ | �� dS )z� Set the underlying transformation matrix from a 3x3 numpy array:: a c e b d f 0 0 1 . N)ro r9 rf r r r � set_matrixN s zAffine2D.set_matrixc C s( t |t�std��|�� | _| �� dS )zo Set this transformation from the frozen copy of another :class:`Affine2DBase` object. zB'other' must be an instance of 'matplotlib.transform.Affine2DBase'N)rm re r� rA ro r9 r r r r r_ [ s z Affine2D.setc C s t � S )z� (staticmethod) Return a new :class:`Affine2D` object that is the identity transform. Unless this transform will be mutated later on, consider using the faster :class:`IdentityTransform` class instead. )r� r r r r �identityf s zAffine2D.identityc C s t j�� | _| �� | S )zH Reset the underlying matrix to the identity transform. )r5 ro rw r9 r r r r �clearq s zAffine2D.clearc C sV t �|�}t �|�}t �|| dg||dgdddggt�}t �|| j�| _| �� | S )z� Add a rotation (in radians) to this transform in place. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. r| r} )rn rT rU r� r� �dotro r9 )r �thetar� r� Z rotate_mtxr r r r� z s �zAffine2D.rotatec C s | � t�|��S )z� Add a rotation (in degrees) to this transform in place. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. )r� rn �deg2rad)r �degreesr r r � rotate_deg� s zAffine2D.rotate_degc C s | � | | ��|�� ||�S )z� Add a rotation (in radians) around the point (x, y) in place. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. )� translater� )r r� r� rv r r r � rotate_around� s zAffine2D.rotate_aroundc C s0 t |�t |� }}| �| | ��|��||�S )z� Add a rotation (in degrees) around the point (x, y) in place. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. )r� rz ry )r r� r� rx r r r �rotate_deg_around� s zAffine2D.rotate_deg_aroundc C s@ t �dd|gdd|gdddggt�}t �|| j�| _| �� | S )z� Adds a translation in place. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. r} r| �rn r� r� ru ro r9 )r r� r� Z translate_mtxr r r rz � s �zAffine2D.translatec C sL |dkr |}t �|ddgd|dgdddggt�}t �|| j�| _| �� | S )a3 Adds a scale in place. If *sy* is None, the same scale is applied in both the *x*- and *y*-directions. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. Nr| r} r} )r ZsxZsyZ scale_mtxr r r �scale� s �zAffine2D.scalec C sT t �|�}t �|�}t �d|dg|ddgdddggt�}t �|| j�| _| �� | S )aD Adds a skew in place. *xShear* and *yShear* are the shear angles along the *x*- and *y*-axes, respectively, in radians. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. r} r| )rn Ztanr� r� ru ro r9 )r �xShear�yShearZrotXZrotYZskew_mtxr r r �skew� s �z Affine2D.skewc C s | � t�|�t�|��S )aD Adds a skew in place. *xShear* and *yShear* are the shear angles along the *x*- and *y*-axes, respectively, in degrees. Returns *self*, so this method can easily be chained with more calls to :meth:`rotate`, :meth:`rotate_deg`, :meth:`translate` and :meth:`scale`. )r� rn rw )r r r� r r r �skew_deg� s zAffine2D.skew_deg)N)N)rP ra rb rc r r r� rq rA rr r_ rs rt r� ry r{ r| rz r~ r� r� r r r r r� s& r� c @ sr e Zd ZdZe�d�Zdd� Zdd� Zdd� Z d d � Z d d � Z d d� Z dd� Z dd� Zdd� Zdd� Zdd� ZdS )r5 zY A special class that does one thing, the identity transform, in a fast way. rp c C s | S r r r r r r rE � s zIdentityTransform.frozenc C s d� t| �j�S )Nz{}())rS r rP r r r r r � s �zIdentityTransform.__str__c C s | j S r )ro r r r r rA � s z IdentityTransform.get_matrixc C s t �|�S r �rn rB r� r r r r� � s zIdentityTransform.transformc C s t �|�S r r� r� r r r rD s z"IdentityTransform.transform_affinec C s t �|�S r r� r� r r r rE s z&IdentityTransform.transform_non_affinec C s |S r r rO r r r rP s z IdentityTransform.transform_pathc C s |S r r rO r r r rM s z'IdentityTransform.transform_path_affinec C s |S r r rO r r r rN s z+IdentityTransform.transform_path_non_affinec C s | S r r r r r r r@ s z IdentityTransform.get_affinec C s | S r r r r r r r� s zIdentityTransform.invertedN)rP ra rb rc rn rs ro rE r rA r� rD rE rP rM rN r@ r� r r r r r5 � s r5 c @ s� e Zd ZdZdZdZdZdZdd� Zdd� Z dd � Z e d d � �Z d d � Z e dd� �Ze dd� �Zdd� Zdd� Zdd� Zdd� Zdd� ZdS ) �BlendedGenericTransformz� A "blended" transform uses one transform for the *x*-direction, and another transform for the *y*-direction. This "generic" version can handle any given child transform in the *x*- and *y*-directions. r Tc K s0 t j| f|� || _|| _| �||� d| _dS )a� Create a new "blended" transform using *x_transform* to transform the *x*-axis and *y_transform* to transform the *y*-axis. You will generally not call this constructor directly but use the :func:`blended_transform_factory` function instead, which can determine automatically which kind of blended transform to create. N)r r �_x�_yrB �_affine)r � x_transform� y_transformrz r r r r - s z BlendedGenericTransform.__init__c C sD t |ttf�r&| j|jko$| j|jkS | j| jkr<| j|kS tS d S r �rm �BlendedAffine2Dr� r� r� r< r r r r r^ @ s z BlendedGenericTransform.__eq__c C s | j �|�| j�|�fS r �r� r: r� r� r r r r; I s z2BlendedGenericTransform.contains_branch_seperatelyc C s t | jj| jj�S r )r� r� r7 r� r r r r r7 M s z BlendedGenericTransform.depthc C s dS �NFr r r r r r: Q s z'BlendedGenericTransform.contains_branchc C s | j jo| jjS r )r� r4 r� r r r r r+ U r` z BlendedGenericTransform.<lambda>c C s | j jo| jjS r )r� r= r� r r r r r+ W r` c C s t | j�� | j�� �S r )�blended_transform_factoryr� rE r� r r r r rE Y s z BlendedGenericTransform.frozenc C s d� t| �jt| j�t| j��S r �rS r rP r r� r� r r r r r ] s �z BlendedGenericTransform.__str__c C s | j jr| jjr|S | j }| j}||kr<|jdkr<|�|�S |jdkrb|�|�d d �dd�f }n(|�|d d �df �}|�t|�df�}|jdkr�|�|�d d �dd �f }n(|�|d d �df �}|�t|�df�}t|tj j �s�t|tj j ��rtj � ||fd�S t� ||fd�S d S )Nr r r ) r� r4 r� r rE r� r� rm rn ro rp Z concatenate)r rs r� r� Zx_pointsZy_pointsr r r rE e s& �z,BlendedGenericTransform.transform_non_affinec C s t | j�� | j�� �S r )r� r� r� r� r r r r r� � s z BlendedGenericTransform.invertedc C sz | j s| jd krt| j| jkr*| j�� | _nD| j�� �� }| j�� �� }t�|d |d dddgf�}t|�| _d| _ | jS �Nr r r| r} ) r r� r� r� r@ rA rn �vstackr� )r �x_mtx�y_mtxrg r r r r@ � s z"BlendedGenericTransform.get_affineN)rP ra rb rc r r rX r; r r^ r; r� r7 r: r4 r= rE r rE r� r@ r r r r r� s( � r� c @ s< e Zd ZdZdZdd� Zdd� Zdd� Zd d � Zd d � Z d S )r� z� A "blended" transform uses one transform for the *x*-direction, and another transform for the *y*-direction. This version is an optimization for the case where both child transforms are of type :class:`Affine2DBase`. Tc K sf |j o |j }|jo|j}|o |}|s,td��tj| f|� || _|| _| �||� t�| � d| _ dS )a� Create a new "blended" transform using *x_transform* to transform the *x*-axis and *y_transform* to transform the *y*-axis. Both *x_transform* and *y_transform* must be 2D affine transforms. You will generally not call this constructor directly but use the :func:`blended_transform_factory` function instead, which can determine automatically which kind of blended transform to create. zABoth *x_transform* and *y_transform* must be 2D affine transformsN) r4 rX r� r r r� r� rB re ro )r r� r� rz r4 rX Z is_correctr r r r � s zBlendedAffine2D.__init__c C sD t |ttf�r&| j|jko$| j|jkS | j| jkr<| j|kS tS d S r r� r r r r r^ � s zBlendedAffine2D.__eq__c C s | j �|�| j�|�fS r r� r� r r r r; � s z*BlendedAffine2D.contains_branch_seperatelyc C s d� t| �jt| j�t| j��S r r� r r r r r � s �zBlendedAffine2D.__str__c C sf | j r`| j| jkr | j�� | _n4| j�� }| j�� }t�|d |d dddgf�| _d | _d| _ | jS r� )r r� r� rA ro rn r� rb )r r� r� r r r rA � s zBlendedAffine2D.get_matrixN) rP ra rb rc rX r r^ r; r rA r r r r r� � s r� c C s( t | t�r t |t�r t| |�S t| |�S )z� Create a new "blended" transform using *x_transform* to transform the *x*-axis and *y_transform* to transform the *y*-axis. A faster version of the blended transform is returned for the case where both child transforms are affine. )rm re r� r� )r� r� r r r r� � s � r� c @ s� e Zd ZdZdZdd� Zdd� Zdd� Zd d � Zd d � Z e d d� �Z e dd� �Z e dd� �Z e dd� �Zdd� Zdd� Zdd� Zdd� Zdd� Zd d � Zd S ) �CompositeGenericTransformz� A composite transform formed by applying transform *a* then transform *b*. This "generic" version can handle any two arbitrary transformations. Tc K sN |j |jkrtd��|j| _|j | _ tj| f|� || _|| _| �||� dS )al Create a new composite transform that is the result of applying transform *a* then transform *b*. You will generally not call this constructor directly but use the :func:`composite_transform_factory` function instead, which can automatically choose the best kind of composite transform instance to create. �HThe output dimension of 'a' must be equal to the input dimensions of 'b'N)r r r� r r �_a�_brB �r r� r� rz r r r r � s z"CompositeGenericTransform.__init__c C s2 d| _ t| j�� | j�� �}t|t�s.|�� S |S r )r r0 r� rE r� rm r� )r rE r r r rE s z CompositeGenericTransform.frozenc C s> |t jkr*| jjs*| jjr$|| jkr*t j}t j| ||d� d S )Nr: )r r5 r� r4 r� r3 r6 )r r8 r2 r r r r6 s ����z.CompositeGenericTransform._invalidate_internalc C s6 t |ttf�r.| |kp,| j|jko,| j|jkS dS d S r� )rm r� �CompositeAffine2Dr� r� r r r r r^ ' s �z CompositeGenericTransform.__eq__c c sL | j �� D ]\}}||| j fV q | j�� D ]\}}| j | |fV q.d S r �r� r6 r� �r �left�rightr r r r6 . s z8CompositeGenericTransform._iter_break_from_left_to_rightc C s | j j| jj S r �r� r7 r� r r r r r+ 4 r` z"CompositeGenericTransform.<lambda>c C s | j jo| jjS r )r� r4 r� r r r r r+ 5 r` c C s | j jo| jjS r )r� rX r� r r r r r+ 7 r` c C s | j jo| jjS r )r� r= r� r r r r r+ 9 r` c C s d� t| �jt| j�t| j��S r �rS r rP r r� r� r r r r r ; s �z!CompositeGenericTransform.__str__c C s | � � �|�S r rH r� r r r rD C s z*CompositeGenericTransform.transform_affinec C sH | j jr| jjr|S | j js0| jjr0| j �|�S | j�| j �|��S d S r )r� r4 r� rE r� r� r r r rE G s �z.CompositeGenericTransform.transform_non_affinec C sH | j jr| jjr|S | j js0| jjr0| j �|�S | j�| j �|��S d S r )r� r4 r� rN rP rO r r r rN Q s �z3CompositeGenericTransform.transform_path_non_affinec C s: | j js| j �� S tt�| j �� �� | j�� �� ��S d S r )r� r4 r@ r� rn ru rA r� r r r r r@ [ s �z$CompositeGenericTransform.get_affinec C s t | j�� | j�� �S r )r� r� r� r� r r r r r� c s z"CompositeGenericTransform.invertedN)rP ra rb rc r; r rE r6 r^ r6 r� r7 r4 rX r= r rD rE rN r@ r� r r r r r� � s* �� r� c @ s< e Zd ZdZdd� Zedd� �Zdd� Zdd � Zd d � Z d S ) r� z� A composite transform formed by applying transform *a* then transform *b*. This version is an optimization that handles the case where both *a* and *b* are 2D affines. c K sh |j r |j std��|j|jkr(td��|j| _|j| _tj| f|� || _|| _| �||� d| _ dS )a� Create a new composite transform that is the result of applying transform *a* then transform *b*. Both *a* and *b* must be instances of :class:`Affine2DBase`. You will generally not call this constructor directly but use the :func:`composite_transform_factory` function instead, which can automatically choose the best kind of composite transform instance to create. z%'a' and 'b' must be affine transformsr� N) r4 r� r r re r r� r� rB ro r� r r r r o s zCompositeAffine2D.__init__c C s | j j| jj S r r� r r r r r7 � s zCompositeAffine2D.depthc c sL | j �� D ]\}}||| j fV q | j�� D ]\}}| j | |fV q.d S r r� r� r r r r6 � s z0CompositeAffine2D._iter_break_from_left_to_rightc C s d� t| �jt| j�t| j��S r r� r r r r r � s �zCompositeAffine2D.__str__c C s2 | j r,t�| j�� | j�� �| _d | _d| _ | jS r )r rn ru r� rA r� ro rb r r r r rA � s �z CompositeAffine2D.get_matrixN) rP ra rb rc r r� r7 r6 r rA r r r r r� h s r� c C sD t | t�r|S t |t�r | S t | t�r:t |t�r:t| |�S t| |�S )av Create a new composite transform that is the result of applying transform a then transform b. Shortcut versions of the blended transform are provided for the case where both child transforms are affine, or one or the other is the identity transform. Composite transforms may also be created using the '+' operator, e.g.:: c = a + b )rm r5 r� r� r� )r� r� r r r r0 � s r0 c @ s, e Zd ZdZdZdd� Zdd� Zdd� Zd S ) � BboxTransformzp :class:`BboxTransform` linearly transforms points from one :class:`Bbox` to another :class:`Bbox`. Tc K sJ |j r |j std��tj| f|� || _|| _| �||� d| _d| _dS )zw Create a new :class:`BboxTransform` that linearly transforms points from *boxin* to *boxout*. z!'boxin' and 'boxout' must be bboxN) re r� re r �_boxin�_boxoutrB ro rb )r �boxin�boxoutrz r r r r � s zBboxTransform.__init__c C s d� t| �jt| j�t| j��S r )rS r rP r r� r� r r r r r � s �zBboxTransform.__str__c C s� | j r�| jj\}}}}| jj\}}}}|| } || } trR| dksJ| dkrRtd��t�| d| | | gd| | | | gdddggt�| _ d | _ d| _ | j S )Nr z0Transforming from or to a singular bounding box.r| r} ) r r� r� r� rf r� rn r� r� ro rb ) r �inl�inb�inw�inh�outl�outb�outw�outh�x_scale�y_scaler r r rA � s ��zBboxTransform.get_matrixN�rP ra rb rc rX r r rA r r r r r� � s r� c @ s, e Zd ZdZdZdd� Zdd� Zdd� Zd S ) �BboxTransformToz� :class:`BboxTransformTo` is a transformation that linearly transforms points from the unit bounding box to a given :class:`Bbox`. Tc K s< |j std��tj| f|� || _| �|� d| _d| _dS )z� Create a new :class:`BboxTransformTo` that linearly transforms points from the unit bounding box to *boxout*. z'boxout' must be bboxN)re r� re r r� rB ro rb )r r� rz r r r r � s zBboxTransformTo.__init__c C s d� t| �jt| j��S r_ )rS r rP r r� r r r r r s �zBboxTransformTo.__str__c C sj | j rd| jj\}}}}tr2|dks*|dkr2td��t�|d|gd||gdddggt�| _d | _ d| _ | jS �Nr z(Transforming to a singular bounding box.r| r} ) r r� r� rf r� rn r� r� ro rb )r r� r� r� r� r r r rA s ��zBboxTransformTo.get_matrixNr� r r r r r� � s r� c @ s e Zd ZdZdd� ZdS )�BboxTransformToMaxOnlyz� :class:`BboxTransformTo` is a transformation that linearly transforms points from the unit bounding box to a given :class:`Bbox` with a fixed upper left of (0, 0). c C sf | j r`| jj\}}tr.|dks&|dkr.td��t�|ddgd|dgdddggt�| _d | _ d| _ | jS r� ) r r� r� rf r� rn r� r� ro rb )r r� r� r r r rA " s ��z!BboxTransformToMaxOnly.get_matrixN)rP ra rb rc rA r r r r r� s r� c @ s, e Zd ZdZdZdd� Zdd� Zdd� Zd S ) �BboxTransformFromzx :class:`BboxTransformFrom` linearly transforms points from a given :class:`Bbox` to the unit bounding box. Tc K s< |j std��tj| f|� || _| �|� d | _d | _d S )Nz'boxin' must be bbox)re r� re r r� rB ro rb )r r� rz r r r r 8 s zBboxTransformFrom.__init__c C s d� t| �jt| j��S r_ )rS r rP r r� r r r r r B s �zBboxTransformFrom.__str__c C s� | j r�| jj\}}}}tr2|dks*|dkr2td��d| }d| }t�|d| | gd|| | gdddggt�| _d | _ d| _ | jS )Nr z*Transforming from a singular bounding box.r} r| ) r r� r� rf r� rn r� r� ro rb )r r� r� r� r� r� r� r r r rA H s ��z BboxTransformFrom.get_matrixNr� r r r r r� 1 s r� c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �ScaledTranslationz| A transformation that translates by *xt* and *yt*, after *xt* and *yt* have been transformed by *scale_trans*. c K s8 t j| f|� ||f| _|| _| �|� d | _d | _d S r )re r �_t� _scale_transrB ro rb )r �xt�ytZ scale_transrz r r r r ^ s zScaledTranslation.__init__c C s d� t| �jt| j��S r_ )rS r rP r r� r r r r r f s �zScaledTranslation.__str__c C sP | j rJ| j�| j�\}}t�dd|gdd|gdddggt�| _d| _ d | _| jS )Nr} r| r ) r r� rL r� rn r� r� ro rb )r r� r� r r r rA l s ��z ScaledTranslation.get_matrixN)rP ra rb rc r r rA r r r r r� Y s r� c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd d � Z dS )�TransformedPatha} A :class:`TransformedPath` caches a non-affine transformed copy of the :class:`~matplotlib.path.Path`. This cached copy is automatically updated when the non-affine part of the transform changes. .. note:: Paths are considered immutable by this class. Any update to the path's vertices/codes will not trigger a transform recomputation. c C sB t |t�std��t�| � || _|| _| �|� d| _d| _ dS )z� Create a new :class:`TransformedPath` from the given :class:`~matplotlib.path.Path` and :class:`Transform`. r N) rm r r� r r �_pathr rB �_transformed_path�_transformed_points)r r� r� r r r r � s zTransformedPath.__init__c C sT | j | j@ | jks | jd krJ| j�| j�| _t�| j�| jj �d | j�| _ d| _ d S r ) r rd r� r rN r� r rQ rE r� r� r r r r � _revalidate� s � � ��zTransformedPath._revalidatec C s | � � | j| �� fS )a3 Return a copy of the child path, with the non-affine part of the transform already applied, along with the affine part of the path necessary to complete the transformation. Unlike :meth:`get_transformed_path_and_affine`, no interpolation will be performed. )r� r� r@ r r r r �!get_transformed_points_and_affine� s z1TransformedPath.get_transformed_points_and_affinec C s | � � | j| �� fS )z� Return a copy of the child path, with the non-affine part of the transform already applied, along with the affine part of the path necessary to complete the transformation. )r� r� r@ r r r r � get_transformed_path_and_affine� s z/TransformedPath.get_transformed_path_and_affinec C s | � � | j�| j�S )zD Return a fully-transformed copy of the child path. )r� r rM r� r r r r �get_fully_transformed_path� s z*TransformedPath.get_fully_transformed_pathc C s | j �� S r )r r@ r r r r r@ � s zTransformedPath.get_affineN) rP ra rb rc r r� r� r� r� r@ r r r r r� y s r� c @ s e Zd ZdZdd� Zdd� ZdS )�TransformedPatchPathz� A :class:`TransformedPatchPath` caches a non-affine transformed copy of the :class:`~matplotlib.path.Patch`. This cached copy is automatically updated when the non-affine part of the transform or the patch changes. c C sB t �| � |�� }|| _|| _| �|� |�� | _d| _d| _ dS )zt Create a new :class:`TransformedPatchPath` from the given :class:`~matplotlib.path.Patch`. N) r r Z get_transform�_patchr rB �get_pathr� r� r� )r Zpatchr� r r r r � s z TransformedPatchPath.__init__c C sh | j �� }| jd ks0| j|ks0| j| j@ | jkr^|| _| j�|�| _t� | j� |j �d |�| _ d| _d S r ) r� r� r� r� r rd r rN r rQ rE r� r� )r Z patch_pathr r r r� � s �� � ��z TransformedPatchPath._revalidateN)rP ra rb rc r r� r r r r r� � s r� ���MbP?�V瞯�<Tc C s� t �| �rt �|�s | |fS d}|| k r8|| } }d}tt| �t|��}|d| t �t�j k rn| } |}nL|| || kr�|dkr�| dkr�| } |}n | |t| � 8 } ||t|� 7 }|r�|s�|| } }| |fS )a Modify the endpoints of a range as needed to avoid singularities. Parameters ---------- vmin, vmax : float The initial endpoints. expander : float, optional, default: 0.001 Fractional amount by which *vmin* and *vmax* are expanded if the original interval is too small, based on *tiny*. tiny : float, optional, default: 1e-15 Threshold for the ratio of the interval to the maximum absolute value of its endpoints. If the interval is smaller than this, it will be expanded. This value should be around 1e-15 or larger; otherwise the interval will be approaching the double precision resolution limit. increasing : bool, optional, default: True If True, swap *vmin*, *vmax* if *vmin* > *vmax*. Returns ------- vmin, vmax : float Endpoints, expanded and/or swapped if necessary. If either input is inf or NaN, or if both inputs are 0 or very close to zero, it returns -*expander*, *expander*. FTg ��.Ar )rn Zisfiniter� �absZfinfor� �tiny)ZvminZvmaxZexpanderr� Z increasingZswappedZ maxabsvaluer r r � nonsingular� s& r� c C s2 | \}}||kr|| }}|| ko,|kS S )ai Check, inclusively, whether an interval includes a given value. Parameters ---------- interval : sequence of scalar A 2-length sequence, endpoints that define the interval. val : scalar Value to check is within interval. Returns ------- bool Returns *True* if given *val* is within the *interval*. r �r rJ r� r� r r r �interval_contains s r� 绽���|�=c C sF | \}}||kr|| }}|| | }|| | ko@|| kS S )a> Check, inclusively, whether an interval includes a given value, with the interval expanded by a small tolerance to admit floating point errors. Parameters ---------- interval : sequence of scalar A 2-length sequence, endpoints that define the interval. val : scalar Value to check is within interval. rtol : scalar Tolerance slippage allowed outside of this interval. Default 1e-10 * (b - a). Returns ------- bool Returns *True* if given *val* is within the *interval* (with tolerance) r )r rJ Zrtolr� r� r r r �_interval_contains_close3 s r� c C s8 | \}}|| k o|k n p6|| ko2|kS S )ak Check, excluding endpoints, whether an interval includes a given value. Parameters ---------- interval : sequence of scalar A 2-length sequence, endpoints that define the interval. val : scalar Value to check is within interval. Returns ------- bool Returns true if given val is within the interval. r r� r r r �interval_contains_openN s r� r| �inchesc C sf |dkr| t � �||� S |dkr*td��|dkrD|d }|d }n|dksTtd��| t|||j� S )aA Return a new transform with an added offset. Parameters ---------- trans : :class:`Transform` instance Any transform, to which offset will be applied. fig : :class:`~matplotlib.figure.Figure`, optional, default: None Current figure. It can be None if *units* are 'dots'. x, y : float, optional, default: 0.0 Specifies the offset to apply. units : {'inches', 'points', 'dots'}, optional Units of the offset. Returns ------- trans : :class:`Transform` instance Transform with applied offset. ZdotsNz3For units of inches or points a fig kwarg is neededrs g R@r� z%units must be dots, points, or inches)r� rz r� r� Zdpi_scale_trans)ZtransZfigr� r� Zunitsr r r � offset_copyb s r� )r� r� T)r� )Nr| r| r� )/rc r r, Znumpyrn Z numpy.linalgr Z matplotlibr Zmatplotlib._pathr r r r� r rf r �objectr rh ru r r! r rY ra re r� r5 r� r� r� r� r� r0 r� r� r� r� r� r� r� r� r� r� r� r� r r r r �<module> sb # G X L Y3W W4vMw>0+( H& 6