codekingpro/portable-devtools
115k
1�
2 r�j�$ � � � S SK r S SKrS SKrS SKJr \R3 ( a S SKJr " S S\ R 5 r\R \\R S/\R \ \ 4 4 4 r
" S S\5 r " S S4\5 r " S S \5 r " S
S\5 r " S S\5 r " S S\5 r " S S\5 r " S S\5 r " S S\5 r " S S\5 rg)� N)�_utils)�RetryCallStatec �~ � \ rS rSrSr\R SSS\4S j5 rS
S jr SS S\5R S 4S6 jr S r
g )� wait_base� z(Abstract base class for wait strategies.� retry_stater �returnc � � g �N� ��selfr s �SD:\code\apps\devtools\python\user_packages\Python313\site-packages\tenacity/wait.py�__call__�wait_base.__call__ s � � � �otherc � � [ X5 $ r )� wait_combine�r r s r �__add__�wait_base.__add__" s
� ��D�(�(r )r r c �4 � US:X a U $ U R U5 $ �Nr )r r s r �__radd__�wait_base.__radd__% s � � �A�:��K��|�|�E�"�"r r N)r r r r )�__name__�7__module__� __qualname__�__firstlineno__�__doc__�abc�abstractmethod�floatr r �typing�Unionr �__static_attributes__r r r r r sN � �2����
�$4�
��
� �
�)�#�k� #�f�l�l�;V�.W� #r r r c �P � \ rS rSrSrS\R SS4S jrSSS\4S jr S8r9g) �10wait_fixed�1 zCWait strategy that waits a fixed amount of time between each retry.�waitr Nc �: � [ R " U5 U l g r )r �11to_secondsr) )r r+ s r �__init__�wait_fixed.__init__4 s � � �+�+�D�1��r r r c � � U R $ r �r) r
s r r �wait_fixed.__call__7 s � ���� r r1 � r r r r r! r �time_unit_typer. r$ r r' r r r r) r) 1 s2 � �M�2�V� 2� 2� 2�t� 2� �$4� �� r r) c �0 ^ � \ rS rSrSrSU 4S jjrSrU =r$ )� wait_none�; z7Wait strategy that doesn't wait at all before retrying.c �$ >� [ TU ] S5 g r )�superr. )r � __class__s �r r. �wait_none.__init__> s �� �
����r r )r N)r r r r r! r. r' �
__classcell__�r: s @r r6 r6 ; s �� �A� � r r6 c �n � \ rS rSrSr S S\R S\R SS4S jjrSS S\4S12 jr S r13g)
� wait_random�B zAWait strategy that waits a random amount of time between min/max.�min�maxr Nc �p � [ R " U5 U l [ R " U5 U l g r )r r- �wait_random_min�wait_random_max)r rA rB s r r. �wait_random.__init__E s* � � &� 0� 0�� 5�� � %� 0� 0�� 5�� r r r c �z � U R [ R " 5 U R U R -14 - - $ r )rD �randomrE r
s r r �wait_random.__call__K s4 � ��#�#� �M�M�O�t� 3� 3�d�6J�6J� J� K�15� 16r )rE rD )r � r3 r r r r? r? B sI � �K� LM�6��(�(�6�39�3H�3H�6�
�6� 17�$4� 18�� 19r r? c �< � \ rS rSrSrS\SS4S jrSSS\4S jrS20r g) r �Q z#Combine several waiting strategies.�21strategiesr Nc � � Xl g r ��22wait_funcs�r rM s r r. �wait_combine.__init__T � � �$�r r r c �B ^� [ U4S jU R 5 5 $ )Nc 3 �. ># � U H23 o" TS 9v � M g7f)�r Nr )�.0�xr s �r � <genexpr>�(wait_combine.__call__.<locals>.<genexpr>X s �� � �G��!�1��-��s �)�sumrP r
s `r r �wait_combine.__call__W s �� ��G�t���G�G�Gr rO �24r r r r r! r r. r$ r r' r r r r r Q s/ � �-�%�I� %�$� %�H�$4� H�� Hr r c �< � \ rS rSrSrS\SS4S jrSSS\4S jrS25r g) �26wait_chain�[ a� Chain two or more waiting strategies.27 28If all strategies are exhausted, the very last strategy is used29thereafter.30 31For example::32 33 @retry(wait=wait_chain(*[wait_fixed(1) for i in range(3)] +34 [wait_fixed(2) for j in range(5)] +35 [wait_fixed(5) for k in range(4)]))36 def wait_chained():37 print("Wait 1s for 3 attempts, 2s for 5 attempts and 5s "38 "thereafter.")39rM r Nc � � Xl g r �rM rQ s r r. �wait_chain.__init__k rS r r r c � � [ [ UR S5 [ U R 5 5 nU R US-40 nU" US9$ )NrJ rV )rA rB �attempt_number�lenrM )r r � wait_func_no� wait_funcs r r �wait_chain.__call__n sB � ��3�{� 9� 9�1�=�s�4�?�?�?S�T� ��O�O�L�1�$4�5� ��[�1�1r rb r] r r r r_ r_ [ s. � �
� %�I� %�$� %�2�$4� 2�� 2r r_ c �\ � \ rS rSrSrS\R \/\4 SS4S jr SSS\4S jr41S42r g) �wait_exception�t a� Wait strategy that waits the amount of time returned by the predicate.43 44The predicate is passed the exception object. Based on the exception, the45user can decide how much time to wait before retrying.46 47For example::48 49 def http_error(exception: BaseException) -> float:50 if (51 isinstance(exception, requests.HTTPError)52 and exception.response.status_code == requests.codes.too_many_requests53 ):54 return float(exception.response.headers.get("Retry-After", "1"))55 return 60.056 57 58 @retry(59 stop=stop_after_attempt(3),60 wait=wait_exception(http_error),61 )62 def http_get_request(url: str) -> None:63 response = requests.get(url)64 response.raise_for_status()65� predicater Nc � � Xl g r �rm )r rm s r r. �wait_exception.__init__� s � �"�r r r c � � UR c [ S5 eUR R 5 nUc [ S5 eU R U5 $ )Nz(__call__() called before outcome was setz(outcome failed but the exception is None)�outcome� RuntimeError� exceptionrm )r r rt s r r �wait_exception.__call__� sO � � � � � &� � I�J� J� �'�'�1�1�3� � � � � I�J� J��~�~�i�(�(r ro ) r r r r r! r% �Callable�
BaseExceptionr$ r. r r' r r r rk rk t s> � ��2#�&�/�/�=�/�5�2H�"I� #�d� #�)�$4� )�� )r rk c � � \ rS rSrSrSS\R 4S\R S\R S\R SS 4S66 jjrS S S\ 4S
jr67Sr g )�wait_incrementing� z�Wait an incremental amount of time after each attempt.68 69Starting at a starting value and incrementing by a value for each attempt70(and restricting the upper limit to some maximum value).71r �d �start� incrementrB r Nc � � [ R " U5 U l [ R " U5 U l [ R " U5 U l g r )r r- r| r} rB )r r| r} rB s r r. �wait_incrementing.__init__� s: � � �&�&�u�-��72� �*�*�9�5����$�$�S�)��r r r c � � U R U R UR S-73 - - n[ S[ X R 5 5 $ �NrJ r )r| r} re rB rA )r r �results r r �wait_incrementing.__call__� s: � ����t�~�~��1K�1K�a�1O� P�Q���1�c�&�(�(�+�,�,r )r} rB r| ) r r r r r! r �MAX_WAITr4 r. r$ r r' r r r ry ry � sg � �� ()�+.�%+�_�_� *��$�$�*� �(�(�*� �
"�
"� *�74 75� *�-�$4� -�� -r ry c �� � \ rS rSrSrS\R SS4S\R \ \764 S\R S\R \ \774 S \R S78S 479S jjr S
SS80\814S jr
Srg )�wait_exponential� a� Wait strategy that applies exponential backoff.82 83It allows for a customized multiplier and an ability to restrict the84upper and lower limits to some maximum and minimum value.85 86The intervals are fixed (i.e. there is no jitter), so this strategy is87suitable for balancing retries against latency when a required resource is88unavailable for an unknown duration, but *not* suitable for resolving89contention between multiple processes for a shared resource. Use90wait_random_exponential for the latter case.91rJ � r �92multiplierrB �exp_baserA r Nc � � Xl [ R " U5 U l [ R " U5 U l X0l g r )r� r r- rA rB r� )r r� rB r� rA s r r. �wait_exponential.__init__� s2 � � %���$�$�S�)����$�$�S�)��� �
r r r c �� � U R UR S-93 - nU R U- n[ [ SU R94 5 [ X0R 5 5 $ ! [ a U R s $ f = fr� )r� re r� �
OverflowErrorrB rA )r r �expr� s r r �wait_exponential.__call__� sk � � ��-�-�K�$>�$>��$B�C�C��_�_�s�*�F� �3�q�$�(�(�#�S����%:�;�;�� � ��8�8�O� �s �+A � A9�8A9)r� rB rA r� )r r r r r! r r� r% r& �intr$ r4 r. r r' r r r r� r� � s� � �95� 01�%+�_�_�-.�%&� 96!��L�L��e��,�97!� �
"�
"�98!� �,�,�s�E�z�*� 99!�100 �
"�
"� 101!� 102�
103!�<�$4� <�� <r r� c �8 ^ � \ rS rSrSrSSS\4U 4S jjrSrU =r$ )�wait_random_exponential�� a� Random wait with exponentially widening window.104 105An exponential backoff strategy used to mediate contention between multiple106uncoordinated processes for a shared resource in distributed systems. This107is the sense in which "exponential backoff" is meant in e.g. Ethernet108networking, and corresponds to the "Full Jitter" algorithm described in109this blog post:110 111https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/112 113Each retry occurs at a random time in a geometrically expanding interval.114It allows for a custom multiplier and an ability to restrict the upper115limit of the random interval to some maximum value.116 117Example::118 119 wait_random_exponential(multiplier=0.5, # initial window 0.5s120 max=60) # max 60s timeout121 122When waiting for an unavailable resource to become available again, as123opposed to trying to resolve contention for a shared resource, the124wait_exponential strategy (which uses a fixed interval) may be preferable.125 126r r r c �` >� [ TU ] US9n[ R " U R U5 $ )NrV )r9 r rH �uniformrA )r r �highr: s �r r � wait_random_exponential.__call__� s* �� ��w� �K� �8���~�~�d�h�h��-�-r r ) r r r r r! r$ r r' r< r= s @r r� r� � s! �� ��2.�$4� .�� .� .r r� c �h � \ rS rSrSrS\R SS4S\S\S\S\S S1274128S jjrS S
S \4S jr Sr129g130)�wait_exponential_jitter�� aH Wait strategy that applies exponential backoff and jitter.131 132It allows for a customized initial wait, maximum wait and jitter.133 134This implements the strategy described here:135https://cloud.google.com/storage/docs/retry-strategy136 137The wait time is min(initial * 2**n + random.uniform(0, jitter), maximum)138where n is the retry count.139rJ r� �initialrB r� �jitterr Nc �4 � Xl X l X0l X@l g r )r� rB r� r� )r r� rB r� r� s r r. � wait_exponential_jitter.__init__� s � � � ��� �
� � r r r c � � [ R " SU R 5 n U R UR S-140 - nU R141 U- U- n[ S[ X@R 5 5 $ ! [ a U R n N7f = f)Nr rJ ) rH r� r� r� re r� r� rB rA )r r r� r� r� s r r � wait_exponential_jitter.__call__142 sy � �� � ��4�;�;�/�� ��-�-�K�$>�$>��$B�C�C��\�\�C�'�&�0�F� �1�c�&�(�(�+�,�,�� � ��X�X�F� �s �.A0 �0B �B )r� r� r� rB ) r r r r r! r r� r$ r. r r' r r r r� r� � sb � � � ��_�_��� 143 ��144 � �145 � � 146 �147 � 148 � 149�
150 �-�$4� -�� -r r� )r" rH r% �tenacityr �
TYPE_CHECKINGr �ABCr r& rv r$ r� � WaitBaseTr) r6 r? r r_ rk ry r� r� r� r r r �<module>r� s� ��" �
�
� � ���'�#���� #�"
�L�L�
�v��� 0� 1�6�<�<��s�151�3K� K�L�L�
� �152 �� � �153� � 154�)� 155� H�9� H�2�� 2�2$)�Y� $)�N-� � -�, <�y� <�D .� .� .�> -�i� -r