Current File : //lib/python3.9/site-packages/pip/_vendor/tenacity/__pycache__/wait.cpython-39.pyc
a

[��f#�@s�ddlZddlZddlZddlmZejr6ddlmZGdd�dej�ZGdd�de�Z	Gdd	�d	e	�Z
Gd
d�de�ZGdd
�d
e�ZGdd�de�Z
Gdd�de�ZGdd�de�ZGdd�de�ZdS)�N)�_utils)�RetryCallStatec@sLeZdZdZejded�dd��Zddd�dd	�Zde	j
d
d�dd�Zd
S)�	wait_basez(Abstract base class for wait strategies.r��retry_state�returncCsdS�N���selfrr	r	�=/usr/lib/python3.9/site-packages/pip/_vendor/tenacity/wait.py�__call__szwait_base.__call__�wait_combine)�otherrcCs
t||�Sr)r�rrr	r	r�__add__"szwait_base.__add__)rrcCs|dkr|S|�|�S�Nr)rrr	r	r�__radd__%szwait_base.__radd__N)�__name__�
__module__�__qualname__�__doc__�abc�abstractmethod�floatr
r�typing�Unionrr	r	r	rrs
rc@s0eZdZdZedd�dd�Zded�dd	�ZdS)
�
wait_fixedzCWait strategy that waits a fixed amount of time between each retry.N)�waitrcCs
||_dSr�r)rrr	r	r�__init__/szwait_fixed.__init__rrcCs|jSrrr
r	r	rr
2szwait_fixed.__call__)rrrrrr r
r	r	r	rr,srcs&eZdZdZdd��fdd�Z�ZS)�	wait_nonez7Wait strategy that doesn't wait at all before retrying.N)rcst��d�dSr)�superr )r��	__class__r	rr 9szwait_none.__init__)rrrrr �
__classcell__r	r	r#rr!6sr!c@sHeZdZdZdejeefejeefdd�dd�Zded	�d
d�Z	dS)
�wait_randomzAWait strategy that waits a random amount of time between min/max.r�N)�min�maxrcCs||_||_dSr)�wait_random_min�wait_random_max)rr(r)r	r	rr @szwait_random.__init__rrcCs|jt��|j|jSr)r*�randomr+r
r	r	rr
Dszwait_random.__call__)rr')
rrrrrr�intrr r
r	r	r	rr&=s(r&c@s0eZdZdZedd�dd�Zded�dd	�ZdS)
rz#Combine several waiting strategies.N��
strategiesrcGs
||_dSr)�
wait_funcs�rr/r	r	rr Kszwait_combine.__init__rrcst�fdd�|jD��S)Nc3s|]}|�d�VqdS)�rNr	)�.0�xr2r	r�	<genexpr>O�z(wait_combine.__call__.<locals>.<genexpr>)�sumr0r
r	r2rr
Nszwait_combine.__call__�rrrrrr rr
r	r	r	rrHsrc@s0eZdZdZedd�dd�Zded�dd	�ZdS)
�
wait_chaina�Chain two or more waiting strategies.

    If all strategies are exhausted, the very last strategy is used
    thereafter.

    For example::

        @retry(wait=wait_chain(*[wait_fixed(1) for i in range(3)] +
                               [wait_fixed(2) for j in range(5)] +
                               [wait_fixed(5) for k in range(4)))
        def wait_chained():
            print("Wait 1s for 3 attempts, 2s for 5 attempts and 5s
                   thereafter.")
    Nr.cGs
||_dSr)r/r1r	r	rr bszwait_chain.__init__rrcCs0tt|jd�t|j��}|j|d}||d�S)Nr'r2)r(r)�attempt_number�lenr/)rrZwait_func_noZ	wait_funcr	r	rr
eszwait_chain.__call__r8r	r	r	rr9Rsr9c@s\eZdZdZddejfejee	fejee	fejee	fdd�dd�Z
de	d	�d
d�ZdS)�wait_incrementingz�Wait an incremental amount of time after each attempt.

    Starting at a starting value and incrementing by a value for each attempt
    (and restricting the upper limit to some maximum value).
    r�dN)�start�	incrementr)rcCs||_||_||_dSr)r>r?r))rr>r?r)r	r	rr rszwait_incrementing.__init__rrcCs(|j|j|jd}tdt||j��S�Nr'r)r>r?r:r)r()rr�resultr	r	rr
|szwait_incrementing.__call__�rrrrrZMAX_WAITrrr-rr r
r	r	r	rr<ks��
r<c@sjeZdZdZdejddfejee	fejee	fejee	fejee	fdd�dd�Z
d	e	d
�dd�ZdS)
�wait_exponentialaWait strategy that applies exponential backoff.

    It allows for a customized multiplier and an ability to restrict the
    upper and lower limits to some maximum and minimum value.

    The intervals are fixed (i.e. there is no jitter), so this strategy is
    suitable for balancing retries against latency when a required resource is
    unavailable for an unknown duration, but *not* suitable for resolving
    contention between multiple processes for a shared resource. Use
    wait_random_exponential for the latter case.
    r'�rN)�
multiplierr)�exp_baser(rcCs||_||_||_||_dSr)rEr(r)rF)rrEr)rFr(r	r	rr �szwait_exponential.__init__rrcCsRz|j|jd}|j|}Wnty6|jYS0ttd|j�t||j��Sr@)rFr:rE�
OverflowErrorr)r()rrZexprAr	r	rr
�szwait_exponential.__call__rBr	r	r	rrC�s��rCcs(eZdZdZded��fdd�Z�ZS)�wait_random_exponentialaRandom wait with exponentially widening window.

    An exponential backoff strategy used to mediate contention between multiple
    uncoordinated processes for a shared resource in distributed systems. This
    is the sense in which "exponential backoff" is meant in e.g. Ethernet
    networking, and corresponds to the "Full Jitter" algorithm described in
    this blog post:

    https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/

    Each retry occurs at a random time in a geometrically expanding interval.
    It allows for a custom multiplier and an ability to restrict the upper
    limit of the random interval to some maximum value.

    Example::

        wait_random_exponential(multiplier=0.5,  # initial window 0.5s
                                max=60)          # max 60s timeout

    When waiting for an unavailable resource to become available again, as
    opposed to trying to resolve contention for a shared resource, the
    wait_exponential strategy (which uses a fixed interval) may be preferable.

    rrcst�j|d�}t�d|�S)Nr2r)r"r
r,Zuniform)rrZhighr#r	rr
�sz wait_random_exponential.__call__)rrrrrr
r%r	r	r#rrH�srH)rr,rZpip._vendor.tenacityr�
TYPE_CHECKINGr�ABCrrr!r&rr9r<rCrHr	r	r	r�<module>s

"