a
lj# @ s d dl Z d dlZd dlZd dlmZ ejr6d dlmZ G dd de jZG dd deZ G dd d e Z
G d
d d eZ G d d
d
eZ G dd deZ
G dd deZG dd deZG dd deZdS ) N)_utils)RetryCallStatec @ sL e Zd ZdZejdedddZd dddd Zd e j
d
dd d Z d
S ) wait_basez(Abstract base class for wait strategies.r retry_statereturnc C s d S N selfr r r =/usr/lib/python3.9/site-packages/pip/_vendor/tenacity/wait.py__call__ s zwait_base.__call__ wait_combine)otherr c C s
t | |S r )r r r r r r __add__" s zwait_base.__add__)r r c C s |dkr | S | |S Nr )r r r r r __radd__% s zwait_base.__radd__N) __name__
__module__ __qualname____doc__abcabstractmethodfloatr
r typingUnionr r r r r r s
r c @ s0 e Zd ZdZeddddZdeddd ZdS )
wait_fixedzCWait strategy that waits a fixed amount of time between each retry.N)waitr c C s
|| _ d S r r )r r r r r __init__/ s zwait_fixed.__init__r r c C s | j S r r r
r r r r
2 s zwait_fixed.__call__)r r r r r r r
r r r r r , s r c s& e Zd ZdZdd fdd Z ZS ) wait_nonez7Wait strategy that doesn't wait at all before retrying.N)r c s t d d S r )superr )r __class__r r r 9 s zwait_none.__init__)r r r r r
__classcell__r r r# r r! 6 s r! c @ sH e Zd ZdZd ejeef ejeef ddddZded d
d Z dS )
wait_randomzAWait strategy that waits a random amount of time between min/max.r N)minmaxr c C s || _ || _d S r )wait_random_minwait_random_max)r r( r) r r r r @ s zwait_random.__init__r r c C s | j t | j| j S r )r* randomr+ r
r r r r
D s zwait_random.__call__)r r' )
r r r r r r intr r r
r r r r r& = s (r& c @ s0 e Zd ZdZeddddZdeddd ZdS )
r z#Combine several waiting strategies.N
strategiesr c G s
|| _ d S r )
wait_funcsr r/ r r r r K s zwait_combine.__init__r r c s t fdd| jD S )Nc 3 s | ]}| d V qdS )r Nr ).0xr2 r r O z(wait_combine.__call__..)sumr0 r
r r2 r r
N s zwait_combine.__call__r r r r r r r r
r r r r r H s r c @ s0 e Zd ZdZeddddZdeddd 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. c G s
|| _ d S r )r/ r1 r r r r b s zwait_chain.__init__r r c C s0 t t|jdt| j}| j|d }||dS )Nr' r2 )r( r) attempt_numberlenr/ )r r Z wait_func_noZ wait_funcr r r r
e s zwait_chain.__call__r8 r r r r r9 R s r9 c @ s\ e Zd ZdZddejfejee f ejee f ejee f ddddZ
de d d
d Z dS ) wait_incrementingzWait 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 d N)start incrementr) r c C s || _ || _|| _d S r )r> r? r) )r r> r? r) r r r r r s zwait_incrementing.__init__r r c C s( | j | j|jd }tdt|| jS Nr' r )r> r? r: r) r( )r r resultr r r r
| s zwait_incrementing.__call__ r r r r r ZMAX_WAITr r r- r r r
r r r r r< k s
r< c @ sj e Zd ZdZdejddfejee f ejee f ejee f ejee f ddddZ
d e d
d d Z dS )
wait_exponentiala Wait 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' r N)
multiplierr) exp_baser( r c C s || _ || _|| _|| _d S r )rE r( r) rF )r rE r) rF r( r r r r s zwait_exponential.__init__r r c C sR z | j |jd }| j| }W n ty6 | j Y S 0 ttd| jt|| jS r@ )rF r: rE
OverflowErrorr) r( )r r ZexprA r r r r
s zwait_exponential.__call__rB r r r r rC s rC c s( e Zd ZdZded fdd Z ZS )wait_random_exponentiala Random 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.
r r c s t j|d}td|S )Nr2 r )r" r
r, Zuniform)r r Zhighr# r r r
s z wait_random_exponential.__call__)r r r r r r
r% r r r# r rH s rH )r r, r Zpip._vendor.tenacityr
TYPE_CHECKINGr ABCr r r! r& r r9 r< rC rH r r r r s
"