📁 File Manager Pro
v10.0.3 | PHP: 8.2.31
Server: LiteSpeed
2026-06-29 05:36:05
📂
/ (Root)
/
opt
/
alt
/
python313
/
lib
/
python3.13
/
site-packages
/
pip
/
_vendor
/
tenacity
/
__pycache__
📍 /opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/tenacity/__pycache__
🔄 Refresh
✏️
Editing: wait.cpython-313.pyc
Read Only
� 2biX � � � S SK r S SKrS SKrS SKJr \R ( a S SKJr " S S\ R 5 r\R \\R S/\R \ \ 4 4 4 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 r " S S\5 rg)� N)�_utils)�RetryCallStatec �~ � \ rS rSrSr\R SSS\4S j5 rS S jr SS S\ R S 4S jr S r g )� wait_base� z(Abstract base class for wait strategies.� retry_stater �returnc � � g �N� ��selfr s ڋ/builddir/build/BUILDROOT/alt-python313-pip-23.3.1-3.el8.x86_64/opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/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__� __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 S r g) � wait_fixed�/ zCWait strategy that waits a fixed amount of time between each retry.�waitr Nc �: � [ R " U5 U l g r )r � to_secondsr) )r r+ s r �__init__�wait_fixed.__init__2 s � � �+�+�D�1��r r r c � � U R $ r �r) r s r r �wait_fixed.__call__5 s � ���� r r1 � r r r r r! r �time_unit_typer. r$ r r' r r r r) r) / s2 � �M�2�V� 2� 2� 2�t� 2� �$4� �� r r) c �0 ^ � \ rS rSrSrSU 4S jjrSrU =r$ )� wait_none�9 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 9 s �� �A� � r r6 c �l � \ rS rSrSrS S\R S\R SS4S jjrSS S\4S jr S r g) � wait_random�@ 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__C s( � � %� 0� 0�� 5�� � %� 0� 0�� 5�� r r r c �z � U R [ R " 5 U R U R - - - $ r )rD �randomrE r s r r �wait_random.__call__G s0 � ��#�#�v�}�}��$�:N�:N�QU�Qe�Qe�:e�'f�g�gr )rE rD )r � r3 r r r r? r? @ sC � �K�6�F� 1� 1� 6�F�<Q�<Q� 6�Z^� 6�h�$4� h�� hr r? c �< � \ rS rSrSrS\SS4S jrSSS\4S jrS r g) r �K z#Combine several waiting strategies.� strategiesr Nc � � Xl g r �� wait_funcs�r rM s r r. �wait_combine.__init__N � � �$�r r r c �B ^� [ U4S jU R 5 5 $ )Nc 3 �. ># � U H o" TS 9v � M g7f)�r Nr )�.0�xr s �r � <genexpr>�(wait_combine.__call__.<locals>.<genexpr>R s �� � �G��!�1��-��s �)�sumrP r s `r r �wait_combine.__call__Q s �� ��G�t���G�G�Gr rO � r r r r r! r r. r$ r r' r r r r r K s/ � �-�%�I� %�$� %�H�$4� H�� Hr r c �< � \ rS rSrSrS\SS4S jrSSS\4S jrS r g) � wait_chain�U a� 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.") rM r Nc � � Xl g r �rM rQ s r r. �wait_chain.__init__e rS r r r c � � [ [ UR S5 [ U R 5 5 nU R US- nU" US9$ )NrJ rV )rA rB �attempt_number�lenrM )r r � wait_func_no� wait_funcs r r �wait_chain.__call__h sB � ��3�{� 9� 9�1�=�s�4�?�?�?S�T� ��O�O�L�1�$4�5� ��[�1�1r rb r] r r r r_ r_ U s. � � � %�I� %�$� %�2�$4� 2�� 2r r_ c � � \ rS rSrSrSS\R 4S\R S\R S\R SS 4S jjrS S S\ 4S jr Sr g )�wait_incrementing�n z�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� incrementrB r Nc � � [ R " U5 U l [ R " U5 U l [ R " U5 U l g r )r r- rn ro rB )r rn ro rB s r r. �wait_incrementing.__init__u s: � � �&�&�u�-�� � �*�*�9�5����$�$�S�)��r r r c � � U R U R UR S- - - n[ S[ X R 5 5 $ �NrJ r )rn ro re rB rA )r r �results r r �wait_incrementing.__call__ s: � ����t�~�~��1K�1K�a�1O� P�Q���1�c�&�(�(�+�,�,r )ro rB rn ) r r r r r! r �MAX_WAITr4 r. r$ r r' r r r rk rk n sg � �� ()�+.�%+�_�_� *��$�$�*� �(�(�*� � "� "� *� � *�-�$4� -�� -r rk c �� � \ rS rSrSrS\R SS4S\R \ \ 4 S\R S\R \ \ 4 S \R S S 4 S jjr S SS \ 4S jr Srg )�wait_exponential� a� 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. rJ � r � multiplierrB �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- - nU R U- n[ [ SU R 5 [ X0R 5 5 $ ! [ a U R s $ f = frs )r| re r{ � OverflowErrorrB rA )r r �exprt 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 rv r% r& �intr$ r4 r. r r' r r r rx rx � s� � � � 01�%+�_�_�-.�%&� !��L�L��e��,� !� � "� "� !� �,�,�s�E�z�*� !� � "� "� !� � !�<�$4� <�� <r rx c �8 ^ � \ rS rSrSrSSS\4U 4S jjrSrU =r$ )�wait_random_exponential� a� 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 r c �L >� [ TU ] US9n[ R " SU5 $ )NrV r )r9 r rH �uniform)r r �highr: s �r r � wait_random_exponential.__call__� s& �� ��w� �K� �8���~�~�a��&�&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 S 4 S jjrS S S \4S jr Sr g )�wait_exponential_jitter�� aH 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. rJ rz �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- - nU R 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� rt s r r � wait_exponential_jitter.__call__� 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 rv r$ r. r r' r r r r� r� � sb � � � ��_�_��� �� � � � � � � � � �-�$4� -�� -r r� )r" rH r% �pip._vendor.tenacityr � TYPE_CHECKINGr �ABCr r& �Callabler$ r� � WaitBaseTr) r6 r? r r_ rk rx r� r� r r r �<module>r� s� ��" � � � '� ���3�#���� #�" �L�L��F�O�O�5E�4F�� � �UZ�\_�U_�H`�4`�$a�a� b� � �� � � � �h�)� h�H�9� H�2�� 2�2-� � -�, <�y� <�D '� .� '�> -�i� -r
💾 Save Changes
❌ Cancel