| Server IP : 217.160.0.244 / Your IP : 216.73.217.138 Web Server : Apache System : Linux infong-eu155 4.4.400-icpu-108 #2 SMP Wed Feb 11 11:51:01 UTC 2026 x86_64 User : u100174116 ( 6746176) PHP Version : 8.5.10 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /lib/python3/dist-packages/breezy/__pycache__/ |
Upload File : |
�
p��g�& � �P � S r SSKJr SSKJrJr " S S\5 r " S S\5 rg) z)A simple first-in-first-out (FIFO) cache.� )�deque)�Any�Callablec � � \ rS rSrSrSS\SS4S jjrS rS rSS jr S
r
S r S r S
r
S rSS jrS rSS jrS rSS jrS rSrg)� FIFOCache� z<A class which manages a cache of entries, removing old ones.N� max_cache�returnc �� � [ R U 5 Xl Uc U R S- S- U l O[ X R 5 U l 0 U l [
5 U l g )N� �
)�dict�__init__�
_max_cache�_after_cleanup_count�min�_cleanupr �_queue��selfr �after_cleanup_counts �3/usr/lib/python3/dist-packages/breezy/fifo_cache.pyr �FIFOCache.__init__ sX � � �
�
�d��#�� � &�(,���!�(;�r�(A�D� %�(+�,?� � �(Q�D� %�
�
�
� #(�'�� � c �$ � U R XSS9 g)z<Add a value to the cache, there will be no cleanup function.N)�cleanup)�add)r �key�values r � __setitem__�FIFOCache.__setitem__& s � � ����T��*r c �\ � U R R U5 U R U5 g �N)r �remove�_remove�r r s r � __delitem__�FIFOCache.__delitem__* s � � � � ���3� � � � �S�r c �� � X; a X U R R U5 [ R XU5 Ub X0R U' [ U 5 U R :� a U R 5 gg)aE Add a new value to the cache.
Also, if the entry is ever removed from the queue, call cleanup.
Passing it the key and value being removed.
:param key: The key to store it under
:param value: The object to store
:param cleanup: None or a function taking (key, value) to indicate
'value' should be cleaned up
N)r �appendr r r �lenr r )r r r r s r r �
FIFOCache.add/ sb � � �;� � � � � ���3� � ����E�*� � �!(�M�M�#� � �t�9�t��� &� �L�L�N� 'r c � � U R $ )z(Get the number of entries we will cache.)r �r s r �
cache_size�FIFOCache.cache_sizeE s � ���� r c �> � [ U 5 U R :� a+ U R 5 [ U 5 U R :� a M+ [ U R 5 [ U 5 :w a7 [ SR [ U R 5 [ U 5 5 5 eg)z�Clear the cache until it shrinks to the requested size.
This does not completely wipe the cache, just makes sure it is under
the after_cleanup_count.
zLThe length of the queue should always equal the length of the dict. {} != {}N)r+ r �_remove_oldestr �AssertionError�formatr. s r r �FIFOCache.cleanupI s| � � �$�i�$�3�3�3� � � � !� �$�i�$�3�3�3� �t�{�{� �s�4�y� (� �4�4:�F�3�t�{�{�;K�S�QU�Y�4W��
� )r c �F � U ( a U R 5 U ( a M gg)zClear out all of the cache.N)r2 r. s r �clear�FIFOCache.clearX s � � � � � � !� �dr c �~ � U R R US5 n[ R X5 nUb U" X5 U$ )z:Remove an entry, making sure to call any cleanup function.N)r �popr )r r r �vals r r% �FIFOCache._remove^ s; � ��-�-�#�#�C��.�� �h�h�t�!�� � � �C� ��
r c �Z � U R R 5 nU R U5 g)zRemove the oldest entry.N)r �popleftr% r& s r r2 �FIFOCache._remove_oldesth s � ��k�k�!�!�#�� � � �S�r c � � Xl Uc US- S- U l O[ X5 U l [ U 5 U R :� a U R 5 gg)z�Increase/decrease the number of cached entries.
:param max_cache: The maximum number of entries to cache.
:param after_cleanup_count: After cleanup, we should have at most this
many entries. This defaults to 80% of max_cache.
Nr r
)r r r r+ r r s r �resize�FIFOCache.resizem sK � � $�� � &�(1�A�
��(;�D� %�(+�I�(K�D� %� �t�9�t��� &� �L�L�N� 'r c �, � [ U R 5 er# )�NotImplementedError�copyr. s r rE �FIFOCache.copy~ s � �!�$�)�)�,�,r c �, � [ U R 5 er# )rD r: )r r �defaults r r: �
FIFOCache.pop� s � � "�$�(�(�+�+r c �, � [ U R 5 er# )rD �popitemr. s r rK �FIFOCache.popitem� s � �!�$�,�,�/�/r c � � X; a X $ X U' U$ )zSimilar to dict.setdefault.� )r r �
defaultvals r �
setdefault�FIFOCache.setdefault� s � � �;��9� � �S� ��r c �h � [ U5 S:X aX US n[ U[ 5 ( a U H nU R XCU 5 M OFUS H u pEU R XE5 M O&[ U5 S:� a [ S[ U5 35 eU( a U H nU R XBU 5 M gg)zSimilar to dict.update().� r z(update expected at most 1 argument, got N)r+ �
isinstancer r � TypeError)r �args�kwargs�argr r; s r �update�FIFOCache.update� s� � � �t�9��>��q�'�C��#�t�$�$� �C��H�H�S�c�(�+� � !%�Q��H�C��H�H�S�&� !(�
��Y��]�� F�s�4�y�k� R�S� S� � ������S�k�*� � r )r r r r )�d Nr# )�__name__�
__module__� __qualname__�__firstlineno__�__doc__�intr r r' r r/ r r7 r% r2 rA rE r: rK rP rY �__static_attributes__rN r r r r s^ � �F�
*�#�
*�$�
*�+��
�, �
� "� ��
�"-�,�0��+r r c �J � \ rS rSrSr S S jrS S jrS rS rS r S S jr
S
r g)
�
FIFOSizeCache� z�An FIFOCache that removes things based on the size of the values.
This differs in that it doesn't care how many actual items there are,
it restricts the cache to be cleaned based on the size of the data.
Nc �� � [ R XS9 Xl Uc U R S- S- U l O[ X R 5 U l SU l X0l Uc [ U l gg)aR Create a new FIFOSizeCache.
:param max_size: The max number of bytes to store before we start
clearing out entries.
:param after_cleanup_size: After cleaning up, shrink everything to this
size (defaults to 80% of max_size).
:param compute_size: A function to compute the size of a value. If
not supplied we default to 'len'.
)r Nr r
r )r r � _max_size�_after_cleanup_sizer � _value_size�
_compute_sizer+ )r �max_size�after_cleanup_size� compute_sizes r r �FIFOSizeCache.__init__� si � � ���4��4�!�� � %�'+�~�~��'9�R�'?�D� $�'*�+=�~�~�'N�D� $� ��� )�� � �!$�D� � r c �X � X; a X U R U5 nX@R :� a gU R R U5 [ R XU5 Ub X0R U' U =R U-
sl U R U R :� a U R 5 gg)a� Add a new value to the cache.
Also, if the entry is ever removed from the queue, call cleanup.
Passing it the key and value being removed.
:param key: The key to store it under
:param value: The object to store, this value by itself is >=
after_cleanup_size, then we will not store it at all.
:param cleanup: None or a function taking (key, value) to indicate
'value' sohuld be cleaned up.
N)
rj rh r r* r r r ri rg r )r r r r � value_lens r r �FIFOSizeCache.add� s� � � �;� � ��&�&�u�-� � �0�0� 0� � � � ���3� � ����E�*� � �!(�M�M�#� � ���I�%�� � � �d�n�n� ,� �L�L�N� -r c � � U R $ )z&Get the number of bytes we will cache.)rg r. s r r/ �FIFOSizeCache.cache_size� s � ��~�~� r c � � U R U R :� a- U R 5 U R U R :� a M, gg)z�Clear the cache until it shrinks to the requested size.
This does not completely wipe the cache, just makes sure it is under
the after_cleanup_size.
N)ri rh r2 r. s r r �FIFOSizeCache.cleanup� s: � � � � ��!9�!9�9� � � � !� � � ��!9�!9�9r c �x � [ R X5 nU =R U R U5 - sl U$ )z8Remove an entry, making sure to maintain the invariants.)r r% ri rj )r r r; s r r% �FIFOSizeCache._remove� s3 � �� � ��*�� ���D� .� .�s� 3�3���
r c �� � [ R X5 Xl Uc US- S- U l O[ X5 U l U R
U R :� a U R
5 gg)z�Increase/decrease the amount of cached data.
:param max_size: The maximum number of bytes to cache.
:param after_cleanup_size: After cleanup, we should have at most this
many bytes cached. This defaults to 80% of max_size.
Nr r
)r rA rg rh r ri r )r rk rl s r rA �FIFOSizeCache.resize� s[ � � ����(�!�� � %�'/�!�|�r�'9�D� $�'*�8�'H�D� $� � � �d�n�n� ,� �L�L�N� -r )rh rj rg ri )i NNr# ) r\ r] r^ r_ r` r r r/ r r% rA rb rN r r rd rd � s, � �� KO�%�2 �< �"�� r rd N) r` � collectionsr �typingr r r r rd rN r r �<module>r| s- ��" 0� � �K+�� K+�\`�I� `r