403Webshell
Server IP : 202.61.199.114  /  Your IP : 216.73.217.139
Web Server : nginx/1.22.1
System : Linux de.arni-solutions.de 6.1.0-49-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.174-1 (2026-05-26) x86_64
User : web20 ( 1018)
PHP Version : 8.4.23
Disable Function : NONE
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : OFF  |  Sudo : ON  |  Pkexec : ON
Directory :  /usr/local/lib/python3.9/dist-packages/matplotlib/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ Back ]     

Current File : /usr/local/lib/python3.9/dist-packages/matplotlib/__pycache__/cbook.cpython-39.pyc
a

���h�6�@s�dZddlZddlZddlZddlZddlZddlZddlZddlZddl	Z	ddl
mZddlZddl
Z
ddlZddlZddlZddlZddlZddlZzddlmZWney�ddlmZYn0ddlZddlmZmZdd�Zdd	�ZGd
d�d�Zdd
�ZGdd�d�ZGdd�de �Z!ej"d�dd�Z#dd�Z$dd�Z%dd�Z&dd�Z'd�dd �Z(d�d!d"�Z)d#d$�Z*ej+d%d&d'd(�d�d)d*�d+d,��Z,d-d.�Z-e*fd/d0�Z.e�/d%�Gd1d2�d2��Z0Gd3d4�d4�Z1d�d5d6�Z2ej3dfd7d8�Z4Gd9d:�d:�Z5Gd;d<�d<�Z6d=d>�Z7d?d@�Z8dAdB�Z9ddC�dDdE�Z:d�dGdH�Z;dIdJdKdLdM�Z<dNdO�e<�=�D�Z>dPdQ�Z?dRdS�Z@dTdU�ZAdVdW�ZBdXdY�ZCd�d[d\�ZDd]d^�ZEd_d`�ZFdadb�ZGdcdd�eEeEeFeGde�ZHdfdg�ZIdhdi�ZJdjdk�ZKdldm�ZLd�dndo�ZMejNdpdq��ZOejPeQe�Rdr�ds�fdtdu�ZSdvdw�ZTdxdy�ZUdzd{�ZVd|d}�ZWd~d�ZXejNd�d���ZYGd�d��d�ejZj[�Z\d�d��Z]d�d��Z^d�d��Z_d�d��Z`d�d��Zad�d��Zbd�d��Zcd�d��Zdd�d��Zeejfd�d�d���Zgd�d��Zhd�d��Zid�d��Zjd�d��Zkd�d��ZldS)�z�
A collection of utility functions and classes.  Originally, many
(but not all) were from the Python Cookbook -- hence the name cbook.
�N)�Path)�VisibleDeprecationWarning)�_api�_c_internal_utilscCs*tj�d�p.tj�d�p.tj�d�p.tj�d�}|rB|j��rBdStj�d�}|r�|jdkrtdd	lm}|��rtd
S|jdkr�|�	�r�dStj�d
�}|r�|�
�r�d
Stj�d�}|r�|jj|j
jjh}t����D] }|r�|j|vr�dS|j}q�q�~tj�d�}|�r|���rdSt���s&dSdS)a/
    Return the interactive framework whose event loop is currently running, if
    any, or "headless" if no event loop can be started, or None.

    Returns
    -------
    Optional[str]
        One of the following values: "qt", "gtk3", "gtk4", "wx", "tk",
        "macosx", "headless", ``None``.
    zPyQt6.QtWidgetszPySide6.QtWidgetszPyQt5.QtWidgetszPySide2.QtWidgetsZqtzgi.repository.Gtk�r)�GLibZgtk4�Zgtk3�wx�tkinterZtkzmatplotlib.backends._macosx�macosx�headlessN)�sys�modules�getZQApplication�instanceZ
MAJOR_VERSIONZ
gi.repositoryrZ
main_depthZ
main_levelZGetAppZmainloop�__code__ZMisc�_current_frames�values�f_code�f_backZevent_loop_is_runningrZdisplay_is_valid)Z	QtWidgetsZGtkrr	r
�codes�framer�r�:/usr/local/lib/python3.9/dist-packages/matplotlib/cbook.py�"_get_running_interactive_framework#sF
�
�
�



rcCst�dvr|�nt��dS)N)rN)r�	traceback�	print_exc)�excrrr�_exception_printerUs
rc@s0eZdZdZdd�Zdd�Zdd�Zdd	�Zd
S)�
_StrongRefzU
    Wrapper similar to a weakref, but keeping a strong reference to the object.
    cCs
||_dS�N��_obj)�self�objrrr�__init__asz_StrongRef.__init__cCs|jSr r!�r#rrr�__call__dsz_StrongRef.__call__cCst|t�o|j|jkSr )�
isinstancerr")r#�otherrrr�__eq__gsz_StrongRef.__eq__cCs
t|j�Sr )�hashr"r&rrr�__hash__jsz_StrongRef.__hash__N)�__name__�
__module__�__qualname__�__doc__r%r'r*r,rrrrr\s
rcCs.zt�||�WSty(t|�YS0dS)zQ
    Return a `WeakMethod` wrapping *func* if possible, else a `_StrongRef`.
    N)�weakref�
WeakMethod�	TypeErrorr)�func�callbackrrr�_weak_or_strong_refnsr6c@sveZdZdZefdd�dd�Zdd�Zdd	�Zd
d�Zdd
�Z	e
jd�dd�Zdd�Z
dd�Zejdd�dd��ZdS)�CallbackRegistrya�
    Handle registering, processing, blocking, and disconnecting
    for a set of signals and callbacks:

        >>> def oneat(x):
        ...     print('eat', x)
        >>> def ondrink(x):
        ...     print('drink', x)

        >>> from matplotlib.cbook import CallbackRegistry
        >>> callbacks = CallbackRegistry()

        >>> id_eat = callbacks.connect('eat', oneat)
        >>> id_drink = callbacks.connect('drink', ondrink)

        >>> callbacks.process('drink', 123)
        drink 123
        >>> callbacks.process('eat', 456)
        eat 456
        >>> callbacks.process('be merry', 456)   # nothing will be called

        >>> callbacks.disconnect(id_eat)
        >>> callbacks.process('eat', 456)        # nothing will be called

        >>> with callbacks.blocked(signal='drink'):
        ...     callbacks.process('drink', 123)  # nothing will be called
        >>> callbacks.process('drink', 123)
        drink 123

    In practice, one should always disconnect all callbacks when they are
    no longer needed to avoid dangling references (and thus memory leaks).
    However, real code in Matplotlib rarely does so, and due to its design,
    it is rather difficult to place this kind of code.  To get around this,
    and prevent this class of memory leaks, we instead store weak references
    to bound methods only, so when the destination object needs to die, the
    CallbackRegistry won't keep it alive.

    Parameters
    ----------
    exception_handler : callable, optional
       If not None, *exception_handler* must be a function that takes an
       `Exception` as single parameter.  It gets called with any `Exception`
       raised by the callbacks during `CallbackRegistry.process`, and may
       either re-raise the exception or handle it in another manner.

       The default handler prints the exception (with `traceback.print_exc`) if
       an interactive event loop is running; it re-raises the exception if no
       interactive event loop is running.

    signals : list, optional
        If not None, *signals* is a list of signals that this registry handles:
        attempting to `process` or to `connect` to a signal not in the list
        throws a `ValueError`.  The default, None, does not restrict the
        handled signals.
    N)�signalscCs>|durdnt|�|_||_i|_t��|_i|_t�|_	dSr )
�list�_signals�exception_handler�	callbacks�	itertools�count�_cid_gen�
_func_cid_map�set�
_pickled_cids)r#r;r8rrrr%�s
zCallbackRegistry.__init__cs2it����fdd��j��D�dt�j�d��S)Ncs(i|] \}}|�fdd�|��D��qS)cs"i|]\}}|�jvr||��qSr)rB��.0�cid�proxyr&rr�
<dictcomp>�s
�z<CallbackRegistry.__getstate__.<locals>.<dictcomp>.<dictcomp>��items�rD�s�dr&rrrG�s�z1CallbackRegistry.__getstate__.<locals>.<dictcomp>)r<r@r?)�varsr<rI�nextr?r&rr&r�__getstate__�s�
��zCallbackRegistry.__getstate__csX|�d�}t���|��fdd��j��D��_dd��j��D��_t�|��_dS)Nr?cs(i|] \}}|�fdd�|��D��qS)csi|]\}}|t|�j��qSr)r6�
_remove_proxy)rDrEr4r&rrrG�s��<CallbackRegistry.__setstate__.<locals>.<dictcomp>.<dictcomp>rHrJr&rrrG�s��z1CallbackRegistry.__setstate__.<locals>.<dictcomp>cSs$i|]\}}|dd�|��D��qS)cSsi|]\}}||�qSrrrCrrrrG��rQrHrJrrrrG�s�)	�poprM�updater<rIr@r=r>r?)r#�stateZ	cid_countrr&r�__setstate__�s

��zCallbackRegistry.__setstate__cCs�|jdurtj|j|d�|j�|i�t||j�}||j|vrP|j||St|j�}||j||<|j	�|i�||j	||<|S)z?Register *func* to be called when signal *signal* is generated.N��signal)
r:r�
check_in_listr@�
setdefaultr6rPrNr?r<)r#rXr4rFrErrr�connect�s

zCallbackRegistry.connectcCs|�||�}|j�|�|S)z{
        Like `.connect`, but the callback is kept when pickling/unpickling.

        Currently internal-use only.
        )r[rB�add)r#rXr4rErrr�_connect_picklable�sz#CallbackRegistry._connect_picklable)�_is_finalizingcCs||�r
dSt|j���D]8\}}|�|d�}|dur|j||=|j�|�qVqdSt|j|�dkrx|j|=|j|=dS)Nr)r9r@rIrSr<rB�discard�len)r#rFr^rX�proxy_to_cidrErrrrP�szCallbackRegistry._remove_proxycCs�|j�|�t|j���D] \}}|�|d�}|durq@qdS|j|}t|���D]"\}}||krV||usrJ�||=qVt|j|�dkr�|j|=|j|=dS)z�
        Disconnect the callback registered with callback id *cid*.

        No error is raised if such a callback does not exist.
        Nr)rBr_r9r<rIrSr@r`)r#rErXZcid_to_proxyrFraZ
current_proxyZcurrent_cidrrr�
disconnects
zCallbackRegistry.disconnectcOs�|jdurtj|j|d�t|j�|i����D]b}|�}|dur0z||i|��Wq0ty�}z$|jdurz|�|�n�WYd}~q0d}~00q0dS)z�
        Process signal *s*.

        All of the functions registered to receive callbacks on *s* will be
        called with ``*args`` and ``**kwargs``.
        NrW)	r:rrYr9r<rr�	Exceptionr;)r#rK�args�kwargs�refr4rrrr�processs

zCallbackRegistry.processrWc#sJ|j�z6�duri|_n��fdd��D�|_dVW�|_n�|_0dS)aV
        Block callback signals from being processed.

        A context manager to temporarily block/disable callback signals
        from being processed by the registered listeners.

        Parameters
        ----------
        signal : str, optional
            The callback signal to block. The default is to block all signals.
        Ncsi|]}|�kr|�|�qSrr�rD�k��origrXrrrGGrRz,CallbackRegistry.blocked.<locals>.<dictcomp>)r<)r#rXrrjr�blocked3s
zCallbackRegistry.blocked)r-r.r/r0rr%rOrVr[r]r
�
is_finalizingrPrbrg�
contextlib�contextmanagerrlrrrrr7xs<	
r7c@s"eZdZdZddd�Zdd�ZdS)�silent_lista
    A list with a short ``repr()``.

    This is meant to be used for a homogeneous list of artists, so that they
    don't cause long, meaningless output.

    Instead of ::

        [<matplotlib.lines.Line2D object at 0x7f5749fed3c8>,
         <matplotlib.lines.Line2D object at 0x7f5749fed4e0>,
         <matplotlib.lines.Line2D object at 0x7f5758016550>]

    one will get ::

        <a list of 3 Line2D objects>

    If ``self.type`` is None, the type name is obtained from the first item in
    the list (if any).
    NcCs||_|dur|�|�dSr )�type�extend)r#rq�seqrrrr%bszsilent_list.__init__cCsR|jdust|�dkrJ|jdur&|jnt|d�j}dt|��d|�d�SdSdS)Nrz<a list of � z	 objects>z<an empty list>)rqr`r-)r#�tprrr�__repr__gszsilent_list.__repr__)N)r-r.r/r0r%rvrrrrrpMs
rp)�warning_clscGsH|}|D]:}|�|d�}|dur|dur.|}qt�d|�d�|�q|S)N�"z"" keyword argument will be ignored)rSrZ
warn_external)Z	local_varrerw�keys�out�keyZ	kwarg_valrrr�_local_over_kwdictos�r|cCsVt|�dkrR|d|dkr(dkrRnn&|dd�}dD]\}}|�||�}q<|S)zi
    Remove latex formatting from mathtext.

    Only handles fully math and fully non-math strings.
    �r����$�)	)z\times�x)z\mathdefault�)z\rmr�)z\calr�)z\ttr�)z\itr�)�\r�)�{r�)�}r�)r`�replace)rKZtex�plainrrr�
strip_math~s
,r�cCs�d}|�d|�}|�d|�}|dkrD|dkr0|n
|d|�}|��Sd|krX|krlnn|d|���S|�d|d�}|dkr�td|�d���|d}qdS)z+Strip everything from the first unquoted #.rrx�#Nr�zMissing closing quote in: zM. If you need a double-quote inside a string, use escaping: e.g. "the " char")�find�strip�
ValueError)rK�posZ	quote_posZhash_posZwithout_commentZclosing_quote_posrrr�_strip_comment�s
�r�cCstt|dd��S)zDReturn whether *obj* looks like a file object with a *write* method.�writeN)�callable�getattr�r$rrr�is_writable_file_like�sr�cCs,z|�d�Wnty"YdS0dSdS)zf
    Return whether the given writable file-like object requires Unicode to be
    written to it.
    rRTFN)r�r3�r�rrr�file_requires_unicode�s
r��rFcCs�t|tj�rt�|�}t|t�rl|�d�r8t�||�}n.|�d�rXddl}|�	||�}nt|||d�}d}nt
|d�r�|}d}ntd	��|r�||fS|S)
a^
    Convert a path to an open file handle or pass-through a file-like object.

    Consider using `open_file_cm` instead, as it allows one to properly close
    newly created file objects more easily.

    Parameters
    ----------
    fname : str or path-like or file-like
        If `str` or `os.PathLike`, the file is opened using the flags specified
        by *flag* and *encoding*.  If a file-like object, it is passed through.
    flag : str, default: 'r'
        Passed as the *mode* argument to `open` when *fname* is `str` or
        `os.PathLike`; ignored if *fname* is file-like.
    return_opened : bool, default: False
        If True, return both the file object and a boolean indicating whether
        this was a new file (that the caller needs to close).  If False, return
        only the new file.
    encoding : str or None, default: None
        Passed as the *mode* argument to `open` when *fname* is `str` or
        `os.PathLike`; ignored if *fname* is file-like.

    Returns
    -------
    fh : file-like
    opened : bool
        *opened* is only returned if *return_opened* is True.
    �.gzz.bz2rN)�encodingT�seekFz'fname must be a PathLike or file handle)r(�os�PathLike�fspath�str�endswith�gzip�open�bz2�BZ2File�hasattrr�)�fname�flagZ
return_openedr��fhr��openedrrr�
to_filehandle�s"




r�cCs$t||d|�\}}|r|St�|�S)z8Pass through file objects and context-manage path-likes.T)r�rn�nullcontext)Zpath_or_file�moder�r�r�rrr�open_file_cm�sr�cCst|t�pt�|�S)z;Return whether the given object is a scalar or string like.)r(r��np�iterable��valrrr�is_scalar_or_string�sr��3.8�np_loadz+open(get_sample_data(..., asfileobj=False))��alternativeT)r�cCsvtd|�}|rj|j��}|dkr*t�|�S|dvrL|r@t�|�S|�d�Sqr|dvr^|�d�S|�d�Snt|�SdS)a�
    Return a sample data file.  *fname* is a path relative to the
    :file:`mpl-data/sample_data` directory.  If *asfileobj* is `True`
    return a file object, otherwise just a file path.

    Sample data files are stored in the 'mpl-data/sample_data' directory within
    the Matplotlib package.

    If the filename ends in .gz, the file is implicitly ungzipped.  If the
    filename ends with .npy or .npz, and *asfileobj* is `True`, the file is
    loaded with `numpy.load`.
    Zsample_datar�)z.npyz.npz�rb)z.csvz.xrcz.txtr�N)�_get_data_path�suffix�lowerr�r�r��loadr�)r�Z	asfileobjr��pathr�rrr�get_sample_data�s




r�cGstt��g|�R�S)z�
    Return the `pathlib.Path` to a resource file provided by Matplotlib.

    ``*args`` specify a path relative to the base data path.
    )r�
matplotlibZ
get_data_path)rdrrrr�sr�ccs6|D],}||�s|dur |Vqt||�EdHqdS)a�
    Return a generator of flattened nested containers.

    For example:

        >>> from matplotlib.cbook import flatten
        >>> l = (('John', ['Hunter']), (1, 23), [[([42, (5, 23)], )]])
        >>> print(list(flatten(l)))
        ['John', 'Hunter', 1, 23, 42, 5, 23]

    By: Composite of Holger Krekel and Luther Blissett
    From: https://code.activestate.com/recipes/121294/
    and Recipe 1.12 in cookbook
    N)�flatten)rsZscalarp�itemrrrr�$sr�c@sreZdZdZddd�Zdd�Zdd�Zd	d
�Zdd�Zd
d�Z	dd�Z
dd�Zdd�Zdd�Z
dd�Zdd�ZdS)�Stack�b
    Stack of elements with a movable cursor.

    Mimics home/back/forward in a web browser.
    NcCs|��||_dSr )�clear�_default)r#�defaultrrrr%BszStack.__init__cCs|js|jS|j|jSdS�z$Return the current element, or None.N)�	_elementsr��_posr&rrrr'FszStack.__call__cCs
t|j�Sr �r`r�r&rrr�__len__Msz
Stack.__len__cCs
|j|Sr �r��r#�indrrr�__getitem__PszStack.__getitem__cCs"t|jdt|j�d�|_|�S�z9Move the position forward and return the current element.r���minr�r`r�r&rrr�forwardSsz
Stack.forwardcCs|jdkr|jd8_|�S)�6Move the position back and return the current element.rr�)r�r&rrr�backXs
z
Stack.backcCs2|jd|jd�|g|_t|j�d|_|�S)zs
        Push *o* to the stack at current position.  Discard all later elements.

        *o* is returned.
        Nr��r�r�r`�r#�orrr�push^sz
Stack.pushcCs |js
dS|�|jd�|�S)�k
        Push the first element onto the top of the stack.

        The first element is returned.
        Nr�r�r�r&rrr�homehsz
Stack.homecCst|j�dkS)z"Return whether the stack is empty.rr�r&rrr�emptysszStack.emptycCsd|_g|_dS�zEmpty the stack.r~N�r�r�r&rrrr�wszStack.clearcCsh||jvrtd��|j��}|��g}|D]"}||krD|�|�q,|�|�q,|D]}|�|�qT|S)z�
        Raise all references of *o* to the top of the stack, and return it.

        Raises
        ------
        ValueError
            If *o* is not in the stack.
        �(Given element not contained in the stack)r�r��copyr��appendr�)r#r��old_elementsZtop_elements�elem�_rrr�bubble|s	

zStack.bubblecCsD||jvrtd��|j��}|��|D]}||kr(|�|�q(dS)z�
        Remove *o* from the stack.

        Raises
        ------
        ValueError
            If *o* is not in the stack.
        r�N)r�r�r�r�r�)r#r�r�r�rrr�remove�s	

zStack.remove)N)r-r.r/r0r%r'r�r�r�r�r�r�r�r�r�r�rrrrr�:s

r�c@sXeZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�Zdd
�Z	dd�Z
dd�Zdd�ZdS)�_Stackr�cCsd|_g|_dS)Nr~r�r&rrrr%�sz_Stack.__init__cCsd|_g|_dSr�r�r&rrrr��sz_Stack.clearcCs|jr|j|jSdSr�)r�r�r&rrrr'�sz_Stack.__call__cCs
t|j�Sr r�r&rrrr��sz_Stack.__len__cCs
|j|Sr r�r�rrrr��sz_Stack.__getitem__cCs"t|jdt|j�d�|_|�Sr�r�r&rrrr��sz_Stack.forwardcCst|jdd�|_|�S)r�r�r)�maxr�r&rrrr��sz_Stack.backcCs*|g|j|jdd�<t|j�d|_|S)zx
        Push *o* to the stack after the current position, and return *o*.

        Discard all later elements.
        r�Nr�r�rrrr��sz_Stack.pushcCs|jr|�|jd�SdS)r�rNr�r&rrrr��sz_Stack.homeN)
r-r.r/r0r%r�r'r�r�r�r�r�r�rrrrr��s
r�cCsltj|d|d�}|jjs2|j|d��|j�d��}ztjjt�	|�|dd�}Wnt
yf|YS0|S)NT)Zsubokr�)Zinplace�NF)r�)r��array�dtypeZisnative�byteswap�viewZnewbyteorder�maZmasked_where�isfiniter3)r�r�Zxmrrr�safe_masked_invalid�s
r�csXddl��fdd��������fdd���D]$}��d|�d���||ig�q.dS)	a�
    Print loops of cyclic references in the given *objects*.

    It is often useful to pass in ``gc.garbage`` to find the cycles that are
    preventing some objects from being garbage collected.

    Parameters
    ----------
    objects
        A list of objects to find cycles in.
    outstream
        The stream for output.
    show_progress : bool
        If True, print the number of objects reached as they are found.
    rNcs�t|�D]�\}}||dt|�}��dt|��t|t�r�|��D]B\}}||urn��d|�d��q�||urH��d|���q�qHnDt|t�r���d|�|��n$t|t	�rĈ�d�n��t
|����d�q��d	�dS)
Nr�z	   %s -- �[�]z[key] = z[%d]z	( tuple )z ->
�
)�	enumerater`r�rqr(�dictrIr9�index�tuple�repr)r��i�steprNr{r�)�	outstreamrr�
print_path�s$


z print_cycles.<locals>.print_pathcs��r��dt|��d|t|�<��|�}|D]N}||urF�|�q0|�us0t|tj�r^q0q0t|�|vr0�|||||g�q0dS)Nz%d
)r�r`�idZ
get_referentsr(�types�	FrameType)r$�start�all�current_pathZ	referentsZreferent��gc�objectsr�r��recurse�
show_progressrrrs

zprint_cycles.<locals>.recursezExamining: r�)rr�)rr�rr$rrr�print_cycles�src@speZdZdZddd�Zdd�Zdd�Zd	d
�Zej	ddd
�dd��Z
dd�Zdd�Zdd�Z
dd�Zdd�ZdS)�Groupera#
    A disjoint-set data structure.

    Objects can be joined using :meth:`join`, tested for connectedness
    using :meth:`joined`, and all disjoint sets can be retrieved by
    using the object as an iterator.

    The objects being joined must be hashable and weak-referenceable.

    Examples
    --------
    >>> from matplotlib.cbook import Grouper
    >>> class Foo:
    ...     def __init__(self, s):
    ...         self.s = s
    ...     def __repr__(self):
    ...         return self.s
    ...
    >>> a, b, c, d, e, f = [Foo(x) for x in 'abcdef']
    >>> grp = Grouper()
    >>> grp.join(a, b)
    >>> grp.join(b, c)
    >>> grp.join(d, e)
    >>> list(grp)
    [[a, b, c], [d, e]]
    >>> grp.joined(a, b)
    True
    >>> grp.joined(a, c)
    True
    >>> grp.joined(a, d)
    False
    rcCsTt�dd�|D��|_t��|_|D]}||jvr$t|j�|j|<q$t|j�|_dS)NcSsi|]}|t�|g��qSr�r1�WeakSet�rDr�rrrrGSrRz$Grouper.__init__.<locals>.<dictcomp>)r1�WeakKeyDictionary�_mapping�	_orderingr`�_next_order)r#�initr�rrrr%Qs�

zGrouper.__init__cCs,it|��dd�|j��D�i|j�d��S)NcSsi|]\}}|t|��qSr)rA�rDri�vrrrrG^rRz(Grouper.__getstate__.<locals>.<dictcomp>)rr
)rMrrIr
r&rrrrOZs��zGrouper.__getstate__cCs<t|��|�t�dd�|j��D��|_t�|j�|_dS)NcSsi|]\}}|t�|��qSrrrrrrrGfrRz(Grouper.__setstate__.<locals>.<dictcomp>)rMrTr1rrrIr
)r#rUrrrrVbs
�zGrouper.__setstate__cCs
||jvSr )r�r#r�rrr�__contains__iszGrouper.__contains__r�z+none, you no longer need to clean a Grouperr�cCsdS)z/Clean dead weak references from the dictionary.Nrr&rrr�cleanlsz
Grouper.cleanc	Gs�|j}z||}Wn@tyRt�|g�}||<|j|j|<|jd7_Yn0|D]�}z||}Wn@ty�t�|g�}||<|j|j|<|jd7_Yn0||urXt|�t|�kr�||}}|�|�|D]}|||<q�qXdS)zY
        Join given arguments into the same set.  Accepts one or more arguments.
        r�N)r�KeyErrorr1r	rr
r`rT)r#�ard�mappingZset_a�argZset_br�rrr�joinps(

zGrouper.joincCs|j�|t��|j�|�uS)z7Return whether *a* and *b* are members of the same set.)rr�object�r#r�brrr�joined�szGrouper.joinedcCs(|j�||h��|�|j�|d�dS)z>Remove *a* from the grouper, doing nothing if it is not there.N)rrSr�r
�r#rrrrr��szGrouper.removeccs8dd�|j��D�}|��D]}t||jjd�VqdS)z�
        Iterate over each of the disjoint sets as a list.

        The iterator is invalid if interleaved with calls to join().
        cSsi|]}t|�|�qSr)r�)rD�grouprrrrG�rRz$Grouper.__iter__.<locals>.<dictcomp>�r{N)rr�sortedr
r�)r#Z
unique_groupsrrrr�__iter__�szGrouper.__iter__cCs |j�||g�}t||jjd�S)z:Return all of the items joined with *a*, including itself.r )rrr!r
)r#rZsiblingsrrr�get_siblings�szGrouper.get_siblingsN)r)r-r.r/r0r%rOrVrr�
deprecatedrrrr�r"r#rrrrr/s!
	

rc@s8eZdZdZdd�Zdd�Zdd�Zdd	�Zd
d�ZdS)
�GrouperViewz!Immutable view over a `.Grouper`.cCs
||_dSr ��_grouper)r#Zgrouperrrrr%�rRzGrouperView.__init__cCs
||jvSr r&rrrrr�rRzGrouperView.__contains__cCs
t|j�Sr )�iterr'r&rrrr"�rRzGrouperView.__iter__cCs|j�||�Sr )r'rrrrrr�rRzGrouperView.joinedcCs|j�|�Sr )r'r#rrrrr#�rRzGrouperView.get_siblingsN)	r-r.r/r0r%rr"rr#rrrrr%�sr%cst|�t|�df�}t�t|��|�t�t|�d|d��t���fdd�|jD���t��f|jdd��S)a}
    Resample an array with ``steps - 1`` points between original point pairs.

    Along each column of *a*, ``(steps - 1)`` points are introduced between
    each original values; the values are linearly interpolated.

    Parameters
    ----------
    a : array, shape (n, ...)
    steps : int

    Returns
    -------
    array
        shape ``((n - 1) * steps + 1, ...)``
    r~r�csg|]}t���|��qSr)r�Zinterp)rD�fp�r�Zxprr�
<listcomp>�rRz/simple_linear_interpolation.<locals>.<listcomp>N)�reshaper`r��arangeZcolumn_stack�T�shape)r�stepsZfpsrr*r�simple_linear_interpolation�s�r1c
	Gs�t|�sdSt|d�r td��t|d�}g}dgt|�}t|�D]f\}}t|t�s�t�|�r�t|�|kr�d||<t|tjj	�r�|j
dkr�td��n
t�|�}|�|�qFg}t|�D]�\}}||r�|j
dkr�q�t|tjj	��r|�tj�
|��|j}n|}z&t�|�}t|tj��r*|�|�Wq�t�y@Yq�0q�t|��r�tj�|�}|��d}	t|	�|k�r�t|�D] \}}||�r|||	||<�q|t|�D]0\}}||�r�t|tjj	��r�|��||<�q�|S)ak
    Find all masked and/or non-finite points in a set of arguments,
    and return the arguments with only the unmasked points remaining.

    Arguments can be in any of 5 categories:

    1) 1-D masked arrays
    2) 1-D ndarrays
    3) ndarrays with more than one dimension
    4) other non-string iterables
    5) anything else

    The first argument must be in one of the first four categories;
    any argument with a length differing from that of the first
    argument (and hence anything in category 5) then will be
    passed through unchanged.

    Masks are obtained from all arguments of the correct length
    in categories 1, 2, and 4; a point is bad if masked in a masked
    array or if it is a nan or inf.  No attempt is made to
    extract a mask from categories 2, 3, and 4 if `numpy.isfinite`
    does not yield a Boolean array.

    All input arguments that are not passed unchanged are returned
    as ndarrays after removing the points or rows corresponding to
    masks in any of the arguments.

    A vastly simpler version of this function was originally
    written as a helper for Axes.scatter().

    rr�!First argument must be a sequenceFTr��Masked arrays must be 1-D)r`r�r�r�r(r�r�r�r��MaskedArray�ndim�asarrayr��getmaskarray�datar��ndarrayrc�logical_and�reduce�nonzero�filled)
rd�nrecs�margs�seqlistr�r��masksZxd�maskZigoodrrr�delete_masked_points�sR  






rCc
GsVt|�sdSt|d�r td��t|d�}g}dgt|�}g}t|�D]�\}}t|�sft|�|krr|�|�qJt|tjj�r�|j	dkr�td��zt�
|�}Wn$ttfy�tj
|td�}Yn0|j	dkr�t
|�}d||<tj�|�r�|�tj�|��|�|�qJt|��rRtj�|�}t|�D](\}}||�r(tjj||d	�||<�q(|S)
ax
    Find all masked and/or non-finite points in a set of arguments,
    and return the arguments as masked arrays with a common mask.

    Arguments can be in any of 5 categories:

    1) 1-D masked arrays
    2) 1-D ndarrays
    3) ndarrays with more than one dimension
    4) other non-string iterables
    5) anything else

    The first argument must be in one of the first four categories;
    any argument with a length differing from that of the first
    argument (and hence anything in category 5) then will be
    passed through unchanged.

    Masks are obtained from all arguments of the correct length
    in categories 1, 2, and 4; a point is bad if masked in a masked
    array or if it is a nan or inf.  No attempt is made to
    extract a mask from categories 2 and 4 if `numpy.isfinite`
    does not yield a Boolean array.  Category 3 is included to
    support RGB or RGBA ndarrays, which are assumed to have only
    valid values and which are passed through unchanged.

    All input arguments that are not passed unchanged are returned
    as masked arrays if any masked points are found, otherwise as
    ndarrays.

    rrr2Fr�r3�r�T�rB)r`r�r�r�r�r(r�r�r4r5�
asanyarrayrrr�Z	is_maskedr7�
logical_orr;r�)rdr>r?r@rAr�r�rBrrr�_combine_maskss:


rH)�compresscs�dd�|D�}tjg|�|�R�}|dt|��}|t|�d�}|r~tj�|��|rj�fdd�|D�}q��fdd�|D�}ndd�|D�}|S)aw
    Broadcast inputs, combining all masked arrays.

    Parameters
    ----------
    *args : array-like
        The inputs to broadcast.
    compress : bool, default: False
        Whether to compress the masked arrays. If False, the masked values
        are replaced by NaNs.

    Returns
    -------
    list of array-like
        The broadcasted and masked inputs.
    cSs g|]}t|tjj�r|j�qSr)r(r�r�r4rBrhrrrr+drRz)_broadcast_with_masks.<locals>.<listcomp>Ncs g|]}tjj|�d����qS)rE)r�r�r��
compressedrhrErrr+ns�cs*g|]"}tjj|�td��tj����qS))rBr�)r�r�r��floatr=�nan�ravelrhrErrr+qs�cSsg|]}t�|��qSr)r�rMrhrrrr+trR)r�Zbroadcast_arraysr`rGr;)rIrdrAZbcast�inputsrrEr�_broadcast_with_masksRs
�
�rO��?cs�ddd���fdd�}g}t|d�}t|�}|dur@t�d�}nt|�|krTtd��|}tt||��D�]T\}	\}
}i}|dur�||d	<|}|�|�t|
�d
k�rt�	g�|d<tj
|d<tj
|d
<tj
|d<tj
|d<tj
|d<tj
|d<tj
|d<tj
|d<tj
|d<qftj�|
�}
|
j
|
j��}
t�|
�|d<t�|
gd��\}
}}||
|d<|dd
k�rt|�rtd}||
||d|�\|d<|d<t�|��r�t|t��s�t�|
|�\}}n6t�|��r�|
||d}|||d}ntd��|
|
|k}t|�d
k�st�|�|k�r&||d<nt�|�|d<|
|
|k}t|�d
k�s^t�|�|
k�rh|
|d<nt�|�|d<t�|
|
|dk|
|
|dkg�|d<|
|||d<|d
<|d<qf|S)aj
    Return a list of dictionaries of statistics used to draw a series of box
    and whisker plots using `~.Axes.bxp`.

    Parameters
    ----------
    X : array-like
        Data that will be represented in the boxplots. Should have 2 or
        fewer dimensions.

    whis : float or (float, float), default: 1.5
        The position of the whiskers.

        If a float, the lower whisker is at the lowest datum above
        ``Q1 - whis*(Q3-Q1)``, and the upper whisker at the highest datum below
        ``Q3 + whis*(Q3-Q1)``, where Q1 and Q3 are the first and third
        quartiles.  The default value of ``whis = 1.5`` corresponds to Tukey's
        original definition of boxplots.

        If a pair of floats, they indicate the percentiles at which to draw the
        whiskers (e.g., (5, 95)).  In particular, setting this to (0, 100)
        results in whiskers covering the whole range of the data.

        In the edge case where ``Q1 == Q3``, *whis* is automatically set to
        (0, 100) (cover the whole range of the data) if *autorange* is True.

        Beyond the whiskers, data are considered outliers and are plotted as
        individual points.

    bootstrap : int, optional
        Number of times the confidence intervals around the median
        should be bootstrapped (percentile method).

    labels : list of str, optional
        Labels for each dataset. Length must be compatible with
        dimensions of *X*.

    autorange : bool, optional (False)
        When `True` and the data are distributed such that the 25th and 75th
        percentiles are equal, ``whis`` is set to (0, 100) such that the
        whisker ends are at the minimum and maximum of the data.

    Returns
    -------
    list of dict
        A list of dictionaries containing the results for each column
        of data. Keys of each dictionary are the following:

        ========   ===================================
        Key        Value Description
        ========   ===================================
        label      tick label for the boxplot
        mean       arithmetic mean value
        med        50th percentile
        q1         first quartile (25th percentile)
        q3         third quartile (75th percentile)
        iqr        interquartile range
        cilo       lower notch around the median
        cihi       upper notch around the median
        whislo     end of the lower whisker
        whishi     end of the upper whisker
        fliers     outliers
        ========   ===================================

    Notes
    -----
    Non-bootstrapping approach to confidence interval uses Gaussian-based
    asymptotic approximation:

    .. math::

        \mathrm{med} \pm 1.57 \times \frac{\mathrm{iqr}}{\sqrt{N}}

    General approach from:
    McGill, R., Tukey, J.W., and Larsen, W.A. (1978) "Variations of
    Boxplots", The American Statistician, 32:12-16.
    �cSsLt|�}ddg}tjj|||fd�}||}tj|ddd�}t�||�}|S)Ng@g`X@)�sizer�T)�axisZoverwrite_input)r`r��random�randint�median�
percentile)r8r��MZpercentilesZbs_indexZbsDataZestimate�CIrrr�_bootstrap_median�sz(boxplot_stats.<locals>._bootstrap_mediancsb|dur&�||d�}|d}|d}n4t|�}|d|t�|�}|d|t�|�}||fS)N)r�rr�g��Q��?)r`r��sqrt)r8�med�iqr�	bootstraprYZ	notch_minZ	notch_maxr��rZrr�_compute_conf_interval�s
z-boxplot_stats.<locals>._compute_conf_interval�XNz-Dimensions of labels and X must be compatible�labelrZfliers�meanr\�q1�q3r]ZciloZcihiZwhisloZwhishi)��2�K)r�dz+whis must be a float or list of percentiles)rQ)�_reshape_2Dr`r=�repeatr�r��zipr�r�r�rLr�r6r8rBrMrcrWr�r(r�Zisrealr�r��concatenate)raZwhisr^�labelsZ	autoranger`ZbxpstatsZncolsZ
input_whis�iir�rb�statsrdr\reZlovalZhivalZwiskhiZwisklorr_r�
boxplot_statsxstO











�

�
rqZsolidZdashedZdashdotZdotted)�-z--z-.�:cCsi|]\}}||�qSrrrrrrrGDrRrGcCs�tj|td�}|jsgSt�|dd�|dd�k�\}|d7}|��}|drZdg|}|drp|�t|��tt	|ddd�|ddd���S)zv
    Return a list of (ind0, ind1) such that ``mask[ind0:ind1].all()`` is
    True and we cover all such regions.
    rDNr~r�rr})
r�r6�boolrRr<�tolistr�r`r9rl)rB�idxrrr�contiguous_regionsGs 
rwcCs4t|�}|�d�|�d�}|dko.|ddk}|S)z�
    Return whether the string *s* contains math expressions.

    This is done by checking whether *s* contains an even number of
    non-escaped dollar signs.
    rz\$rr})r�r>)rKZdollar_countZeven_dollarsrrr�is_math_textasrxcCs0t|d�r tj�|t��tj�St�|t�SdS)zt
    Convert a sequence to a float array; if input was a masked array, masked
    values are converted to nans.
    rBN)r�r�r�r6rKr=rLr�rrr�_to_unmasked_float_arrayns
rycCs<t|�}t|d�r*t|d�r*t|j�dkr4t�|�S|SdS)z8Convert scalars to 1D arrays; pass-through arrays as is.r/r5r�N)�_unpack_to_numpyr�r`r/r��
atleast_1dr�rrr�	_check_1dys
��
r|c	Cst|�}t|tj�rt|j}t|�dkr,ggS|jdkrNt�|d�dkrN|gS|jdvrfdd�|D�St|�d���t|�dkr�ggSg}d}|D]l}t|t�s�zt	|�Wnt
y�Yn0d}t�|�}t�|�}|dkr�t|�d���|�|�
d	��q�|�rt�
|d	�gS|Sd
S)a�
    Use Fortran ordering to convert ndarrays and lists of iterables to lists of
    1D arrays.

    Lists of iterables are converted by applying `numpy.asanyarray` to each of
    their elements.  1D ndarrays are returned in a singleton list containing
    them.  2D ndarrays are converted to the list of their *columns*.

    *name* is used to generate the error message for invalid inputs.
    rr�)r�r}cSsg|]}t�|d��qS)r~)r�r,r
rrrr+�rRz_reshape_2D.<locals>.<listcomp>z  must have 2 or fewer dimensionsTFr~N)rzr(r�r9r.r`r5r�r�r(r3rFr�r,)ra�name�resultZis_1d�xiZndrrrrj�s:




rjricCs�g}t|d�}|dur.t|�dkr.t|d�}nggt|�}t|�t|�krTtd��t||�D]�\}}i}t�|�}t�|�}	t�|d|�}
t�||	|�}|||�|d<||d<t�	|�|d	<t�
|�|d
<||d<|	|d<t�|
�|d<|�|�q^|S)
a[
    Return a list of dictionaries of data which can be used to draw a series
    of violin plots.

    See the ``Returns`` section below to view the required keys of the
    dictionary.

    Users can skip this function and pass a user-defined set of dictionaries
    with the same keys to `~.axes.Axes.violinplot` instead of using Matplotlib
    to do the calculations. See the *Returns* section below for the keys
    that must be present in the dictionaries.

    Parameters
    ----------
    X : array-like
        Sample data that will be used to produce the gaussian kernel density
        estimates. Must have 2 or fewer dimensions.

    method : callable
        The method used to calculate the kernel density estimate for each
        column of data. When called via ``method(v, coords)``, it should
        return a vector of the values of the KDE evaluated at the values
        specified in coords.

    points : int, default: 100
        Defines the number of points to evaluate each of the gaussian kernel
        density estimates at.

    quantiles : array-like, default: None
        Defines (if not None) a list of floats in interval [0, 1] for each
        column of data, which represents the quantiles that will be rendered
        for that column of data. Must have 2 or fewer dimensions. 1D array will
        be treated as a singleton list containing them.

    Returns
    -------
    list of dict
        A list of dictionaries containing the results for each column of data.
        The dictionaries contain at least the following:

        - coords: A list of scalars containing the coordinates this particular
          kernel density estimate was evaluated at.
        - vals: A list of scalars containing the values of the kernel density
          estimate at each of the coordinates given in *coords*.
        - mean: The mean value for this column of data.
        - median: The median value for this column of data.
        - min: The minimum value for this column of data.
        - max: The maximum value for this column of data.
        - quantiles: The quantile values for this column of data.
    raNr�	quantileszLList of violinplot statistics and quantiles values must have the same lengthri�vals�coordsrcrVr�r�)
rjr`r�rlr�r�r�rWZlinspacercrVr{r�)ra�methodZpointsr�Zvpstatsr��qrpZmin_valZmax_valZquantile_valr�rrr�violin_stats�s,5


r�cGs�t�dt|�tdt|�dd�f�}||dddd�f<|dddd�f|dddd�f<||dd�ddd�f<|dd�ddd�f|dd�ddd�f<|S)a(
    Convert continuous line to pre-steps.

    Given a set of ``N`` points, convert to ``2N - 1`` points, which when
    connected linearly give a step function which changes values at the
    beginning of the intervals.

    Parameters
    ----------
    x : array
        The x location of the steps. May be empty.

    y1, ..., yp : array
        y arrays to be turned into steps; all must be the same length as ``x``.

    Returns
    -------
    array
        The x and y values converted to steps in the same order as the input;
        can be unpacked as ``x_out, y1_out, ..., yp_out``.  If the input is
        length ``N``, each of these arrays will be length ``2N + 1``. For
        ``N=0``, the length will be 0.

    Examples
    --------
    >>> x_s, y1_s, y2_s = pts_to_prestep(x, y1, y2)
    r�r}rN����r��zerosr`r��r�rdr0rrr�pts_to_prestep&s( (r�cGs�t�dt|�tdt|�dd�f�}||dddd�f<|dddd�f|dddd�f<||dd�ddd�f<|dd�ddd�f|dd�ddd�f<|S)a#
    Convert continuous line to post-steps.

    Given a set of ``N`` points convert to ``2N + 1`` points, which when
    connected linearly give a step function which changes values at the end of
    the intervals.

    Parameters
    ----------
    x : array
        The x location of the steps. May be empty.

    y1, ..., yp : array
        y arrays to be turned into steps; all must be the same length as ``x``.

    Returns
    -------
    array
        The x and y values converted to steps in the same order as the input;
        can be unpacked as ``x_out, y1_out, ..., yp_out``.  If the input is
        length ``N``, each of these arrays will be length ``2N + 1``. For
        ``N=0``, the length will be 0.

    Examples
    --------
    >>> x_s, y1_s, y2_s = pts_to_poststep(x, y1, y2)
    r�r}rNr�r�r�rrr�pts_to_poststepLs( (r�cGs�t�dt|�dt|�f�}t�|�}|dd�|dd�d|dddd�f<|dddd�f<|dd�|ddd�f<|dd�|ddd�f<||dd�ddd�f<|dd�ddd�f|dd�ddd�f<|S)a�
    Convert continuous line to mid-steps.

    Given a set of ``N`` points convert to ``2N`` points which when connected
    linearly give a step function which changes values at the middle of the
    intervals.

    Parameters
    ----------
    x : array
        The x location of the steps. May be empty.

    y1, ..., yp : array
        y arrays to be turned into steps; all must be the same length as
        ``x``.

    Returns
    -------
    array
        The x and y values converted to steps in the same order as the input;
        can be unpacked as ``x_out, y1_out, ..., yp_out``.  If the input is
        length ``N``, each of these arrays will be length ``2N``.

    Examples
    --------
    >>> x_s, y1_s, y2_s = pts_to_midstep(x, y1, y2)
    r�r}Nr~r)r�r�r`rFr�rrr�pts_to_midstepps
<(r�cCs||fSr r)r��yrrr�<lambda>�rRr�)r�r0z	steps-prez
steps-postz	steps-midc	Cspz|j��|��fWSty&Yn0zt|�}WnttfyJYn0tj|jdt	d�|fStd��dS)a�
    A helper function to create reasonable x values for the given *y*.

    This is used for plotting (x, y) if x values are not explicitly given.

    First try ``y.index`` (assuming *y* is a `pandas.Series`), if that
    fails, use ``range(len(y))``.

    This will be extended in the future to deal with more types of
    labeled data.

    Parameters
    ----------
    y : float or array-like

    Returns
    -------
    x, y : ndarray
       The x and y values to plot.
    rrDz5Input could not be cast to an at-least-1D NumPy arrayN)
r��to_numpy�AttributeErrorr|rr�r�r-r/rK)r�rrr�index_of�sr�cCs@t|tjj�r4z
|dWSty*Yn0td��tt|��S)z�
    Return the first element in *obj*.

    This is a type-independent way of obtaining the first element,
    supporting both index access and the iterator protocol.
    r�/matplotlib does not support generators as input)r(�collections�abc�Iteratorr3�RuntimeErrorrNr(r�rrr�safe_first_element�s
r�cCsZdd�}t|tj�r|dSt|tjj�r4td��n"|D]}||�r8|Sq8t|�SdS)a:
    Return the first finite element in *obj* if one is available and skip_nonfinite is
    True. Otherwise, return the first element.

    This is a method for internal use.

    This is a type-independent way of obtaining the first finite element, supporting
    both index access and the iterator protocol.
    c	Ssd|durdSzt�|�WSttfy.Yn0zt�|�rFt�|�ndWSty^YdS0dS)NFT)�mathr�r3r�r�Zisscalarr�rrr�
safe_isfinite�sz)_safe_first_finite.<locals>.safe_isfiniterr�N)r(r�Zflatiterr�r�r�r�r�)r$r�r�rrr�_safe_first_finite�s


r�cCst|tjj�rt|�S|S)zP
    Convert dictview objects to list. Other inputs are returned unchanged.
    )r(r�r��MappingViewr9)r8rrr�sanitize_sequence�s�r�c	Cs�ddlm}|duriS|dur&i}n*t|t�r:t||�sDt||�rPt|di�}dd�|��D�}i}i}|��D]F\}}|�||�}||vr�td||�d|�d	���|||<|||<qr|S)
aA
    Helper function to normalize kwarg inputs.

    Parameters
    ----------
    kw : dict or None
        A dict of keyword arguments.  None is explicitly supported and treated
        as an empty dict, to support functions with an optional parameter of
        the form ``props=None``.

    alias_mapping : dict or Artist subclass or Artist instance, optional
        A mapping between a canonical name to a list of aliases, in order of
        precedence from lowest to highest.

        If the canonical value is not in the list it is assumed to have the
        highest priority.

        If an Artist subclass or instance is passed, use its properties alias
        mapping.

    Raises
    ------
    TypeError
        To match what Python raises if invalid arguments/keyword arguments are
        passed to a callable.
    r)�ArtistNZ
_alias_mapcSs i|]\}}|D]
}||�qqSrr)rD�	canonicalZ
alias_list�aliasrrrrG*s�z$normalize_kwargs.<locals>.<dictcomp>z	Got both z and z", which are aliases of one another)	Zmatplotlib.artistr�r(rq�
issubclassr�rIrr3)	�kwZ
alias_mappingr�Zto_canonicalZcanonical_to_seen�retrirr�rrr�normalize_kwargss.���

r�c	cs�t|�}|�|jd�}d}d}t|�D]b}z@|�d��"Wd�Wq�Wd�n1s`0YWq(ty�t�|�Yq(0q(td�	|���zdVW|�
�n
|�
�0dS)af
    Context manager for locking a path.

    Usage::

        with _lock_path(path):
            ...

    Another thread or process that attempts to lock the same path will wait
    until this context manager is exited.

    The lock is implemented by creating a temporary file in the parent
    directory, so that directory must exist and be writable.
    z.matplotlib-lockrgg�������?�xbNz�Lock error: Matplotlib failed to acquire the following lock file:
    {}
This maybe due to another process holding this lock file.  If you are sure no
other Matplotlib process is running, remove this file and try again.)r�	with_namer}�ranger��FileExistsError�time�sleep�TimeoutError�format�unlink)r�Z	lock_path�retriesZ	sleeptimer�rrr�
_lock_path;s 4�r�Zzorderr cCs|t|��S)a
    Get the topmost artist of a list.

    In case of a tie, return the *last* of the tied artists, as it will be
    drawn on top of the others. `max` returns the first maximum in case of
    ties, so we need to iterate over the list in reverse order.
    )�reversed)ZartistsZ_cached_maxrrr�_topmost_artistbs
r�cCst|t�o||kS)a
    Return whether *obj* is a string equal to string *s*.

    This helper solely exists to handle the case where *obj* is a numpy array,
    because in such cases, a naive ``obj == s`` would yield an array, which
    cannot be used in a boolean context.
    )r(r��r$rKrrr�
_str_equalosr�cCst|t�o|��|kS)a
    Return whether *obj* is a string equal, when lowercased, to string *s*.

    This helper solely exists to handle the case where *obj* is a numpy array,
    because in such cases, a naive ``obj == s`` would yield an array, which
    cannot be used in a boolean context.
    )r(r�r�r�rrr�_str_lower_equalzsr�cCsPtjdd�}tjddd�}t�|d|f||df|d|f||dff�S)aZ
    Get the elements on the perimeter of *arr*.

    Parameters
    ----------
    arr : ndarray, shape (M, N)
        The input array.

    Returns
    -------
    ndarray, shape (2*(M - 1) + 2*(N - 1),)
        The elements on the perimeter of the array::

           [arr[0, 0], ..., arr[0, -1], ..., arr[-1, -1], ..., arr[-1, 0], ...]

    Examples
    --------
    >>> i, j = np.ogrid[:3, :4]
    >>> a = i*10 + j
    >>> a
    array([[ 0,  1,  2,  3],
           [10, 11, 12, 13],
           [20, 21, 22, 23]])
    >>> _array_perimeter(a)
    array([ 0,  1,  2,  3, 13, 23, 22, 21, 20, 10])
    rr~)r�Zs_rm)�arrr�Zbackwardrrr�_array_perimeter�s



�r�cCs`g|j�|�}g|j�|j|�}||||d||<|||||<tjjj|||dd�S)a�
    Append an extra dimension containing sliding windows along *axis*.

    All windows are of size *size* and begin with every *step* elements.

    Parameters
    ----------
    arr : ndarray, shape (N_1, ..., N_k)
        The input array
    axis : int
        Axis along which the windows are extracted
    size : int
        Size of the windows
    step : int
        Stride between first elements of subsequent windows.

    Returns
    -------
    ndarray, shape (N_1, ..., 1 + (N_axis-size)/step, ..., N_k, size)

    Examples
    --------
    >>> i, j = np.ogrid[:3, :7]
    >>> a = i*10 + j
    >>> a
    array([[ 0,  1,  2,  3,  4,  5,  6],
           [10, 11, 12, 13, 14, 15, 16],
           [20, 21, 22, 23, 24, 25, 26]])
    >>> _unfold(a, axis=1, size=3, step=2)
    array([[[ 0,  1,  2],
            [ 2,  3,  4],
            [ 4,  5,  6]],
           [[10, 11, 12],
            [12, 13, 14],
            [14, 15, 16]],
           [[20, 21, 22],
            [22, 23, 24],
            [24, 25, 26]]])
    r�F)r/�stridesZ	writeable)r/r�r��libZ
stride_tricksZ
as_strided)r�rSrRr�Z	new_shapeZnew_stridesrrr�_unfold�s(
�r�cCs
|dkr|dksJ�|jdd|dks.J�|jdd|dksHJ�t|dd|�dd�fd||�}t||d|�dd�fd||�dddd�f}t|dd�|d|�fd||�}t|dd�dd|�fd||�dddd�f}tj||||fdd��dd||�S)ad
    Extract perimeters of patches from *arr*.

    Extracted patches are of size (*rstride* + 1) x (*cstride* + 1) and
    share perimeters with their neighbors. The ordering of the vertices matches
    that returned by ``_array_perimeter``.

    Parameters
    ----------
    x : ndarray, shape (N, M)
        Input array
    rstride : int
        Vertical (row) stride between corresponding elements of each patch
    cstride : int
        Horizontal (column) stride between corresponding elements of each patch

    Returns
    -------
    ndarray, shape (N/rstride * M/cstride, 2 * (rstride + cstride))
    rr�Nr~.r}�rS)r/r�r�rmr,)r�ZrstrideZcstride�topZbottom�right�leftrrr�_array_patch_perimeters�s . .�r�cks�t�}i}|D]V}t|||�}||jvs0||ur:|||<qtt|�|�}t|t�r\|||<q|||<qzZ|��D]\}}t|||�qpdVW|��D](\}}||ur�t||�q�t|||�q�n4|��D](\}}||ur�t||�q�t|||�q�0dS)zR
    Temporarily set some attributes; restore original state at context exit.
    N)	rr��__dict__rqr(�propertyrI�setattr�delattr)r$re�sentinelZorigs�attrrkZcls_origr�rrr�_setattr_cms,




�r�c@s<eZdZdd�Zdd�Zdd�Zdd�Zd	d
�Zdd�Zd
S)�_OrderedSetcCst��|_dSr )r��OrderedDict�_odr&rrrr%<sz_OrderedSet.__init__cCs
||jvSr )r��r#r{rrrr?sz_OrderedSet.__contains__cCs
t|j�Sr )r(r�r&rrrr"Bsz_OrderedSet.__iter__cCs
t|j�Sr )r`r�r&rrrr�Esz_OrderedSet.__len__cCs|j�|d�d|j|<dSr �r�rSr�rrrr\Hsz_OrderedSet.addcCs|j�|d�dSr r�r�rrrr_Lsz_OrderedSet.discardN)	r-r.r/r%rr"r�r\r_rrrrr�;sr�cCs�tj|tjdkrgd�ngd�dd�}|ddd�f}|d	}|d
k}t�|d�D].}||�t�d||d||||<qR|S)zS
    Convert a premultiplied ARGB32 buffer to an unmultiplied RGBA8888 buffer.
    �little�r}r�rr)r�r}rrr}r�.Nr~).r~r�)r��taker
�	byteorderZrollaxisZastype�int)�bufZrgbaZrgb�alpharBZchannelrrr�._premultiplied_argb32_to_unmultiplied_rgba8888Ts���r�cCs�tjdkr@tj|gd�dd�}|ddd�f}|ddd�f}n4tj|gd�dd�}|ddd	�f}|dd	d�f}|��d
kr�tj||d
|dd�|S)
zS
    Convert an unmultiplied RGBA8888 buffer to a premultiplied ARGB32 buffer.
    r�r�r}r�.Nr~)rrr�r}r�r��unsafe)rzZcasting)r
r�r�r�r��multiply)Zrgba8888Zargb32Zrgb24Zalpha8rrr�._unmultiplied_rgba8888_to_premultiplied_argb32fs
r�cCs�|jdd���\}|jdd���\}t|�rpt|�rp|ddg\}}|ddg\}}t||d�t||d�fStdd�tdd�fSdS)a!
    Return the bounds of the nonzero region of a 2D array as a pair of slices.

    ``buf[_get_nonzero_slices(buf)]`` is the smallest sub-rectangle in *buf*
    that encloses all non-zero entries in *buf*.  If *buf* is fully zero, then
    ``(slice(0, 0), slice(0, 0))`` is returned.
    rr�r�r~N)�anyr<r`�slice)r�Zx_nzZy_nz�lr�r�trrr�_get_nonzero_sliceszsr�cCs"t|t�r|Sd�dd�|D��S)zAPretty-format a subprocess command for printing/logging purposes.rtcss|]}t�t�|��VqdSr )�shlex�quoter�r�)rDrrrr�	<genexpr>�rRz&_pformat_subprocess.<locals>.<genexpr>)r(r�r)�commandrrr�_pformat_subprocess�s�r�cKs�|�dt|��tj|fddi|��}|jrz|j}t|t�rD|��}|j	}t|t�r\|��}t
dt|��d|�d|����|jr�|�d|j�|j	r�|�d|j	�|jS)	aj
    Run *command*, returning its stdout output if it succeeds.

    If it fails (exits with nonzero return code), raise an exception whose text
    includes the failed command and captured stdout and stderr output.

    Regardless of the return code, the command is logged at DEBUG level on
    *logger*.  In case of success, the output is likewise logged.
    z%s�capture_outputTzThe command
    z,
failed and generated the following output:
z
and the following error:
z
stdout:
%sz
stderr:
%s)�debugr��
subprocess�run�
returncode�stdoutr(�bytes�decode�stderrr�)r��loggerre�procr�r�rrr�_check_and_log_subprocess�s.


����r�cCs.zt��Wnty(t�d�Yn0dS)zS
    Perform OS-dependent setup when Matplotlib creates a new GUI application.
    r�N)rZ-Win32_GetCurrentProcessExplicitAppUserModelID�OSErrorZ-Win32_SetCurrentProcessExplicitAppUserModelIDrrrr�_setup_new_guiapp�s�r�cCs |d|�d���d��d�pdS)z�
    Format the number with at most the number of decimals given as precision.
    Remove trailing zeros and possibly the decimal point.
    �.�f�0)�rstrip)�numberZ	precisionrrr�_format_approx�sr�cCsf|dkr"|dkrdStt�|��}t�|�rbtd|rLt�t�t|���dndt�t�|���SdS)z
    Return the number of significant digits to %g-format *value*, assuming that
    it is known with an error of *delta*.
    rrr�)�absr��spacingr�r�r��floor�log10)�value�deltarrr�
_g_sig_digits�s
����r�cCs�|r|��r|S|��}|�d�r.|dd�}|�d�rD|�dd�}|�d�rZ|dd�}tjdkrp|d	krpd
}ddd
d��||�}|S)z�
    Convert a Unicode key or X keysym to a Matplotlib key name.

    The Unicode key is checked first; this avoids having to list most printable
    keysyms such as ``EuroSign``.
    Zkp_rNZpage_�page)Z_l�_rr��darwin�meta�cmdZenterZpageupZpagedown)�returnZpriorrN)�isprintabler��
startswithr�r�r
�platformr)ZunikeyZkeysymr{rrr�_unikey_or_keysym_to_mplkey�s$


��rcs"tj���fdd��}�j|_|S)ax
    Return a function that creates picklable classes inheriting from a mixin.

    After ::

        factory = _make_class_factory(FooMixin, fmt, attr_name)
        FooAxes = factory(Axes)

    ``Foo`` is a class that inherits from ``FooMixin`` and ``Axes`` and **is
    picklable** (picklability is what differentiates this from a plain call to
    `type`).  Its ``__name__`` is set to ``fmt.format(Axes.__name__)`` and the
    base class is stored in the ``attr_name`` attribute, if not None.

    Moreover, the return value of ``factory`` is memoized: calls with the same
    ``Axes`` class always return the same subclass.
    csZt|��r|S|�G����fdd�d���}���j�|_|_�durVt|���|S)Ncs$eZdZ�jZ����fdd�ZdS)z:_make_class_factory.<locals>.class_factory.<locals>.subclscst����f|��fSr )�_picklable_class_constructorrOr&��	attr_name�
base_class�fmt�mixin_classrr�
__reduce__	s
�zE_make_class_factory.<locals>.class_factory.<locals>.subcls.__reduce__N)r-r.r/rrrrr�subcls	sr)r�r�r-r/r�)Z
axes_classr�rr	r
)rr�
class_factory	s
	z*_make_class_factory.<locals>.class_factory)�	functools�cacher.)r
r	rrrr
r�_make_class_factory�srcCst|||�}||�}|�|�S)z(Internal helper for _make_class_factory.)r�__new__)r
r	rr�factory�clsrrrr-	srcCs.zt|tjdj�WSty(YdS0dS)z!Check if 'x' is a PyTorch Tensor.ZtorchFN)r(r
rZTensorrcr�rrr�_is_torch_array4	srcCs.zt|tjdj�WSty(YdS0dS)zCheck if 'x' is a JAX Array.ZjaxFN)r(r
r�Arrayrcr�rrr�
_is_jax_array@	srcCsnt|tj�r|St|d�r"|��St|d�rB|j}t|tj�rB|St|�sRt|�rj|��}t|tj�rj|S|S)zDInternal helper to extract data from e.g. pandas and xarray objects.r�r)	r(r�r9r�r�rrrZ	__array__)r�ZxtmprrrrzL	s

rzc	Cs2z||fWSttfy,|�|�YS0dS)aA
    Apply *value* to the format string *fmt*.

    This works both with unnamed %-style formatting and
    unnamed {}-style formatting. %-style formatting has priority.
    If *fmt* is %-style formattable that will be used. Otherwise,
    {}-formatting is applied. Strings without formatting placeholders
    are passed through as is.

    Examples
    --------
    >>> _auto_format_str('%.2f m', 0.2)
    '0.20 m'
    >>> _auto_format_str('{} m', 0.2)
    '0.2 m'
    >>> _auto_format_str('const', 0.2)
    'const'
    >>> _auto_format_str('%d or {}', 0.2)
    '0 or {}'
    N)r3r�r�)r	r�rrr�_auto_format_strc	sr)r�FN)r�N)T)F)rPNNF)riN)N)N)mr0r��collections.abcrnrr�r=r��operatorr��pathlibrr�r�r
r�rr�r1�numpyr�Znumpy.exceptionsr�ImportErrorr�rrrrrr6r7r9rpZMatplotlibDeprecationWarningr|r�r�r�r�r�r�r�Zdelete_parameterr�r�r�r$r�r�r�r�rrr%r1rCrHrOrqZ	ls_mapperrIZls_mapper_rrwrxryr|rjr�r�r�r�ZSTEP_LOOKUP_MAPr�r�r�r�r�ror��partialr��
attrgetterr�r�r�r�r�r�r�r��
MutableSetr�r�r�r�r�r�r�r�r�rrrrrrrzrrrrr�<module>s�2
V$�
4
�	j7
Es
MA&
K
<
b&$&�#'
8
(�

'21
+!.

Youez - 2016 - github.com/yon3zu
LinuXploit