ï¿½ ï¿½ï¿½^i#ï¿½ï¿½Jï¿½ddlZddlZddlZddlmZejrddlmZGdï¿½dejï¿½ï¿½ZGdï¿½deï¿½ï¿½Z Gdï¿½d e ï¿½ï¿½Z Gd ï¿½deï¿½ï¿½ZGdï¿½d eï¿½ï¿½ZGdï¿½deï¿½ï¿½Z Gdï¿½deï¿½ï¿½ZGdï¿½deï¿½ï¿½ZGdï¿½deï¿½ï¿½ZdS)ï¿½N)ï¿½_utils)ï¿½RetryCallStatecï¿½jï¿½eZdZdZejdddefdï¿½ï¿½ï¿½Zddï¿½Zddde j d fd ï¿½ZdS) ï¿½ wait_basez(Abstract base class for wait strategies.ï¿½retry_staterï¿½returncï¿½ï¿½dSï¿½Nï¿½ï¿½ï¿½selfrs ï¿½ï¿½/builddir/build/BUILDROOT/alt-python311-pip-21.3.1-4.el8.x86_64/opt/alt/python311/lib/python3.11/site-packages/pip/_vendor/tenacity/wait.pyï¿½__call__zwait_base.__call__sï¿½ï¿½ï¿½ï¿½ï¿½otherï¿½wait_combinecï¿½"ï¿½t||ï¿½ï¿½Sr )rï¿½r rs rï¿½__add__zwait_base.__add__"sï¿½ï¿½ï¿½Dï¿½%ï¿½(ï¿½(ï¿½(r)rrcï¿½<ï¿½|dkr|S|ï¿½|ï¿½ï¿½Sï¿½Nr)rrs rï¿½__radd__zwait_base.__radd__%s"ï¿½ï¿½ï¿½Aï¿½:ï¿½:ï¿½ï¿½Kï¿½ï¿½|ï¿½|ï¿½Eï¿½"ï¿½"ï¿½"rN)rrrr)ï¿½__name__ï¿½ __module__ï¿½__qualname__ï¿½__doc__ï¿½abcï¿½abstractmethodï¿½floatrrï¿½typingï¿½Unionrrrrrrsï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½2ï¿½2ï¿½ï¿½ï¿½ ï¿½$4ï¿½ ï¿½ï¿½ ï¿½ ï¿½ ï¿½ï¿½ï¿½ ï¿½)ï¿½)ï¿½)ï¿½)ï¿½#ï¿½kï¿½#ï¿½fï¿½lï¿½;Vï¿½.Wï¿½#ï¿½#ï¿½#ï¿½#ï¿½#ï¿½#rrcï¿½2ï¿½eZdZdZdeddfdï¿½Zdddefdï¿½ZdS) ï¿½ wait_fixedzCWait strategy that waits a fixed amount of time between each retry.ï¿½waitrNcï¿½ï¿½||_dSr ï¿½r#)r r$s rï¿½__init__zwait_fixed.__init__/s ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½rrrcï¿½ï¿½|jSr r&rs rrzwait_fixed.__call__2s ï¿½ï¿½ï¿½ï¿½r)rrrrrr'rrrrr#r#,s_ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½Mï¿½Mï¿½ï¿½Uï¿½ï¿½tï¿½ï¿½ï¿½ï¿½ï¿½ï¿½$4ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½rr#cï¿½$ï¿½ï¿½eZdZdZdï¿½fdï¿½Zï¿½xZS)ï¿½ wait_nonez7Wait strategy that doesn't wait at all before retrying.rNcï¿½Jï¿½ï¿½tï¿½ï¿½ï¿½dï¿½ï¿½dSr)ï¿½superr')r ï¿½ __class__s ï¿½rr'zwait_none.__init__9s!ï¿½ï¿½ï¿½ ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½r)rN)rrrrr'ï¿½ __classcell__ï¿½r-s@rr*r*6sCï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½Aï¿½Aï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½rr*cï¿½lï¿½eZdZdZddejeefdejeefddfdï¿½Zd d defdï¿½Z dS) ï¿½wait_randomzAWait strategy that waits a random amount of time between min/max.rï¿½ï¿½minï¿½maxrNcï¿½"ï¿½||_||_dSr )ï¿½wait_random_minï¿½wait_random_max)r r3r4s rr'zwait_random.__init__@sï¿½ï¿½"ï¿½ï¿½ï¿½"ï¿½ï¿½ï¿½ï¿½rrrcï¿½Xï¿½|jtjï¿½ï¿½|j|jz zzSr )r6ï¿½randomr7rs rrzwait_random.__call__Ds'ï¿½ï¿½ï¿½#ï¿½vï¿½}ï¿½ï¿½ï¿½$ï¿½:Nï¿½QUï¿½Qeï¿½:eï¿½'fï¿½gï¿½gr)rr2) rrrrr r!ï¿½intrr'rrrrr1r1=sï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½Kï¿½Kï¿½#ï¿½#ï¿½Fï¿½Lï¿½ï¿½eï¿½ï¿½4ï¿½#ï¿½vï¿½|ï¿½Cï¿½QVï¿½Jï¿½?Wï¿½#ï¿½`dï¿½#ï¿½#ï¿½#ï¿½#ï¿½hï¿½$4ï¿½hï¿½ï¿½hï¿½hï¿½hï¿½hï¿½hï¿½hrr1cï¿½2ï¿½eZdZdZdeddfdï¿½Zdddefdï¿½ZdS) rz#Combine several waiting strategies.ï¿½ strategiesrNcï¿½ï¿½||_dSr )ï¿½ wait_funcsï¿½r r<s rr'zwait_combine.__init__Kï¿½ ï¿½ï¿½$ï¿½ï¿½ï¿½ï¿½rrrcï¿½Dï¿½ï¿½tï¿½fdï¿½|jDï¿½ï¿½ï¿½ï¿½S)Nc3ï¿½0ï¿½Kï¿½|]}|ï¿½ï¿½ï¿½ï¿½Vï¿½ï¿½dS)ï¿½rNr)ï¿½.0ï¿½xrs ï¿½rï¿½ z(wait_combine.__call__..Os0ï¿½ï¿½ï¿½ï¿½ï¿½Gï¿½Gï¿½!ï¿½1ï¿½1ï¿½ï¿½-ï¿½-ï¿½-ï¿½Gï¿½Gï¿½Gï¿½Gï¿½Gï¿½Gr)ï¿½sumr>rs `rrzwait_combine.__call__Ns(ï¿½ï¿½ï¿½ï¿½Gï¿½Gï¿½Gï¿½Gï¿½tï¿½ï¿½Gï¿½Gï¿½Gï¿½Gï¿½Gï¿½Grï¿½rrrrrr'rrrrrrrHsgï¿½ï¿½ï¿½ï¿½ï¿½ï¿½-ï¿½-ï¿½%ï¿½Iï¿½%ï¿½$ï¿½%ï¿½%ï¿½%ï¿½%ï¿½Hï¿½$4ï¿½Hï¿½ï¿½Hï¿½Hï¿½Hï¿½Hï¿½Hï¿½Hrrcï¿½2ï¿½eZdZdZdeddfdï¿½Zdddefdï¿½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.") r<rNcï¿½ï¿½||_dSr )r<r?s rr'zwait_chain.__init__br@rrrcï¿½ï¿½tt|jdï¿½ï¿½t|jï¿½ï¿½ï¿½ï¿½}|j|dz }||ï¿½ï¿½ï¿½S)Nr2rC)r3r4ï¿½attempt_numberï¿½lenr<)r rï¿½wait_func_noï¿½ wait_funcs rrzwait_chain.__call__esLï¿½ï¿½ï¿½3ï¿½{ï¿½9ï¿½1ï¿½=ï¿½=ï¿½sï¿½4ï¿½?ï¿½?Sï¿½?Sï¿½Tï¿½Tï¿½ï¿½ï¿½Oï¿½Lï¿½1ï¿½$4ï¿½5ï¿½ ï¿½ï¿½yï¿½[ï¿½1ï¿½1ï¿½1ï¿½1rrHrrrrJrJRscï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ï¿½ ï¿½%ï¿½Iï¿½%ï¿½$ï¿½%ï¿½%ï¿½%ï¿½%ï¿½2ï¿½$4ï¿½2ï¿½ï¿½2ï¿½2ï¿½2ï¿½2ï¿½2ï¿½2rrJc ï¿½ï¿½eZdZdZddejfdejee fdejee fdejee fddfd ï¿½Z d dde fdï¿½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ï¿½dï¿½startï¿½ incrementr4rNcï¿½0ï¿½||_||_||_dSr )rTrUr4)r rTrUr4s rr'zwait_incrementing.__init__rsï¿½ï¿½ï¿½ï¿½ ï¿½"ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½rrrcï¿½|ï¿½|j|j|jdz zz}tdt ||jï¿½ï¿½ï¿½ï¿½Sï¿½Nr2r)rTrUrMr4r3)r rï¿½results rrzwait_incrementing.__call__|s9ï¿½ï¿½ï¿½ï¿½tï¿½~ï¿½ï¿½1Kï¿½aï¿½1Oï¿½Pï¿½Qï¿½ï¿½ï¿½1ï¿½cï¿½&ï¿½$ï¿½(ï¿½+ï¿½+ï¿½,ï¿½,ï¿½,rï¿½rrrrrï¿½MAX_WAITr r!r:rr'rrrrrRrRksï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½+,ï¿½.1ï¿½(.ï¿½ï¿½ ï¿½ï¿½ï¿½|ï¿½Cï¿½ï¿½Jï¿½'ï¿½ï¿½ï¿½<ï¿½ï¿½Uï¿½ ï¿½+ï¿½ï¿½ï¿½\ï¿½#ï¿½uï¿½*ï¿½ %ï¿½ ï¿½ ï¿½ï¿½ï¿½ï¿½ï¿½-ï¿½$4ï¿½-ï¿½ï¿½-ï¿½-ï¿½-ï¿½-ï¿½-ï¿½-rrRcï¿½ï¿½eZdZdZdejddfdejee fdejee fdejee fdejee fd d f dï¿½Z dd d e fdï¿½Zd S)ï¿½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. r2ï¿½rï¿½ multiplierr4ï¿½exp_baser3rNcï¿½>ï¿½||_||_||_||_dSr )r_r3r4r`)r r_r4r`r3s rr'zwait_exponential.__init__ï¿½s$ï¿½ï¿½%ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ï¿½ï¿½ ï¿½ ï¿½ rrrcï¿½ï¿½ï¿½ |j|jdz z}|j|z}n#t$r |jcYSwxYwt t d|jï¿½ï¿½t||jï¿½ï¿½ï¿½ï¿½SrX)r`rMr_ï¿½ OverflowErrorr4r3)r rï¿½exprYs rrzwait_exponential.__call__ï¿½swï¿½ï¿½ ï¿½ï¿½-ï¿½Kï¿½$>ï¿½ï¿½$Bï¿½Cï¿½Cï¿½ï¿½_ï¿½sï¿½*ï¿½Fï¿½Fï¿½ï¿½ï¿½ ï¿½ ï¿½ ï¿½ï¿½8ï¿½Oï¿½Oï¿½Oï¿½ ï¿½ï¿½ï¿½ï¿½ï¿½3ï¿½qï¿½$ï¿½(ï¿½#ï¿½#ï¿½Sï¿½ï¿½ï¿½ï¿½%:ï¿½%:ï¿½;ï¿½;ï¿½;sï¿½ï¿½3ï¿½3rZrrrr]r]ï¿½sï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ï¿½ ï¿½01ï¿½(.ï¿½ï¿½-.ï¿½()ï¿½ !ï¿½ !ï¿½ï¿½Lï¿½ï¿½eï¿½ï¿½,ï¿½ !ï¿½ï¿½\ï¿½#ï¿½uï¿½*ï¿½ %ï¿½ !ï¿½ï¿½,ï¿½sï¿½Eï¿½zï¿½*ï¿½ !ï¿½ ï¿½\ï¿½#ï¿½uï¿½*ï¿½ %ï¿½ !ï¿½ ï¿½ !ï¿½ !ï¿½ !ï¿½ !ï¿½<ï¿½$4ï¿½<ï¿½ï¿½<ï¿½<ï¿½<ï¿½<ï¿½<ï¿½rmsï¿½ï¿½ï¿½"ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½ ï¿½'ï¿½'ï¿½'ï¿½'ï¿½'ï¿½'ï¿½ ï¿½ï¿½4ï¿½3ï¿½3ï¿½3ï¿½3ï¿½3ï¿½3ï¿½#ï¿½#ï¿½#ï¿½#ï¿½#ï¿½ï¿½ï¿½#ï¿½#ï¿½#ï¿½"ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ï¿½ï¿½ï¿½ï¿½hï¿½hï¿½hï¿½hï¿½hï¿½)ï¿½hï¿½hï¿½hï¿½Hï¿½Hï¿½Hï¿½Hï¿½Hï¿½9ï¿½Hï¿½Hï¿½Hï¿½2ï¿½2ï¿½2ï¿½2ï¿½2ï¿½ï¿½2ï¿½2ï¿½2ï¿½2-ï¿½-ï¿½-ï¿½-ï¿½-ï¿½ ï¿½-ï¿½-ï¿½-ï¿½,<ï¿½<ï¿½<ï¿½<ï¿½<ï¿½yï¿½<ï¿½<ï¿½<ï¿½D'ï¿½'ï¿½'ï¿½'ï¿½'ï¿½.ï¿½'ï¿½'ï¿½'ï¿½'ï¿½'r