infidel/wg-backend-django
1
1
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
be27c0882e5e2e349fae5341f25d1a65a03aa19e
wg-backend-django/dell-env/lib/python3.11/site-packages/tenacity/__pycache__/wait.cpython-311.pyc

133 lines
13 KiB
Plaintext
Raw Normal View History

Add iptable-parser as submodule
2023-10-30 14:40:43 +07:00
<EFBFBD>
s]?e@<00><00><><00>ddlZddlZddlZddlmZejrddlmZGd<04>dej<00><00>Zej eej
dgej e e fffZ Gd<07>de<08><00>ZGd <09>d
e<0E><00>ZGd <0B>d e<08><00>ZGd <0A>de<08><00>ZGd<0F>de<08><00>ZGd<11>de<08><00>ZGd<13>de<08><00>ZGd<15>de<14><00>ZGd<17>de<08><00>ZdS)<19>N)<01>_utils)<01>RetryCallStatec<00>j<00>eZdZdZejdddefd<05><04><00>Zd d<08>Zddde j
d fd
<EFBFBD>Z d S) <0A> wait_basez(Abstract base class for wait strategies.<2E> retry_stater<00>returnc<00><00>dS<00>N<><00><02>selfrs <20>f/home/infidel/Sync/TIP/WireGuard/ocp-wg-backend/dell-env/lib/python3.11/site-packages/tenacity/wait.py<70>__call__zwait_base.__call__s<00><00> <0C><04><00>other<65> wait_combinec<00>"<00>t||<01><00>Sr
)r<00>r rs r<00>__add__zwait_base.__add__"s<00><00><1B>D<EFBFBD>%<25>(<28>(<28>(r)rrc<00><<00>|dkr|S|<00>|<01><00>S<00>Nr)rrs r<00>__radd__zwait_base.__radd__%s"<00><00> <10>A<EFBFBD>:<3A>:<3A><17>K<EFBFBD><13>|<7C>|<7C>E<EFBFBD>"<22>"<22>"rN)rrrr) <0C>__name__<5F>
__module__<EFBFBD> __qualname__<5F>__doc__<5F>abc<62>abstractmethod<6F>floatrr<00>typing<6E>Unionrr rrrrs<><00><00><00><00><00><00>2<>2<><08><17> <0A>$4<> <0A><15> <0A> <0A> <0A><18><17> <0A>)<29>)<29>)<29>)<29>#<23>k<EFBFBD>#<23>f<EFBFBD>l<EFBFBD>;V<>.W<>#<23>#<23>#<23>#<23>#<23>#rrrc<00><<00>eZdZdZdejddfd<05>Zdddefd<08>ZdS) <09>
wait_fixedzCWait strategy that waits a fixed amount of time between each retry.<2E>waitrNc<00>8<00>tj|<01><00>|_dSr
)r<00>
to_secondsr#)r r$s r<00>__init__zwait_fixed.__init__2s<00><00> <20>+<2B>D<EFBFBD>1<>1<><04><0F><0F>rrrc<00><00>|jSr
)r#r s rrzwait_fixed.__call__5s
<00><00><13><EFBFBD>r<00> rrrrr<00>time_unit_typer'rrr rrr#r#/sb<00><00><00><00><00><00>M<>M<>2<>V<EFBFBD>2<>2<>t<EFBFBD>2<>2<>2<>2<><1F>$4<><1F><15><1F><1F><1F><1F><1F>rr#c<00>$<00><00>eZdZdZd<05>fd<04> Z<04>xZS)<06> wait_nonez7Wait strategy that doesn't wait at all before retrying.rNc<00>J<00><01>t<00><00><00>d<01><00>dSr)<02>superr')r <00> __class__s <20>rr'zwait_none.__init__<s!<00><><00> <0A><07><07><18><18><11><1B><1B><1B><1B>r)rN)rrrrr'<00> __classcell__<5F>r/s@rr,r,9sC<00><><00><00><00><00><00>A<>A<><1C><1C><1C><1C><1C><1C><1C><1C><1C>rr,c<00>L<00>eZdZdZd dejdejddfd<08>Zd d
defd <0B>ZdS) <0A> wait_randomzAWait strategy that waits a random amount of time between min/max.r<00><00>min<69>maxrNc<00>j<00>tj|<01><00>|_tj|<02><00>|_dSr
)rr&<00>wait_random_min<69>wait_random_max)r r5r6s rr'zwait_random.__init__Cs.<00><00>%<25>0<><13>5<>5<><04><1C>%<25>0<><13>5<>5<><04><1C><1C>rrrc<00>X<00>|jtj<00><00>|j|jz
zzSr
)r8<00>randomr9r s rrzwait_random.__call__Gs'<00><00><13>#<23>v<EFBFBD>}<7D><EFBFBD><EFBFBD>$<24>:N<>QU<51>Qe<51>:e<>'f<>g<>gr)rr4r)r rrr3r3@sz<00><00><00><00><00><00>K<>K<>6<>6<>F<EFBFBD>1<>6<>F<EFBFBD><Q<>6<>Z^<5E>6<>6<>6<>6<>h<01>$4<>h<01><15>h<01>h<01>h<01>h<01>h<01>hrr3c<00>2<00>eZdZdZdeddfd<05>Zdddefd<08>ZdS) rz#Combine several waiting strategies.<2E>
strategiesrNc<00><00>||_dSr
)<01>
wait_funcs<EFBFBD>r r=s rr'zwait_combine.__init__N<00> <00><00>$<24><04><0F><0F>rrrc<00>D<00><01>t<00>fd<01>|jD<00><00><00><00>S)Nc3<00>0<00>K<00>|]}|<01><02><00><00>V<00><00>dS)<02>rNr )<03>.0<EFBFBD>xrs <20>r<00> <genexpr>z(wait_combine.__call__.<locals>.<genexpr>Rs0<00><><00><00><00>G<>G<>!<21>1<EFBFBD>1<EFBFBD><1B>-<2D>-<2D>-<2D>G<>G<>G<>G<>G<>Gr)<02>sumr?r s `rrzwait_combine.__call__Qs(<00><><00><12>G<>G<>G<>G<>t<EFBFBD><EFBFBD>G<>G<>G<>G<>G<>Gr<00>rrrrrr'rrr rrrrKsg<00><00><00><00><00><00>-<2D>-<2D>%<25>I<EFBFBD>%<25>$<24>%<25>%<25>%<25>%<25>H<01>$4<>H<01><15>H<01>H<01>H<01>H<01>H<01>Hrrc<00>2<00>eZdZdZdeddfd<05>Zdddefd<08>ZdS) <09>
wait_chaina<EFBFBD>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<00><00>||_dSr
)r=r@s rr'zwait_chain.__init__erArrrc<00><><00>tt|jd<01><00>t|j<00><00><00><00>}|j|dz
}||<01><02><00>S)Nr4rD)r5r6<00>attempt_number<65>lenr=)r r<00> wait_func_no<6E> wait_funcs rrzwait_chain.__call__hsL<00><00><1A>3<EFBFBD>{<7B>9<>1<EFBFBD>=<3D>=<3D>s<EFBFBD>4<EFBFBD>?<3F>?S<>?S<>T<>T<> <0C><18>O<EFBFBD>L<EFBFBD>1<EFBFBD>$4<>5<> <09><18>y<EFBFBD>[<5B>1<>1<>1<>1rrIr rrrKrKUsc<00><00><00><00><00><00> <08> <08>%<25>I<EFBFBD>%<25>$<24>%<25>%<25>%<25>%<25>2<>$4<>2<><15>2<>2<>2<>2<>2<>2rrKc <00>j<00>eZdZdZddejfdejdejdejddfd <09>Zd
d defd <0C>Z dS) <0A>wait_incrementingz<67>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<00>d<00>start<72> incrementr6rNc<00><><00>tj|<01><00>|_tj|<02><00>|_tj|<03><00>|_dSr
)rr&rUrVr6)r rUrVr6s rr'zwait_incrementing.__init__us><00><00> <1C>&<26>u<EFBFBD>-<2D>-<2D><04>
<EFBFBD><1F>*<2A>9<EFBFBD>5<>5<><04><0E><19>$<24>S<EFBFBD>)<29>)<29><04><08><08>rrrc<00>|<00>|j|j|jdz
zz}tdt ||j<00><00><00><00>S<00>Nr4r)rUrVrNr6r5)r r<00>results rrzwait_incrementing.__call__s9<00><00><15><1A>t<EFBFBD>~<7E><1B>1K<31>a<EFBFBD>1O<31>P<>Q<><06><12>1<EFBFBD>c<EFBFBD>&<26>$<24>(<28>+<2B>+<2B>,<2C>,<2C>,r)
rrrrr<00>MAX_WAITr*r'rrr rrrSrSns<><00><00><00><00><00><00><08><08>()<29>+.<2E>%+<2B>_<EFBFBD> *<2A>*<2A><15>$<24>*<2A><1A>(<28>*<2A><14> "<22> *<2A>
<0E> *<2A>*<2A>*<2A>*<2A>-<2D>$4<>-<2D><15>-<2D>-<2D>-<2D>-<2D>-<2D>-rrSc <00><><00>eZdZdZdejddfdejee fdej
dejee fdej
d d
f
d <0B>Z d d d e fd<0E>Z d
S)<0F>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.
r4<00>r<00>
multiplierr6<00>exp_baser5rNc<00><><00>||_tj|<04><00>|_tj|<02><00>|_||_dSr
)r_rr&r5r6r`)r r_r6r`r5s rr'zwait_exponential.__init__<5F>s:<00><00>%<25><04><0F><19>$<24>S<EFBFBD>)<29>)<29><04><08><19>$<24>S<EFBFBD>)<29>)<29><04><08> <20><04> <0A> <0A> rrrc<00><><00> |j|jdz
z}|j|z}n#t$r
|jcYSwxYwt t d|j<00><00>t ||j<00><00><00><00>SrY)r`rNr_<00> OverflowErrorr6r5)r r<00>exprZs rrzwait_exponential.__call__<5F>sw<00><00> <1C><16>-<2D>K<EFBFBD>$><3E><11>$B<>C<>C<EFBFBD><19>_<EFBFBD>s<EFBFBD>*<2A>F<EFBFBD>F<EFBFBD><46><1C> <1C> <1C> <1C><17>8<EFBFBD>O<EFBFBD>O<EFBFBD>O<EFBFBD> <1C><><EFBFBD><EFBFBD><12>3<EFBFBD>q<EFBFBD>$<24>(<28>#<23>#<23>S<EFBFBD><16><14><18>%:<3A>%:<3A>;<3B>;<3B>;s <00><00>3<03>3) rrrrrr[r r!<00>intrr*r'rr rrr]r]<00>s<><00><00><00><00><00><00>
<08>
<08>01<30>%+<2B>_<EFBFBD>-.<2E>%&<26>
!<21>
!<21><1A>L<EFBFBD><13>e<EFBFBD><1A>,<2C>
!<21><14> "<22>
!<21><19>,<2C>s<EFBFBD>E<EFBFBD>z<EFBFBD>*<2A>
!<21>
<14> "<22>
!<21>
<0E>
!<21>
!<21>
!<21>
!<21><<3C>$4<><<3C><15><<3C><<3C><<3C><<3C><<3C><rr]c<00>,<00><00>eZdZdZdddef<04>fd<05> Z<05>xZS)<06>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.
rrrc<00>r<00><01>t<00><00><00>|<01><01><00>}tjd|<02><00>S)NrDr)r.rr;<00>uniform)r r<00>highr/s <20>rrz wait_random_exponential.__call__<5F>s/<00><><00><14>w<EFBFBD>w<EFBFBD><1F><1F>K<EFBFBD><1F>8<>8<><04><15>~<7E>a<EFBFBD><14>&<26>&<26>&r)rrrrrrr0r1s@rrgrg<00>sV<00><><00><00><00><00><00><08><08>2'<27>$4<>'<27><15>'<27>'<27>'<27>'<27>'<27>'<27>'<27>'<27>'<27>'rrgc <00>R<00>eZdZdZdejddfdededededd f
d
<EFBFBD>Zd d defd <0A>Zd S)<0E>wait_exponential_jittera`Wait strategy that applies exponential backoff and jitter.
It allows for a customized initial wait, maximum wait and jitter.
This implements the strategy described here:
https://cloud.google.com/storage/docs/retry-strategy
The wait time is min(initial * 2**n + random.uniform(0, jitter), maximum)
where n is the retry count.
r4r^<00>initialr6r`<00>jitterrNc<00>><00>||_||_||_||_dSr
)rmr6r`rn)r rmr6r`rns rr'z wait_exponential_jitter.__init__<5F>s$<00><00><1F><04> <0C><16><04><08> <20><04> <0A><1C><04> <0B> <0B> rrrc<00><><00>tjd|j<00><00>} |j|jdz
z}|j|z|z}n#t $r
|j}YnwxYwtdt||j<00><00><00><00>S)Nrr4) r;rirnr`rNrmrcr6r5)r rrnrdrZs rrz wait_exponential_jitter.__call__<5F>s<><00><00><17><1E><01>4<EFBFBD>;<3B>/<2F>/<2F><06> <1E><16>-<2D>K<EFBFBD>$><3E><11>$B<>C<>C<EFBFBD><19>\<5C>C<EFBFBD>'<27>&<26>0<>F<EFBFBD>F<EFBFBD><46><1C> <1E> <1E> <1E><19>X<EFBFBD>F<EFBFBD>F<EFBFBD>F<EFBFBD> <1E><><EFBFBD><EFBFBD><12>1<EFBFBD>c<EFBFBD>&<26>$<24>(<28>+<2B>+<2B>,<2C>,<2C>,s<00><<00>A<03>A) rrrrrr[rr'rr rrrlrl<00>s<><00><00><00><00><00><00> <08> <08><1B><1B>_<EFBFBD><1B><19>
<1D>
<1D><16>
<1D><13>
<1D><18>
<1D>
<16>
<1D>
<0E>
<1D>
<1D>
<1D>
<1D>-<2D>$4<>-<2D><15>-<2D>-<2D>-<2D>-<2D>-<2D>-rrl)rr;r <00>tenacityr<00> TYPE_CHECKINGr<00>ABCrr!<00>Callablerre<00> WaitBaseTr#r,r3rrKrSr]rgrlr rr<00><module>rvsD<00><01>" <0B>
<EFBFBD>
<EFBFBD>
<EFBFBD> <0A> <0A> <0A> <0A> <0A> <0A> <0A> <0A><1B><1B><1B><1B><1B><1B> <09><17>(<28>'<27>'<27>'<27>'<27>'<27>'<27>#<23>#<23>#<23>#<23>#<23><03><07>#<23>#<23>#<23>" <13>L<EFBFBD><19>F<EFBFBD>O<EFBFBD>5E<35>4F<34><06> <0C>UZ<55>\_<>U_<55>H`<60>4`<60>$a<>a<> b<> <09><1F><1F><1F><1F><1F><19><1F><1F><1F><1C><1C><1C><1C><1C>
<EFBFBD><1C><1C><1C>h<01>h<01>h<01>h<01>h<01>)<29>h<01>h<01>h<01>H<01>H<01>H<01>H<01>H<01>9<EFBFBD>H<01>H<01>H<01>2<>2<>2<>2<>2<><19>2<>2<>2<>2-<2D>-<2D>-<2D>-<2D>-<2D> <09>-<2D>-<2D>-<2D>,<<3C><<3C><<3C><<3C><<3C>y<EFBFBD><<3C><<3C><<3C>D'<27>'<27>'<27>'<27>'<27>.<2E>'<27>'<27>'<27>>-<2D>-<2D>-<2D>-<2D>-<2D>i<EFBFBD>-<2D>-<2D>-<2D>-<2D>-r
Reference in New Issue Copy Permalink