← Back
Editing: cacheutil.cpython-311.pyc
� ��a � � � d Z ddlmZ G d� de� � Z G d� de� � Z G d� de� � Z G d � d e� � Z G d � d e� � Zd S )z� This module contains multithread-safe cache implementations. All Caches have getorbuild(key, builder) delentry(key) methods and allow configuration when instantiating the cache class. � )�timec �< � e Zd Zd d�Zd� Zd� Zd� Zd d�Zd� Zd � Z d S ) � BasicCache� c �V � || _ t ||dz z � � | _ i | _ d S )N� )� maxentries�int�prunenum�_dict)�selfr s �4/usr/lib/python3/dist-packages/py/_path/cacheutil.py�__init__zBasicCache.__init__ s, � �$����J��A� � 5�6�6�� ��� � � � c �8 � | j � � � d S �N)r �clear�r s r r zBasicCache.clear s � � � �������r c � � | j | S r )r )r �keys r � _getentryzBasicCache._getentry s � ��z�#�� r c �B � | � � � || j |< d S r )�_prunelowestweightr �r r �entrys r � _putentryzBasicCache._putentry s# � � � � �!�!�!� �� �3���r Fc �@ � | j |= d S # t $ r |r� Y d S w xY wr )r �KeyError)r r �raisings r �delentryzBasicCache.delentry sI � � �� �3������ � � �� �� � � � ���s � � � c � � | � |� � }n<# t $ r/ | � ||� � }| � ||� � Y nw xY w|j S r )r r �_buildr �value)r r �builderr s r � getorbuildzBasicCache.getorbuild$ sl � � '��N�N�3�'�'�E�E��� '� '� '��K�K��W�-�-�E� �N�N�3�� &� &� &� &� &� '���� �{�s � �6A�Ac �( � t | j � � }|| j k rnd� | j � � � D � � }|� � � || j z }|dk r)|d|� D ] \ }}| � |d�� � � dS dS dS )z' prune out entries with lowest weight. c �& � g | ]\ }}|j |f��S � )�weight)�.0r r s r � <listcomp>z1BasicCache._prunelowestweight.<locals>.<listcomp>1 s3 � � >� >� >� &�C�� �l�C�(� >� >� >r r NF)r )�lenr r �items�sortr r )r � numentriesr- �indexr) r s r r z BasicCache._prunelowestweight, s� � ����_�_� � �� � (� (�>� >�*.�*�*:�*:�*<�*<�>� >� >�E� �J�J�L�L�L� �� �.�E��q�y�y�#(��%��=� 6� 6�K�F�C��M�M�#�u�M�5�5�5�5� )� (� �y�6� 6r N)r )F) �__name__� __module__� __qualname__r r r r r r% r r( r r r r s� � � � � � �� � � � � � � � � � � � �� � � �� � � 6� 6� 6� 6� 6r r c � � e Zd ZdZd� ZdS )�BuildcostAccessCachea� A BuildTime/Access-counting cache implementation. the weight of a value is computed as the product of num-accesses-of-a-value * time-to-build-the-value The values with the least such weights are evicted if the cache maxentries threshold is superceded. For implementation flexibility more than one object might be evicted at a time. c �t � t � � } |� � }t � � }t |||z � � S r )�gettime�WeightedCountingEntry)r r r$ �start�val�ends r r" zBuildcostAccessCache._buildG s3 � �� � ���g�i�i���i�i��$�S�#�e�)�4�4�4r N)r1 r2 r3 �__doc__r" r( r r r5 r5 : s- � � � � � � � �5� 5� 5� 5� 5r r5 c �0 � e Zd Zd� Zd� Z ee� � ZdS )r8 c �0 � || _ |x| _ | _ d S r )�_valuer) � _oneweight)r r# � oneweights r r z WeightedCountingEntry.__init__O s � ��� �(1�1�� �d�o�o�or c �: � | xj | j z c_ | j S r )r) r@ r? r s r r# zWeightedCountingEntry.valueS s � � � � �t��&� � ��{�r N)r1 r2 r3 r r# �propertyr( r r r8 r8 N s; � � � � � �2� 2� 2�� � � �H�U�O�O�E�E�Er r8 c �0 � � e Zd ZdZd� fd� Zd� Zd� Z� xZS )� AgingCachez; This cache prunes out cache entries that are too old. r � $@c �f �� t t | � � � |� � || _ d S r )�superrE r � maxseconds)r r rI � __class__s �r r zAgingCache.__init__[ s, �� � �j�$� � �(�(��4�4�4�$����r c � � | j | }|� � � r$| � |� � t |� � �|S r )r � isexpiredr r r s r r zAgingCache._getentry_ sB � �� �3��� �?�?� � � � �M�M�#� � � ��3�-�-� �� r c �b � |� � }t |t � � | j z � � }|S r )� AgingEntryr7 rI )r r r$ r: r s r r" zAgingCache._buildf s, � ��g�i�i���3�� � �D�O� ;�<�<��� r )r rF )r1 r2 r3 r< r r r" � __classcell__)rJ s @r rE rE X se �� � � � � �� �%� %� %� %� %� %�� � �� � � � � � r rE c � � e Zd Zd� Zd� ZdS )rN c �" � || _ || _ d S r )r# r) )r r# �expirationtimes r r zAgingEntry.__init__l s � ��� �$�� � � r c �4 � t � � }|| j k S r )r7 r) )r �ts r rL zAgingEntry.isexpiredp s � � �I�I���D�K� � r N)r1 r2 r3 r rL r( r r rN rN k s2 � � � � � �%� %� %� � � � � r rN N) r< r r7 �objectr r5 r8 rE rN r( r r �<module>rV s �� � � !� � � � � �+6� +6� +6� +6� +6�� +6� +6� +6�Z5� 5� 5� 5� 5�:� 5� 5� 5�( � � � � �F� � � �� � � � �� � � �& � � � � �� � � � � r
Save File
Cancel